994 search results - page 118 / 199 » Custom Computing Machines for the Set Covering Problem |
111
Voted
VLSID
2005
IEEE
15 years 6 months ago
2005
IEEE
During pseudorandom testing, a significant amount of energy and test application time is wasted for generating and for applying “useless” test vectors that do not contribute t...
96
Voted
EOR
2006
15 years 17 days ago
2006
This paper presents a new multi-depot combined vehicle and crew scheduling algorithm, and uses it, in conjunction with a heuristic vehicle routing algorithm, to solve the intra-ci...
110
Voted
ICPR
2008
IEEE
15 years 7 months ago
2008
IEEE
With the increase of the training set’s size, the efficiency of support vector machine (SVM) classifier will be confined. To solve such a problem, a novel preextracting method f...
112
click to vote
FOCS
2004
IEEE
15 years 4 months ago
2004
IEEE
We show that finding small solutions to random modular linear equations is at least as hard as approximating several lattice problems in the worst case within a factor almost line...
103
Voted
CVPR
2010
IEEE
15 years 8 months ago
2010
IEEE
Online boosting is one of the most successful online learning algorithms in computer vision. While many challenging online learning problems are inherently multi-class, online boo...