876 search results - page 123 / 176 » New Results for the Martin Polynomial |
175
click to vote
STOC
2009
ACM
16 years 6 months ago
2009
ACM
We design the first efficient algorithms and prove new combinatorial bounds for list decoding tensor products of codes and interleaved codes. ? We show that for every code, the rat...
182
click to vote
SODA
2010
ACM
16 years 3 months ago
2010
ACM
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...
179
click to vote
CSFW
2007
IEEE
16 years 16 days ago
2007
IEEE
Signature-based tools such as network intrusion detection systems are widely used to protect critical systems. Automatic signature generation techniques are needed to enable these...
145
click to vote
VLDB
1998
ACM
15 years 10 months ago
1998
ACM
The problem of finding an optimal bipartition of a rectangle set has a direct impact on query performance of dynamic R-trees. During update operations, overflowed nodes need to be...
162
click to vote
BMCBI
2007
15 years 6 months ago
2007
Background: Identity by descent (IBD) matrix estimation is a central component in mapping of Quantitative Trait Loci (QTL) using variance component models. A large number of algor...