Sciweavers

43 search results - page 8 / 9
» Better approximations for max TSP
Sort
View
SAT
2010
Springer
172views Hardware» more  SAT 2010»
13 years 3 months ago
On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem
Algorithms based on local search are popular for solving many optimization problems including the maximum satisfiability problem (MAXSAT). With regard to MAXSAT, the state of the ...
Denis Pankratov, Allan Borodin
TSP
2010
13 years 13 hour ago
Bayesian multi-object filtering with amplitude feature likelihood for unknown object SNR
In many tracking scenarios, the amplitude of target returns are stronger than those coming from false alarms. This information can be used to improve the multi-target state estimat...
Daniel Clark, Branko Ristic, Ba-Ngu Vo, Ba-Tuong V...
IJCNN
2006
IEEE
13 years 11 months ago
Greedy forward selection algorithms to Sparse Gaussian Process Regression
Abstract— This paper considers the basis vector selection issue invloved in forward selection algorithms to sparse Gaussian Process Regression (GPR). Firstly, we re-examine a pre...
Ping Sun, Xin Yao
CVPR
2010
IEEE
14 years 1 months ago
Locality-constrained Linear Coding for Image Classification
The traditional SPM approach based on bag-of-features (BoF) must use nonlinear classifiers to achieve good image classification performance. This paper presents a simple but effec...
Jinjun Wang, Jianchao Yang, Kai Yu, Fengjun Lv
CGF
1999
159views more  CGF 1999»
13 years 5 months ago
Fast Polyhedral Cell Sorting for Interactive Rendering of Unstructured Grids
Direct volume rendering based on projective methods works by projecting, in visibility order, the polyhedral cells of a mesh onto the image plane, and incrementally compositing th...
João Comba, James T. Klosowski, Nelson L. M...