Sciweavers

3446 search results - page 493 / 690
» A Reasoning Algorithm for pD*
Sort
View
STOC
2005
ACM
130views Algorithms» more  STOC 2005»
16 years 6 months ago
From a static impossibility to an adaptive lower bound: the complexity of early deciding set agreement
Set agreement, where processors decisions constitute a set of outputs, is notoriously harder to analyze than consensus where the decisions are restricted to a single output. This ...
Eli Gafni, Rachid Guerraoui, Bastian Pochon
STOC
2004
ACM
134views Algorithms» more  STOC 2004»
16 years 6 months ago
Better extractors for better codes?
We present an explicit construction of codes that can be list decoded from a fraction (1 - ) of errors in sub-exponential time and which have rate / logO(1) (1/). This comes close...
Venkatesan Guruswami
SIGMOD
2001
ACM
108views Database» more  SIGMOD 2001»
16 years 5 months ago
PREFER: A System for the Efficient Execution of Multi-parametric Ranked Queries
Users often need to optimize the selection of objects by appropriately weighting the importance of multiple object attributes. Such optimization problems appear often in operation...
Vagelis Hristidis, Nick Koudas, Yannis Papakonstan...
DCC
2007
IEEE
16 years 5 months ago
On Compression of Encrypted Video
We consider video sequences that have been encrypted uncompressed. Since encryption masks the source, traditional data compression algorithms are rendered ineffective. However, it...
Daniel Schonberg, Chuohao Yeo, Stark C. Draper, Ka...
SODA
2010
ACM
146views Algorithms» more  SODA 2010»
16 years 3 months ago
Classified Stable Matching
We introduce the classified stable matching problem, a problem motivated by academic hiring. Suppose that a number of institutes are hiring faculty members from a pool of applican...
Chien-Chung Huang