2095 search results - page 189 / 419 » Improved pebbling bounds |
207
click to vote
CP
2005
Springer
16 years 24 days ago
2005
Springer
In this paper we show how Constraint Programming (CP) techniques can improve the efficiency and applicability of grid-based algorithms for optimising surface contact between comple...
163
click to vote
SIGMETRICS
2003
ACM
16 years 16 days ago
2003
ACM
We introduce PRM (Probabilistic Resilient Multicast): a multicast data recovery scheme that improves data delivery ratios while maintaining low end-to-end latencies. PRM has both ...
194
click to vote
ICDE
2010
IEEE
15 years 11 months ago
2010
IEEE
-- Publishing person specific data while protecting privacy is an important problem. Existing algorithms that enforce the privacy principle called l-diversity are heuristic based d...
196
click to vote
FOCS
1999
IEEE
15 years 11 months ago
1999
IEEE
This paper connects two fundamental ideas from theoretical computer science: hard-core set construction, a type of hardness amplification from computational complexity, and boosti...
204
click to vote
ECRTS
1998
IEEE
15 years 11 months ago
1998
IEEE
This paper introduces improvements in partitioning schemes for multiprocessor real-time systems which allow higher processor utilization and enhanced schedulability by using exact...