4110 search results - page 104 / 822 » Efficient algorithms for the 2-gathering problem |
132
click to vote
CVPR
2007
IEEE
16 years 6 months ago
2007
IEEE
One of the hard problems in automated sign language recognition is the movement epenthesis (me) problem. Movement epenthesis is the gesture movement that bridges two consecutive s...
188
Voted
STOC
1998
ACM
15 years 8 months ago
1998
ACM
We address the problem of designing data structures that allow efficient search for approximate nearest neighbors. More specifically, given a database consisting of a set of vecto...
129
click to vote
TPDS
2008
15 years 4 months ago
2008
In this paper, we consider the issue of constructing an energy-efficient virtual network backbone in mobile ad hoc networks (MANETs) for broadcasting applications using directiona...
138
click to vote
NECO
2008
15 years 4 months ago
2008
We describe a fast Sequential Minimal Optimization (SMO) procedure for solving the dual optimization problem of the recently proposed Potential Support Vector Machine (P-SVM). The...
113
click to vote
JPDC
2006
15 years 4 months ago
2006
We present provably efficient parallel algorithms for sweep scheduling, which is a commonly used technique in Radiation Transport problems, and involves inverting an operator by i...