Sciweavers

247 search results - page 20 / 50
» Extracting All the Randomness from a Weakly Random Source
Sort
View
LISA
2000
13 years 9 months ago
Tracing Anonymous Packets to Their Approximate Source
Most denial-of-service attacks are characterized by a flood of packets with random, apparently valid source addresses. These addresses are spoofed, created by a malicious program ...
Hal Burch, Bill Cheswick
COMAD
2009
13 years 8 months ago
Querying for relations from the semi-structured Web
We present a class of web queries whose result is a multi-column relation instead of a collection of unstructured documents as in standard web search. The user specifies the query...
Sunita Sarawagi
APPROX
2010
Springer
213views Algorithms» more  APPROX 2010»
13 years 9 months ago
Constructive Proofs of Concentration Bounds
We give a simple combinatorial proof of the Chernoff-Hoeffding concentration bound [Che52, Hoe63], which says that the sum of independent {0, 1}-valued random variables is highly ...
Russell Impagliazzo, Valentine Kabanets
KDD
2006
ACM
162views Data Mining» more  KDD 2006»
14 years 8 months ago
Simultaneous record detection and attribute labeling in web data extraction
Recent work has shown the feasibility and promise of templateindependent Web data extraction. However, existing approaches use decoupled strategies ? attempting to do data record ...
Jun Zhu, Zaiqing Nie, Ji-Rong Wen, Bo Zhang, Wei-Y...
PVLDB
2010
112views more  PVLDB 2010»
13 years 6 months ago
Querying Probabilistic Information Extraction
Recently, there has been increasing interest in extending relational query processing to include data obtained from unstructured sources. A common approach is to use stand-alone I...
Daisy Zhe Wang, Michael J. Franklin, Minos N. Garo...