1096 search results - page 39 / 220 » A New Approach for Speeding Up Enumeration Algorithms |
AMAI
2004
Springer
15 years 3 months ago
2004
Springer
We study three new techniques which will speed up the branch-and-bound algorithm for the MAX-2-SAT problem: The first technique is a new lower bound function for the algorithm an...
ICPR
2010
IEEE
14 years 10 months ago
2010
IEEE
Abstract—Nearest Neighbour search is a widely used technique in Pattern Recognition. In order to speed up the search many indexing techniques have been proposed. However, most of...
IR
2010
14 years 7 months ago
2010
RankSVM (Herbrich et al, 2000; Joachims, 2002) is a pairwise method for designing ranking models. SVMLight is the only publicly available software for RankSVM. It is slow and, due ...
PODC
2004
ACM
15 years 3 months ago
2004
ACM
We establish a new worst-case upper bound on the Membership problem: We present a simple algorithm that is able to always achieve Agreement on Views within a single message latenc...
CC
1999
Springer
15 years 2 months ago
1999
Springer
Tomita devised a method of generalized LR GLR parsing to parse ambiguous grammars e ciently. A GLR parser uses linear-time LR parsing techniques as long as possible, falling back...