5580 search results - page 604 / 1116 » Randomized priority algorithms |
137
click to vote
COLT
2010
Springer
15 years 3 months ago
2010
Springer
One of the most widely used techniques for data clustering is agglomerative clustering. Such algorithms have been long used across many different fields ranging from computational...
171
click to vote
CORR
2010
Springer
14 years 12 months ago
2010
Springer
This paper extends the analogies employed in the development of quantum-inspired evolutionary algorithms by proposing quantum-inspired Hadamard walks, called QHW. A novel quantum-...
218
click to vote
PODC
2011
ACM
14 years 7 months ago
2011
ACM
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
162
click to vote
FOCS
2008
IEEE
15 years 11 months ago
2008
IEEE
Learning problems form an important category of computational tasks that generalizes many of the computations researchers apply to large real-life data sets. We ask: what concept ...
155
Voted
SODA
2008
ACM
15 years 6 months ago
2008
ACM
A common approach for dealing with large data sets is to stream over the input in one pass, and perform computations using sublinear resources. For truly massive data sets, howeve...