9842 search results - page 1789 / 1969 » Problem complexity |
NOMS
1998
IEEE
15 years 5 months ago
1998
IEEE
In this paper, we present a framework for managing ATM customer networks using WWW and CORBA technologies. The WWW technology may provide network management operators with platfor...
101
click to vote
STOC
1998
ACM
15 years 5 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...
146
click to vote
SPAA
1997
ACM
15 years 5 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...
122
click to vote
ICS
2010
Tsinghua U.
15 years 5 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...
145
Voted
COLT
1993
Springer
15 years 5 months ago
1993
Springer
The Vapnik-Chervonenkis (V-C) dimension is an important combinatorial tool in the analysis of learning problems in the PAC framework. For polynomial learnability, we seek upper bou...