780 search results - page 19 / 156 » Cost-Sharing Approximations for h |
IAAI
2003
13 years 8 months ago
2003
Pattern matching for intelligence organizations is a challenging problem. The data sets are large and noisy, and there is a flexible and constantly changing notion of what consti...
DCC
2011
IEEE
13 years 2 months ago
2011
IEEE
In this paper, we use linear approximations of the addition modulo 2n of three n-bit integers to identify linear approximations of g1, g2, the feedback functions of HC-128. This, i...
COMPGEOM
2009
ACM
14 years 1 months ago
2009
ACM
Given a set system (X, R), the hitting set problem is to find a smallest-cardinality subset H ⊆ X, with the property that each range R ∈ R has a non-empty intersection with H...
SIGMOD
2007
ACM
14 years 7 months ago
2007
ACM
In this demonstration, we present a prototype content-based dissemination broker, called Sonnet, which is built upon structured overlay network. It combines approximate filtering ...
COMPGEOM
2010
ACM
14 years 12 days ago
2010
ACM
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...