16093 search results - page 2979 / 3219 » On the optimality of the neighbor-joining algorithm |
168
click to vote
KDD
1997
ACM
15 years 10 months ago
1997
ACM
Exploratory data analysis is inherently an iterative, interactive endeavor. In the context of massive data sets, however, many current data analysis algorithms will not scale appr...
281
click to vote
FOCS
1993
IEEE
15 years 10 months ago
1993
IEEE
We resolve in the a rmative a question of Boppana and Bui: whether simulated annealing can, with high probability and in polynomial time, nd the optimal bisection of a random grap...
163
click to vote
SC
1993
ACM
15 years 10 months ago
1993
ACM
This paper documents the use of a massively parallel computer, specifically the Connection Machine CM-5, to solve the Boltzmann equation to model one-dimensional shock wave struct...
198
click to vote
ACCV
2007
Springer
15 years 10 months ago
2007
Springer
Normalized Cuts has successfully been applied to a wide range of tasks in computer vision, it is indisputably one of the most popular segmentation algorithms in use today. A number...
190
click to vote
ACMICEC
2007
ACM
15 years 10 months ago
2007
ACM
An important problem in search engine advertising is keyword1 generation. In the past, advertisers have preferred to bid for keywords that tend to have high search volumes and hen...