336 search results - page 50 / 68 » Consultant-guided search algorithms for the quadratic assign... |
STOC
2006
ACM
14 years 9 months ago
2006
ACM
Range searching is among the most fundamental problems in computational geometry. An n-element point set in Rd is given along with an assignment of weights to these points from so...
NIPS
2003
13 years 10 months ago
2003
In typical classification tasks, we seek a function which assigns a label to a single object. Kernel-based approaches, such as support vector machines (SVMs), which maximize the ...
ECML
2007
Springer
13 years 10 months ago
2007
Springer
Many problems in areas such as Natural Language Processing, Information Retrieval, or Bioinformatic involve the generic task of sequence labeling. In many cases, the aim is to assi...
AI
2006
Springer
13 years 8 months ago
2006
Springer
Finite-domain constraint programming has been used with great success to tackle a wide variety of combinatorial problems in industry and academia. To apply finite-domain constrain...
STACS
1992
Springer
14 years 25 days ago
1992
Springer
We show how to speed up two string-matching algorithms: the Boyer-Moore algorithm (BM algorithm), and its version called here the reverse factor algorithm (RF algorithm). The RF al...