100 search results - page 9 / 20 » Faster exponential time algorithms for the shortest vector p... |
146
click to vote
KDD
2002
ACM
16 years 4 months ago
2002
ACM
Support vector machines (SVMs) excel at two-class discriminative learning problems. They often outperform generative classifiers, especially those that use inaccurate generative m...
127
click to vote
ICASSP
2008
IEEE
15 years 10 months ago
2008
IEEE
The maximization of a full-rank quadratic form over a finite alphabet is NP-hard in both a worst-case sense and an average sense. Interestingly, if the rank of the form is not a ...
128
click to vote
ICCSA
2010
Springer
15 years 11 months ago
2010
Springer
String matching with mismatches is a basic concept of information retrieval with some kinds of approximation. This paper proposes an FFT-based algorithm for the problem of string ...
126
click to vote
MFCS
2007
Springer
15 years 10 months ago
2007
Springer
The notion of distance constrained graph labelings, motivated by the Frequency Assignment Problem, reads as follows: A mapping from the vertex set of a graph G = (V, E) into an in...
151
click to vote
SPIRE
2000
Springer
15 years 7 months ago
2000
Springer
We consider a fully compressed pattern matching problem, where both text T and pattern P are given by its succinct representation, in terms of straight-line programs and its varia...