6192 search results - page 1092 / 1239 » Structure benefits all |
209
click to vote
STOC
2006
ACM
16 years 7 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...
198
click to vote
STOC
2006
ACM
16 years 7 months ago
2006
ACM
We study rerouting policies in a dynamic round-based variant of a well known game theoretic traffic model due to Wardrop. Previous analyses (mostly in the context of selfish routi...
275
Voted
VLDB
2003
ACM
16 years 7 months ago
2003
ACM
On the Semantic Web, data will inevitably come from many different ontologies, and information processing across ontologies is not possible without knowing the semantic mappings be...
312
Voted
SIGMOD
2009
ACM
16 years 7 months ago
2009
ACM
We consider the problem of collectively approximating a set of sensor signals using the least amount of space so that any individual signal can be efficiently reconstructed within...
325
click to vote
SIGMOD
2009
ACM
16 years 7 months ago
2009
ACM
Nearest neighbor (NN) search in high dimensional space is an important problem in many applications. Ideally, a practical solution (i) should be implementable in a relational data...