2168 search results - page 72 / 434 » Randomized Algorithms and Complexity Theory |
107
click to vote
COCO
2005
Springer
15 years 8 months ago
2005
Springer
It is well known that the hardest bit of integer multiplication is the middle bit, i.e. MULn−1,n. This paper contains several new results on its complexity. First, the size s of...
159
click to vote
ICIP
2003
IEEE
16 years 4 months ago
2003
IEEE
Curvature flows have been extensively considered from a deterministic point of view. They have been shown to be useful for a number of applications including crystal growth, flame...
145
click to vote
KDD
2007
ACM
16 years 3 months ago
2007
ACM
In this paper, we design recommender systems for weblogs based on the link structure among them. We propose algorithms based on refined random walks and spectral methods. First, w...
110
click to vote
SODA
2010
ACM
16 years 12 days ago
2010
ACM
We study the dynamic membership problem, one of the most fundamental data structure problems, in the cell probe model with an arbitrary cell size. We consider a cell probe model e...
154
click to vote
FOCS
1998
IEEE
15 years 7 months ago
1998
IEEE
We examine the number T of queries that a quantum network requires to compute several Boolean functions on f0;1gN in the black-box model. We show that, in the blackbox model, the ...