12257 search results - page 167 / 2452 » Analysis of Algorithms |
227
click to vote
SIGMOD
2011
ACM
14 years 10 months ago
2011
ACM
We study the problem of computing approximate quantiles in large-scale sensor networks communication-efficiently, a problem previously studied by Greenwald and Khana [12] and Shri...
202
click to vote
ICA
2007
Springer
16 years 1 months ago
2007
Springer
We present a robust algorithm for independent component analysis that uses the sum of marginal quadratic negentropies as a dependence measure. It can handle arbitrary source densit...
174
click to vote
IBPRIA
2003
Springer
16 years 14 days ago
2003
Springer
A straightforward and efficient way to discover clustering tendencies in data using a recently proposed Maximum Variance Clustering algorithm is proposed. The approach shares the ...
197
click to vote
COMPGEOM
2005
ACM
15 years 9 months ago
2005
ACM
We initiate the study of exact geometric algorithms that require limited storage and make only a small number of passes over the input. Fundamental problems such as lowdimensional...
187
click to vote
JACM
2000
15 years 7 months ago
2000
A deterministic algorithm for computing a minimum spanning tree of a connected graph is presented. Its running time is O(m (m, n)), where is the classical functional inverse of Ack...