1554 search results - page 222 / 311 » Parameterized Complexity and Approximation Algorithms |
128
Voted
ECCV
2008
Springer
16 years 4 months ago
2008
Springer
We present a new Gaussian Process inference algorithm, called Online Sparse Matrix Gaussian Processes (OSMGP), and demonstrate its merits with a few vision applications. The OSMGP ...
140
Voted
CEC
2008
IEEE
15 years 9 months ago
2008
IEEE
—Ant Colony Optimization (ACO) algorithm is a novel meta-heuristic algorithm for the approximate solution of combinatorial optimization problems that has been inspired by the for...
126
Voted
INFOCOM
2007
IEEE
15 years 9 months ago
2007
IEEE
— High-speed backbones are regularly affected by various kinds of network anomalies, ranging from malicious attacks to harmless large data transfers. Different types of anomalies...
87
Voted
CGF
2008
15 years 2 months ago
2008
This paper presents a new, scalable, single pass algorithm for computing subsurface scattering using the diffusion approximation. Instead of pre-computing a globally conservative ...
124
Voted
GIS
2006
ACM
15 years 2 months ago
2006
ACM
We present an algorithm for polyline (and polygon) similarity testing that is based on the double-cross formalism. To determine the degree of similarity between two polylines, the...