2168 search results - page 323 / 434 » Randomized Algorithms and Complexity Theory |
146
click to vote
FOCS
1995
IEEE
15 years 6 months ago
1995
IEEE
This paper continues the investigation of the connection between probabilistically checkable proofs PCPs the approximability of NP-optimization problems. The emphasis is on prov...
138
click to vote
WWW
2005
ACM
16 years 3 months ago
2005
ACM
We consider the problem of efficiently sampling Web search engine query results. In turn, using a small random sample instead of the full set of results leads to efficient approxi...
MOC
1998
15 years 2 months ago
1998
We use the algorithmic computation of exact sequences of Abelian groups to compute the complete structure of (ZK /m)∗ for an ideal m of a number field K, as well as ray class gr...
128
Voted
FOCS
2008
IEEE
15 years 9 months ago
2008
IEEE
This work investigates a geometric approach to proving cell probe lower bounds for data structure problems. We consider the approximate nearest neighbor search problem on the Bool...
139
Voted
DASFAA
2007
IEEE
15 years 9 months ago
2007
IEEE
Twig pattern matching problem has been widely studied in recent years. Give an XML tree T . A twig-pattern matching query, Q, represented as a query tree, is to find all the occur...