2714 search results - page 422 / 543 » Approximation Schemes for Scheduling |
96
Voted
PODS
2003
ACM
16 years 26 days ago
2003
ACM
In recent years, the problem of indexing mobile objects has assumed great importance because of its relevance to a wide variety of applications. Most previous results in this area...
97
Voted
KDD
2009
ACM
15 years 7 months ago
2009
ACM
In this paper, we consider a novel scheme referred to as Cartesian contour to concisely represent the collection of frequent itemsets. Different from the existing works, this sche...
101
Voted
CIKM
2009
Springer
15 years 7 months ago
2009
Springer
We consider the problem of releasing a limited public view of a sensitive graph which reveals at least k edges per node. We are motivated by Facebook’s public search listings, w...
106
click to vote
SPIN
2009
Springer
15 years 7 months ago
2009
Springer
Existing techniques for approximate storage of visited states in a model checker are too special-purpose and too DRAM-intensive. Bitstate hashing, based on Bloom filters, is good ...
93
Voted
CEC
2008
IEEE
15 years 7 months ago
2008
IEEE
—This paper reviews the different gradient-based schemes and the sources of gradient, their availability, precision and computational complexity, and explores the benefits of usi...