Sciweavers

1538 search results - page 97 / 308
» Relative Randomness and Cardinality
Sort
View
ESA
2004
Springer
129views Algorithms» more  ESA 2004»
15 years 3 months ago
Contraction and Treewidth Lower Bounds
Edge contraction is shown to be a useful mechanism to improve lower bound heuristics for treewidth. A successful lower bound for treewidth is the degeneracy: the maximum over all ...
Hans L. Bodlaender, Arie M. C. A. Koster, Thomas W...
SIGMETRICS
2010
ACM
213views Hardware» more  SIGMETRICS 2010»
15 years 2 months ago
Small subset queries and bloom filters using ternary associative memories, with applications
Associative memories offer high levels of parallelism in matching a query against stored entries. We design and analyze an architecture which uses a single lookup into a Ternary C...
Ashish Goel, Pankaj Gupta
INFOCOM
1998
IEEE
15 years 2 months ago
Informed-Source Coding-on-Demand (ISCOD) over Broadcast Channels
We present the Informed-Source Coding-On-Demand (ISCOD) approach for efficiently supplying non-identical data from a central server to multiple caching clients through a broadcast ...
Yitzhak Birk, Tomer Kol
AAAI
1996
14 years 11 months ago
Lazy Arc Consistency
Arc consistency filtering is widely used in the framework of binary constraint satisfaction problems: with a low complexity, inconsistency may be detected,and domains are filtered...
Thomas Schiex, Jean-Charles Régin, Christin...
MST
2010
187views more  MST 2010»
14 years 4 months ago
Distributed Approximation of Capacitated Dominating Sets
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...
Fabian Kuhn, Thomas Moscibroda