14548 search results - page 2776 / 2910 » The Optimal Path-Matching Problem |
145
click to vote
STOC
2006
ACM
16 years 2 months ago
2006
ACM
The PCP theorem [3, 2] says that every language in NP has a witness format that can be checked probabilistically by reading only a constant number of bits from the proof. The cele...
143
Voted
STOC
2004
ACM
16 years 2 months ago
2004
ACM
A collaborative filtering system at an e-commerce site or similar service uses data about aggregate user behavior to make recommendations tailored to specific user interests. We d...
133
Voted
STOC
2003
ACM
16 years 2 months ago
2003
ACM
The problem of cooperatively performing a set of t tasks in a decentralized setting where the computing medium is subject to failures is one of the fundamental problems in distrib...
121
Voted
STOC
2002
ACM
16 years 2 months ago
2002
ACM
A randomized algorithm is given that solves the wait-free consensus problem for a shared-memory model with infinitely many processes. The algorithm is based on a weak shared coin ...
205
Voted
SIGMOD
2006
ACM
16 years 2 months ago
2006
ACM
Recent data stream systems such as TelegraphCQ have employed the well-known property of duality between data and queries. In these systems, query processing methods are classified...