Sciweavers

7988 search results - page 1498 / 1598
» A Useful Undecidable Theory
Sort
View
129
Voted
STOC
2006
ACM
108views Algorithms» more  STOC 2006»
16 years 3 months ago
Extractors for a constant number of polynomially small min-entropy independent sources
We consider the problem of randomness extraction from independent sources. We construct an extractor that can extract from a constant number of independent sources of length n, ea...
Anup Rao
STOC
2005
ACM
150views Algorithms» more  STOC 2005»
16 years 3 months ago
Correcting errors without leaking partial information
This paper explores what kinds of information two parties must communicate in order to correct errors which occur in a shared secret string W. Any bits they communicate must leak ...
Yevgeniy Dodis, Adam Smith
STOC
2002
ACM
156views Algorithms» more  STOC 2002»
16 years 3 months ago
Selfish traffic allocation for server farms
We investigate the price of selfish routing in non-cooperative networks in terms of the coordination and bicriteria ratios in the recently introduced game theoretic network model ...
Artur Czumaj, Piotr Krysta, Berthold Vöcking
ICALP
2009
Springer
16 years 3 months ago
Approximation Algorithms via Structural Results for Apex-Minor-Free Graphs
We develop new structural results for apex-minor-free graphs and show their power by developing two new approximation algorithms. The first is an additive approximation for colorin...
Erik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ich...
228
Voted
SIGMOD
2009
ACM
132views Database» more  SIGMOD 2009»
16 years 3 months ago
Core schema mappings
Research has investigated mappings among data sources under two perspectives. On one side, there are studies of practical tools for schema mapping generation; these focus on algor...
Giansalvatore Mecca, Paolo Papotti, Salvatore Raun...
« Prev « First page 1498 / 1598 Last » Next »