Sciweavers

1493 search results - page 181 / 299
» Local resilience of graphs
Sort
View
CIKM
2011
Springer
12 years 8 months ago
Semi-supervised multi-task learning of structured prediction models for web information extraction
Extracting information from web pages is an important problem; it has several applications such as providing improved search results and construction of databases to serve user qu...
Paramveer S. Dhillon, Sundararajan Sellamanickam, ...
WWW
2009
ACM
14 years 8 months ago
Anycast-aware transport for content delivery networks
Anycast-based content delivery networks (CDNs) have many properties that make them ideal for the large scale distribution of content on the Internet. However, because routing chan...
Zakaria Al-Qudah, Seungjoon Lee, Michael Rabinovic...
STOC
2007
ACM
111views Algorithms» more  STOC 2007»
14 years 8 months ago
Low-end uniform hardness vs. randomness tradeoffs for AM
In 1998, Impagliazzo and Wigderson [IW98] proved a hardness vs. randomness tradeoff for BPP in the uniform setting, which was subsequently extended to give optimal tradeoffs for t...
Ronen Shaltiel, Christopher Umans
VLDB
2008
ACM
127views Database» more  VLDB 2008»
14 years 8 months ago
Delay aware querying with Seaweed
Large highly distributed data sets are poorly supported by current query technologies. Applications such as endsystembased network management are characterized by data stored on l...
Dushyanth Narayanan, Austin Donnelly, Richard Mort...
STACS
2010
Springer
14 years 3 months ago
Efficient and Error-Correcting Data Structures for Membership and Polynomial Evaluation
We construct efficient data structures that are resilient against a constant fraction of adversarial noise. Our model requires that the decoder answers most queries correctly with...
Victor Chen, Elena Grigorescu, Ronald de Wolf