9842 search results - page 1302 / 1969 » The Complexity of the Matching-Cut Problem |
195
click to vote
NPIV
1998
ACM
15 years 11 months ago
1998
ACM
We explore techniques from visualization and computational geometry to make tactical information more intuitive to a military commander. To be successful, the commander must quick...
198
click to vote
STOC
1998
ACM
15 years 11 months ago
1998
ACM
Current formal models for quantum computation deal only with unitary gates operating on “pure quantum states”. In these models it is difficult or impossible to deal formally w...
263
click to vote
SPAA
1997
ACM
15 years 11 months ago
1997
ACM
Discovery of association rules is an important database mining problem. Mining for association rules involves extracting patterns from large databases and inferring useful rules f...
182
click to vote
SIGMOD
1996
ACM
15 years 11 months ago
1996
ACM
Scheduling query execution plans is an important component of query optimization in parallel database systems. The problem is particularly complex in a shared-nothing execution en...
224
click to vote
ICS
2010
Tsinghua U.
15 years 11 months ago
2010
Tsinghua U.
: We study the weight distribution and list-decoding size of Reed-Muller codes. Given a weight parameter, we are interested in bounding the number of Reed-Muller codewords with a w...