4843 search results - page 797 / 969 » The Shortcut Problem - Complexity and Approximation |
135
click to vote
KDD
2005
ACM
16 years 3 months ago
2005
ACM
The problem of finding frequent patterns from graph-based datasets is an important one that finds applications in drug discovery, protein structure analysis, XML querying, and soc...
130
Voted
KDD
2004
ACM
16 years 3 months ago
2004
ACM
In many applications that track and analyze spatiotemporal data, movements obey periodic patterns; the objects follow the same routes (approximately) over regular time intervals. ...
144
Voted
KDD
2003
ACM
16 years 3 months ago
2003
ACM
The problem of identifying approximately duplicate records in databases is an essential step for data cleaning and data integration processes. Most existing approaches have relied...
118
click to vote
STOC
2005
ACM
16 years 3 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)...
131
click to vote
OSDI
2008
ACM
16 years 3 months ago
2008
ACM
Although queueing models have long been used to model the performance of computer systems, they are out of favor with practitioners, because they have a reputation for requiring u...