3875 search results - page 693 / 775 » Approximation algorithms for the 0-extension problem |
100
click to vote
ICML
2008
IEEE
15 years 10 months ago
2008
IEEE
In this paper we investigate two aspects of ranking problems on large graphs. First, we augment the deterministic pruning algorithm in Sarkar and Moore (2007) with sampling techni...
WWW
2005
ACM
15 years 10 months ago
2005
ACM
We consider the problem of finding duplicates in data streams. Duplicate detection in data streams is utilized in various applications including fraud detection. We develop a solu...
CAV
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. When a model does not satisfy a given specification, a counterexample is produced by the model checker to demonstrate the failure. A user must then examine the counterexa...
STOC
2005
ACM
15 years 10 months ago
2005
ACM
We present a variant of the Ajtai-Dwork public-key cryptosystem where the size of the public-key is only O(n log n) bits and the encrypted text/clear text ratio is also O(n log n)...
SIGMOD
2003
ACM
15 years 10 months ago
2003
ACM
While work in recent years has demonstrated that wavelets can be efficiently used to compress large quantities of data and provide fast and fairly accurate answers to queries, lit...