2168 search results - page 172 / 434 » Randomized Algorithms and Complexity Theory |
140
click to vote
WABI
2005
Springer
15 years 9 months ago
2005
Springer
Motifs in a network are small connected subnetworks that occur in significantly higher frequencies than in random networks. They have recently gathered much attention as a useful ...
127
Voted
FLAIRS
2004
15 years 4 months ago
2004
In the recent years, CSP's have come to be seen as the core problem in many applications. We propose here a hybrid algorithm (MC-FC) that combines two different search method...
114
click to vote
ALGORITHMICA
2002
15 years 3 months ago
2002
We consider the following one- and two-dimensional bucketing problems: Given a set S of n points in R1 or R2 and a positive integer b, distribute the points of S into b equal-size ...
140
Voted
SODA
2012
ACM
13 years 6 months ago
2012
ACM
We give a deterministic O(log n)n -time and space algorithm for the Shortest Vector Problem (SVP) of a lattice under any norm, improving on the previous best deterministic nO(n) -...
237
Voted
SIGMOD
2005
ACM
16 years 3 months ago
2005
ACM
Complex queries over high speed data streams often need to rely on approximations to keep up with their input. The research community has developed a rich literature on approximat...