5580 search results - page 895 / 1116 » Randomized priority algorithms |
134
click to vote
INFOCOM
2009
IEEE
15 years 9 months ago
2009
IEEE
—In this paper, we study an online bipartite matching problem, motivated by applications in wireless communication, content delivery, and job scheduling. In our problem, we have ...
105
click to vote
WWW
2005
ACM
16 years 3 months ago
2005
ACM
To exploit the similarity information hidden in the hyperlink structure of the web, this paper introduces algorithms scalable to graphs with billions of vertices on a distributed ...
162
click to vote
KDD
2003
ACM
16 years 2 months ago
2003
ACM
In today's industry, the design of software tests is mostly based on the testers' expertise, while test automation tools are limited to execution of pre-planned tests on...
129
click to vote
STOC
2003
ACM
16 years 2 months ago
2003
ACM
The design of new quantum algorithms has proven to be an extremely difficult task. This paper considers a different approach to the problem, by studying the problem of 'quant...
119
Voted
ICPR
2008
IEEE
15 years 8 months ago
2008
IEEE
If there are more clusters than the ideal, each intrinsic cluster will be split into several subsets. Theoretically, this split can be arbitrary and neighboring data points have a ...