Sciweavers

2127 search results - page 149 / 426
» Computing large matchings fast
Sort
View
GRAPHICSINTERFACE
2009
15 years 1 months ago
Fast visualization of complex 3D models using displacement mapping
We present a simple method to render complex 3D models at interactive rates using real-time displacement mapping. We use an octree to decompose the 3D model into a set of height f...
The-Kiet Lu, Kok-Lim Low, Jianmin Zheng
ECCV
2010
Springer
15 years 8 months ago
Feature tracking for wide-baseline image retrieval
We address the problem of large scale image retrieval in a wide-baseline setting, where for any query image all the matching database images will come from very different viewpoint...
DSD
2003
IEEE
142views Hardware» more  DSD 2003»
15 years 9 months ago
FC-Min: A Fast Multi-Output Boolean Minimizer
We present a novel heuristic algorithm for two-level Boolean minimization. In contrast to the other approaches, the proposed method firstly finds the coverage of the on-sets and f...
Petr Fiser, Jan Hlavicka, Hana Kubatova
FLAIRS
2008
15 years 6 months ago
One-Pass Learning Algorithm for Fast Recovery of Bayesian Network
An efficient framework is proposed for the fast recovery of Bayesian network classifier. A novel algorithm, called Iterative Parent-Child learningBayesian Network Classifier (IPC-...
Shunkai Fu, Michel Desmarais, Fan Li
SDM
2010
SIAM
151views Data Mining» more  SDM 2010»
15 years 5 months ago
Fast Stochastic Frank-Wolfe Algorithms for Nonlinear SVMs
The high computational cost of nonlinear support vector machines has limited their usability for large-scale problems. We propose two novel stochastic algorithms to tackle this pr...
Hua Ouyang, Alexander Gray