2168 search results - page 78 / 434 » Randomized Algorithms and Complexity Theory |
156
click to vote
TVCG
2011
14 years 10 months ago
2011
—This paper considers the problem of interactively finding the cutting contour to extract components from an existing mesh. First, we propose a constrained random walks algorith...
114
click to vote
ATAL
2008
Springer
15 years 5 months ago
2008
Springer
Recent work by Procaccia, Rosenschein and Zohar [14] established some results regarding the complexity of manipulation and control in elections with multiple winners, such as elec...
103
click to vote
KDD
2006
ACM
16 years 3 months ago
2006
ACM
There has been considerable interest in random projections, an approximate algorithm for estimating distances between pairs of points in a high-dimensional vector space. Let A Rn...
155
click to vote
ACST
2006
15 years 4 months ago
2006
Consider the problem of membership query for a given partially ordered set. We devise a greedy algorithm which can produce near-optimal search strategies. Rigorous analysis has be...
116
click to vote
CIKM
2009
Springer
15 years 9 months ago
2009
Springer
Plenty of algorithms for link prediction have been proposed and were applied to various real networks. Among these works, the weights of links are rarely taken into account. In th...