1538 search results - page 97 / 308 » Relative Randomness and Cardinality |
127
click to vote
ESA
2004
Springer
15 years 8 months ago
2004
Springer
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 ...
126
click to vote
SIGMETRICS
2010
ACM
15 years 8 months ago
2010
ACM
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...
180
click to vote
INFOCOM
1998
IEEE
15 years 7 months ago
1998
IEEE
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 ...
140
click to vote
AAAI
1996
15 years 4 months ago
1996
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...
165
click to vote
MST
2010
14 years 10 months ago
2010
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...