5506 search results - page 739 / 1102 » Minimal Logic Programs |
189
click to vote
SODA
2004
ACM
15 years 8 months ago
2004
ACM
We design polynomial time approximation schemes (PTASs) for Metric BISECTION, i.e. dividing a given finite metric space into two halves so as to minimize or maximize the sum of di...
150
click to vote
AAAI
1997
15 years 8 months ago
1997
We consider the problem of query plan optimization in information brokers. Information brokers are programs that facilitate access to collections of information sources by hiding ...
169
click to vote
NIPS
1998
15 years 8 months ago
1998
Training a Support Vector Machine (SVM) requires the solution of a very large quadratic programming (QP) problem. This paper proposes an algorithm for training SVMs: Sequential Mi...
150
click to vote
COMBINATORICS
2002
15 years 6 months ago
2002
An efficient and purely combinatorial algorithm for calculating products in arbitrary Coxeter groups is presented, which combines ideas of Fokko du Cloux and myself. Proofs are lar...
150
click to vote
TIT
2002
15 years 6 months ago
2002
An elementary proof of a basic uncertainty principle concerning pairs of representations of vectors in different orthonormal bases is provided. The result, slightly stronger than s...