Sciweavers

516 search results - page 90 / 104
» Sets of k-Independent Strings
Sort
View
STOC
2005
ACM
147views Algorithms» more  STOC 2005»
14 years 9 months ago
Simulating independence: new constructions of condensers, ramsey graphs, dispersers, and extractors
We present new explicit constructions of deterministic randomness extractors, dispersers and related objects. We say that a distribution X on binary strings of length n is a -sour...
Boaz Barak, Guy Kindler, Ronen Shaltiel, Benny Sud...
VLDB
2007
ACM
118views Database» more  VLDB 2007»
14 years 8 months ago
Inferring XML Schema Definitions from XML Data
Although the presence of a schema enables many optimizations for operations on XML documents, recent studies have shown that many XML documents in practice either do not refer to ...
Geert Jan Bex, Frank Neven, Stijn Vansummeren
WSDM
2010
ACM
204views Data Mining» more  WSDM 2010»
14 years 3 months ago
Learning URL patterns for webpage de-duplication
Presence of duplicate documents in the World Wide Web adversely affects crawling, indexing and relevance, which are the core building blocks of web search. In this paper, we pres...
Hema Swetha Koppula, Krishna P. Leela, Amit Agarwa...
CPM
2000
Springer
177views Combinatorics» more  CPM 2000»
14 years 1 months ago
Identifying and Filtering Near-Duplicate Documents
Abstract. The mathematical concept of document resemblance captures well the informal notion of syntactic similarity. The resemblance can be estimated using a fixed size “sketch...
Andrei Z. Broder
PODC
2010
ACM
14 years 16 days ago
Hybrid-secure MPC: trading information-theoretic robustness for computational privacy
Most protocols for distributed, fault-tolerant computation, or multi-party computation (MPC), provide security guarantees in an all-or-nothing fashion: If the number of corrupted p...
Christoph Lucas, Dominik Raub, Ueli M. Maurer