l*****g
发帖数: 49 | 1
General conferences:
first tier: STOC and FOCS
second tier: SODA, ICALP
others: ESA, ISAAC, STACS, COCOON, FSTTCS
other more specific conference:
SoCG for computational geometry
SPAA for parallel algorithms
IPCO for combinatorial optimization
RANDOM for randomized techniques
APPROX for approximation algorithms
then there are other conferences for computational complexity:
CCC: computational complexity
CRYPTO: cryptography |
|
w*****e
发帖数: 23 | 2 Assume n is too big, and existed items are sparse compared to n, you may
want to look at the multiple-dimension aggregation algorithm in data mining
. Although it is multi-dimension, the algorithm have good performance on how
to iterate through the whole dimension and acount for each item in cell. |
|
d*******g
发帖数: 36 | 3
But it seems there are algorithms with O(|E|\sqrt(|V|)) for maximum bipartite
matching and algorithms with O(|V|*(|E|+|V|log|V|)) for its weighted version. |
|
r********n
发帖数: 61 | 4 唉, 小弟文科男, 选了一门algorithm的课...
求大侠给个思路, 作业不会啊.....
1. a very large department has a mix of 100 professors: some are honest,
while other are deceitful. the honest ones always tell the truth, but the
deceitful one sometimes tell the truth and sometimes lie. you can ask any
professors the following question about any other profess:"professor y, is
professor x honest?"
professor y will answer with either yes or no. design an algorithm that with
no more than 198 questions, would allow you to figure out |
|
q******u
发帖数: 79 | 5 algorithm 怎么复习考试呀?
哪里有algorithm的习题集，可以系统的看看有什么问题呀?
谢谢 |
|
k**********g
发帖数: 989 | 6 The tao of parallelism in algorithms.
Keshav Pingali, Donald Nguyen, Milind Kulkarni, Martin Burtscher, Muhammad
Amber Hassaan, Rashid Kaleem, Tsung-Hsien Lee, Andrew Lenharth, Roman
Manevich, Mario Méndez-Lojo, Dimitrios Prountzos, Xin Sui
有谁大牛看得懂这篇文章？引言头一句就推翻了 Dependence Graph 对 Parallel
algorithm 的关键作用？ |
|
c******n
发帖数: 4965 | 7 【 以下文字转载自 JobHunting 讨论区 】
发信人: creation (努力自由泳50m/45sec !), 信区: JobHunting
标 题: question about google algorithm/architecture
发信站: BBS 未名空间站 (Fri Jul 17 12:47:50 2015, 美东)
actually it's more of a question on general search/IR algorithms
http://stackoverflow.com/questions/31469736/in-what-order-are-d
anybody can shed some light on this? |
|
w***s
发帖数: 61 | 8 【 以下文字转载自 Programming 讨论区,原文如下 】
发信人: emcc (Tarzan), 信区: Programming
标 题: Help: O(|E|) algorithm for Minimal Spanning Tree
发信站: The unknown SPACE (Mon Sep 4 08:46:31 2000) WWW-POST
Given a graph G=(E,V), and edge e in G, find a O(|E|)
algorithm
to test whether e is contained in some of G's Minimal
Spanning
Tree.
Thanks in advance. |
|
l******e
发帖数: 37 | 9 学过core java 1 和一本教材Data Structures& algorithms in java （Michael T.
Goodrich）
都比较基本，现在想上个台阶，再看本advanced一点的 java algorithms的书
amazon上找了一圈眼看花了
请达人推荐本吧,主要看算法，覆盖java面试最好 |
|
s*********n
发帖数: 237 | 10 【 以下文字转载自 JobHunting 讨论区 】
发信人: sunmountain (日暮山紫), 信区: JobHunting
标 题: Recommend a Book about Algorithm?
发信站: BBS 未名空间站 (Fri Mar 18 11:46:04 2011, 美东)
I am not in CS major. But I have done quite a bit java/javascript
developing for another lab and thinking about
a job in coding. I have some knowledge with data structure and quite
extensive knowledge about OO and
java. I am wondering if anyone can recommend a book for algorithm, mostly
for interview, but also for
myself's improvement. Thank... 阅读全帖 |
|
l*********d
发帖数: 78 | 11 I've taken it last time. It's a good course.
The instructor illustrated performances of difference
algorithms very well (actually his research area is about
this). I even bought his book.
Now I'm taking his other course: Analytic Combinatorics
and hoping that part 2 for algorithms will come soon. :) |
|
c*****t
发帖数: 1879 | 12 Constant time to find the result? It would just be an formula to calculate
the # of comparisons to find the result. It's just like you can use
Fib math formula to directly calculate the N-th number in constant time, or
use linear algorithm to find the result.
Algorithm wise, the problem can be solved in linear time using N-1
comparisons. If using parallelism, if I remember correctly, ln(N) time is
required, but overhead is large. You can think it as merge sort to
distribute the comparison ta |
|
w**b
发帖数: 19 | 13 总体上的确是大牛的书，很深，很细，文笔上稍差，有不少小错误。
以前学过数据结构，这一个多月抽时间看了一大半Robert Sedgewick的"algorithms in C",感觉讲的很细（
这是这本书的特点），每个算法的性能分析，用途，实现技巧，本质，和其他算法的联
系都写到了，可惜文笔不是特别流畅，有时让人难以理解。有人说他的图例很好，我觉
得还不如直接看程序来得快。
我的阅读速度实在是太慢，觉得有些地方实在是太细太难太学术化，完全理解要花太多
时间，面试可能用不上。反正基本数据结构和算法我基本都知道了，所以暂时不看了，
现在开始直接阅读interview exposed，programming pearl，然后多做一些面试题。
大家感觉我的面试准备计划怎么样？algorithms in C 里面的一些高级数据结构比如红
黑树真有必要细看吗？可能他们能开拓知识面，但是对面试用处似乎不大。主要是仔细把全书看一遍太花时间。而且脑袋疼：）
欢迎大家的宝贵意见。 |
|
z***e
发帖数: 5393 | 14 我觉得这本书比那个introduction to algorithms要好看，也要细得多。
关键是这本书讲清楚了每个算法和data structure的来龙去脉，从sort那一章就从最初
级的bubble sort慢慢延伸出来，一点点地改进到quick sort，然后以此为依据延伸到
radix/red-black tree/...这是一本我愿意在厕所阅读的书.
那什么introduction to algorithms章节之间可以说完全没联系，总之heap是heap,bst
是bst，avl是avl，之间有什么联系是完全不说，反正就给你分析O(n)/O(lgn)...过分
理论化，看了也不知道有什么用。 |
|
I****k
发帖数: 35 | 15 In STL, Sort algorithm take two iterator parameters, can we pass two
points to begin/end of an array to Sort algorithm in STL? why? |
|
e*u
发帖数: 17 | 16 I made a mistake. My algorithm is exponential in worst case.
it depends on the granularity of "time".
But I think my algorithm is right, and it is very simple.
why don't you just spend 20 minutes at most to write it out,
then run some test cases on it to see if it satisfy your requirements. |
|
w**q
发帖数: 3 | 17 Implement an algorithm to sort a linked list. Why did you pick the method
you did? Now do it in O(n) time.
how to get O(n)???
The famous sort algorithms are all O(nlog(n))
thanks a lto! |
|
z****e
发帖数: 2024 | 18 简短节说：
auto_ptr > p=(new vector);
//...something
transform( p->begin(),p->end(),p->begin(),
bind2nd(multiplies(), 10.0) );
//此处看看p.
问题1：发现p并没有失去 ownership,但是还是心虚，需要大牛confirm。
我知道auto_ptr不能作为容器元素，
问题2：但是auto_ptr作为函数参数的时候，往往会失去ownership是吗？
问题3：使用generic algorithm，什么时候auto_ptr会失去ownership 呢？
问题4：那么使用generic algorithm,auto_ptr结合， 例如上面的东东，需要注意什么
呢？ |
|
t***e
发帖数: 27 | 19 According to the link of "Algorithms for Interviews" on Amazon. The authors
have published a new book titled "Elements of Programming Interviews: 300
Questions and Solutions" http://www.amazon.com/dp/1479274836/ref=cm_sw_su_dp. It seems the new one is an improved one for "Algorithms for Interviews". |
|
y***j
发帖数: 11235 | 20 一直做实验，玩玩闹闹的编编程，最多也就几百行的小程序。
以后要去一个纯计算的实验室，感觉自己编程理论基础太差，啥都是一拍脑袋出来的野
路子。想学学最基本的数据结构和算法。那本书值得推荐呢？最好短小精悍一些。
Data Structures and Algorithms Made Easy: Data Structure and Algorithmic
Puzzles, Second Edition
Narasimha Karumanchi
这个怎么样，女野人评价不错。但是是三哥写的会不会全是忽悠? |
|
|
y***j
发帖数: 11235 | 22 一直做实验，玩玩闹闹的编编程，最多也就几百行的小程序。
以后要去一个纯计算的实验室，感觉自己编程理论基础太差，啥都是一拍脑袋出来的野
路子。想学学最基本的数据结构和算法。那本书值得推荐呢？最好短小精悍一些。
Data Structures and Algorithms Made Easy: Data Structure and Algorithmic
Puzzles, Second Edition
Narasimha Karumanchi
这个怎么样，女野人评价不错。但是是三哥写的会不会全是忽悠? |
|
|
w*s
发帖数: 7227 | 24 【 以下文字转载自 DotNet 讨论区 】
发信人: wds (净洗前尘，从头再来), 信区: DotNet
标 题: MS SQL data mining algorithms vs. Matlab data mining algorithms
发信站: BBS 未名空间站 (Sun Jun 9 21:03:02 2013, 美东)
which is better, easier, popular ? |
|
m********t
发帖数: 13072 | 25 听说caiwu一个月就读完了，我感觉有点那个什么。。。
这本书的阅读节奏，其实平均一个chapter一个月，读完要花费至少1年的时光，应该说
需要一年半的时间，才能读完第一遍，因为难度是逐渐增高的，到后面的章节，那都不
是一个月两个月能搞定的了，对大部分读者来说，后面的好几章都是一辈子都不明不白
的。
虽然美国大学的quarter制，是10个星期一轮，但不要忘了，美国的Algorithm课设是阶
梯式递进的难度。 CS101之后还有201，之后还有301，然后还有相关的3XX和401，最后
是501，等等， 所以你实际上耗费在课堂上的听讲时间，累计已经是2年了。
我总共选过4次algorithm课，不同程度的，从本科到硕士到博士，一次比一次难度加大
。最后一次课，从第二堂课开始，同学们就进入沙漠地带了。。。一个个，表情都是一
副深度迷茫状态，当时找工作，人家听说我是偏算法和理论，全都大开绿灯，一路水过
. 面试还没开始的时候，闲聊起我正在做过什么，说了几个term，对方往下就不再问啥
了， LOL
顺便谈谈我个人的读书习惯，是非常非常慢的，这本Bible的第一章，换我，就能读个2
礼拜... 阅读全帖 |
|
c******n
发帖数: 4965 | 26 【 以下文字转载自 JobHunting 讨论区 】
发信人: creation (努力自由泳50m/45sec !), 信区: JobHunting
标 题: question about google algorithm/architecture
发信站: BBS 未名空间站 (Fri Jul 17 12:47:50 2015, 美东)
actually it's more of a question on general search/IR algorithms
http://stackoverflow.com/questions/31469736/in-what-order-are-d
anybody can shed some light on this? |
|
E*********g
发帖数: 185 | 27 码农终于开发出了上吊的绳子
https://arxiv.org/abs/1709.05703
AI Programmer: Autonomously Creating Software Programs Using Genetic
Algorithms
Kory Becker, Justin Gottschlich
(Submitted on 17 Sep 2017)
In this paper, we present the first-of-its-kind machine learning (ML) system
, called AI Programmer, that can automatically generate full software
programs requiring only minimal human guidance. At its core, AI Programmer
uses genetic algorithms (GA) coupled with a tightly constrained programming
language that mi... 阅读全帖 |
|
i********g
发帖数: 41 | 28 同问！
我用的是
\begin{algorithmic}
\begin{algorithm} |
|
k*******s
发帖数: 134 | 29 请问版上有没有大神可以帮帮我的，下面的问题我从stack overflow 直接拷贝过来，
所以是英文的。
I'm newbie in sensor and IMU so my question is probably very basic for
others, but it's already puzzled me for days.
I'm using Mahony's algorithm to calculate Euler angle of my device; the
three angles looks correct when put the device static or move/rotate the
device slowly; however, the Yaw angle will become unstable and incorrect if
rotating the device fast. Could someone help me solve this issue ? My device
uses MPU-9150, I use the 6 para... 阅读全帖 |
|
s*****k
发帖数: 3 | 30 I ever tried two different formulas of Fourier transform. One worked well, but
the other didn't. To know them more clearly, I try to write the code myself.
I don't expect that it will be nice to work on every machine or in any code,
but I hope it works well when I test it.
From www.google.com, it seems not easy to find some useful algorithm except
the private codes. Here somebody can show me the FFT algorithm.
Thanks!
it |
|
g***i
发帖数: 50 | 31 AREA: Algorithms, Theory and Related Areas
Premium:
Algorithmica
Computational Complexity
Discrete & Computational Geometry
IEEE Trans on Information Theory
Information & Computation
Jnl of Algorithms
Jnl of Computer and System Sciences
Jnl of the Association for Computing Machinery
SIAM Jnl on Computing
Mathematics of OR
Leading:
Acta Informatica
Chicago Journal of Theoret |
|
W****u
发帖数: 13 | 32 Got this email from a recruiter. Please contact him directly for details if
you are interested.
Good evening! Currently we are seeking two Video Algorithm Research
Engineers for a Top Notch company in Irvine. Our ideal candidate will have
extensive experience in general video enhancement area, frame rate
conversion area and will have strong video algorithm development experience.
I have posted the description below. If you know of anyone else who may be
interested, please forward this descriptio |
|
L********r
发帖数: 758 | 33 If you are interested, please text me your email address. Thanks
The job focuses on the development of image and signal processing
algorithms. The position requires solid fundamental knowledge in the related
fields of algorithm development, including image segmentation, statistical
data analysis, signal processing, filter theory texture analysis,
classification, feature extraction.
Software skills required include C++, OOD/OOP, MATLAB and/or Python.
Minimum Qualifications
Bachelor with at l... 阅读全帖 |
|
n*****n
发帖数: 100 | 34 【 以下文字转载自 Quant 讨论区 】
发信人: nowoman (纵横江湖), 信区: Quant
标 题: 问一个在network 中Greedy algorithm的问题
发信站: BBS 未名空间站 (Mon Jan 28 16:00:23 2008)
比如任意一个network, 每条link上有两个cost=(a,b).现在我们要找一条路径 which,
minimize the sum of \sum (a_i) under the constaint of \sum (b_i) <= B. 在这
种情况下,如果我们想用greedy algorithm,该如何用呢?谢谢! |
|
|
w****o
发帖数: 2260 | 36 【 以下文字转载自 JobHunting 讨论区 】
发信人: winhao (勇敢的人), 信区: JobHunting
标 题: 谁给说说juggling algorithm里面的gcd
发信站: BBS 未名空间站 (Sun Apr 1 23:18:04 2012, 美东)
数组大小为N, 要shift by k positions
有关的讨论在：
http://www.mitbbs.com/article_t/JobHunting/32080185.html
这个juggling algorithm,其实就是把数组分成了gcd(N, k)个set,在每个set里的数可
以通过k跳，互相到达，所以他们之间就可以交换。
我的问题是，如何从数学上证明这gcd(N, k)个set之间是没有任何的交集？同时这gcd(
N, k)个set的并集正好就是整个数组？
是不是要从 k modulus N方面来着手？
谢谢！ |
|
s**a
发帖数: 178 | 37 The Algorithms Research Team is looking for a junior to mid level quantitative
researcher to work in the firm's NYC office. The Algorithms Research Team
works with traders and software engineers in the development, testing, and
installation of computer based trading systems that successfully execute
sophisticated large-scale strategies independent of human interaction. The
successful candidate will apply his or her considerable mathematical modeling
skills to construct models of market microstru |
|
r*****t
发帖数: 286 | 38 ☆─────────────────────────────────────☆
yunong (yunong) 于 (Thu May 3 02:53:56 2007) 提到:
See this paper in attach. Is it believable? Do IB use algorithm trading in
real business? ANN, SVM,Baysian Network, will they be useful in IB ?
☆─────────────────────────────────────☆
fuzzylogic (fuzzy_logic) 于 (Thu May 3 04:13:15 2007) 提到:
曾经在WSJ上看到过一篇文章，讲大的 Investment Bank 里的 algorithm trading 并
不是非常 profitable。因为赚的不太多，而且 maintenance 的费用也很高。但是我但
是就想，如果不 profitable ,怎么这么多年了，一直还在？而且我想那些最厉害的
algori |
|
B*********h
发帖数: 800 | 39 ☆─────────────────────────────────────☆
purplebasil (紫苏) 于 (Tue Aug 7 15:53:24 2007) 提到:
刚刚接到recruiter电话
有个quant position，algorithm trading方面的
什么是 algorithm trading 呀？那位大虾科普一下？
是做execution呢，还是更象stat arb呢？
有没有前途？
我现在做的是equity derivatives方面，应该去面试还是再等等？
谢谢！
☆─────────────────────────────────────☆
purplebasil (紫苏) 于 (Tue Aug 7 16:04:22 2007) 提到:
补充一下：
不敢随便接面试，是因为听说这家公司很黑
如果给了offer不去，会纪录在案
所以，如果这个方向没有意思，我就不去面试了
☆─────────────────────────────────────☆
purplebasil (紫苏) 于 (Tue Aug 7 17: |
|
h*****u
发帖数: 1 | 40 notice that a_k = b_k * c_k, where
b_k = (k+1)*b_{k+1} and c_k = (k-1)*c_{k-1}, with b_n = 1 and c_1 = 1.
thus the algorithm goes as follows:
(1) a_n <- 1
(2) for k = (n-1) ... 1, a_k <= (k+1)*a_{k+1}
(3) t <- 1
(4) for k = 2 ... n, t <- (k-1)*t then a_k <- t*a_k
in each loop (2) or (4) there are O(n) multiplications/additions, so the total
time complexity is O(n). The temporary variable t is used to make the
algorithm more readable, if temporaries are not allows, we can use a_1 to
replace t a |
|
l****o
发帖数: 2909 | 41 You really have no idea what algorithmic trader is...........they actually write software everyday to do market making. Their software need very good understanding of market microstructure and their algorithms varies from time to time to meet clients' requirements.
by |
|
c********r
发帖数: 1422 | 42 【 以下文字转载自 JobHunting 讨论区 】
发信人: challenger (Ray), 信区: JobHunting
标 题: algorithm optimzation problem
发信站: BBS 未名空间站 (Mon Feb 13 14:38:45 2012, 美东)
given a time series A with Y data points, what is the fastest algorithm to
produce another time series B. Each value in B is the highest value of
series A within specified look back period Z.
Thanks. |
|
l*****y
发帖数: 56 | 43 Not sure if I understand the question correctly. I thought the question asks
for some kind of "moving maximal" for the most recent Z elements.
For example, if a time series has data [1,8,3,7,2], Z=2. Then the lookback
maximals for 2 periods would be 8,8,7,7.
Your algorithm will find the maximal Z elements of the time series.
For the above example, your algorithm will find 8,3, 7,2.
Please correct me if I were wrong.
.
Z |
|
v*******g
发帖数: 334 | 44 问一个有关高频交易或Algorithm 交易的问题
在 High frequency trading desk 或Algorithm trading desk 做
Quant 是不是反而比 Trader 重要。因为 这些 trading desk的交易员只是 monitor
交易，一般不发交易指令，当程式交易不灵的时候，才干涉。
而Quant 才是制定交易程式/指令的人
大家怎么看？ |
|
w********r
发帖数: 253 | 45 could you recommend a good self-learning book for EM algorithm for me?
I will appreciate your help a lot!
I need to understand EM algorithm first, and then my boss will ask me to
write SAS code for this..... |
|
S******y
发帖数: 1123 | 46 Does anybody have a collection of interview
questions on algorithms?
I would like study as many as interview questions on
algorithms, to prepare for some interviews in
software company.
For example -
write code to detect depth of a tree
what is the difference between hash tree and map?
write a pgm to find the shortest distance between
two given words in an article
etc.
... |
|
h**t
发帖数: 1678 | 47 Does anyone know what algorithm for clustering categorical variables? R
packages? Which is the best?
If a data has both numeric and categorical data, what is the best algorithm
to use and R package?
Thank you! |
|
z****e
发帖数: 54598 | 48 这个词汇跟algebra一样
都是波斯巴比伦一带的发明
algorithm是波斯词汇，algebra是巴比伦词汇 |
|
p***r
发帖数: 8071 | 49 现在的情况是：
一般事情的复杂性，已经远非用
routine, framework, scheme, ... strategy, 或sophistic strategy
就能完好地表达清楚或解决。
所以，俺认为用algorithm更合适。 |
|
m**********e
发帖数: 12525 | 50 主要cs这个领域，缺乏高大上的课程来提升屄格
只能考algorithm了 |
|
