324 search results - page 46 / 65 » Distance Approximating Trees: Complexity and Algorithms |
TIP
2008
13 years 7 months ago
2008
In this paper, a novel method for reducing the runtime complexity of a support vector machine classifier is presented. The new training algorithm is fast and simple. This is achiev...
PPOPP
2011
ACM
12 years 10 months ago
2011
ACM
The sparse grid discretization technique enables a compressed representation of higher-dimensional functions. In its original form, it relies heavily on recursion and complex data...
NIPS
2007
13 years 8 months ago
2007
We present a novel message passing algorithm for approximating the MAP problem in graphical models. The algorithm is similar in structure to max-product but unlike max-product it ...
ICB
2009
Springer
14 years 1 months ago
2009
Springer
We propose a scalable face matching algorithm capable of dealing with faces subject to several concurrent and uncontrolled factors, such as variations in pose, expression, illumina...
DAC
2007
ACM
14 years 8 months ago
2007
ACM
tive Guidance Strategy for Abstraction-Guided Simulation Flavio M. De Paula Alan J. Hu Department of Computer Science, University of British Columbia, {depaulfm, ajh}@cs.ubc.ca D...