Sciweavers

6365 search results - page 374 / 1273
» Fast Local Computation Algorithms
Sort
View
EUROGRAPHICS
2010
Eurographics
16 years 3 months ago
Electors Voting for Fast Automatic Shape Correspondence
This paper challenges the difficult problem of automatic semantic correspondence between two given shapes which are semantically similar but possibly geometrically very different...
Oscar Kin-Chung Au, Chiew-Lan Tai, Daniel Cohen-Or...
CGO
2008
IEEE
16 years 1 months ago
Fast liveness checking for ssa-form programs
Liveness analysis is an important analysis in optimizing compilers. Liveness information is used in several optimizations and is mandatory during the code-generation phase. Two dr...
Benoit Boissinot, Sebastian Hack, Daniel Grund, Be...
BMCBI
2008
102views more  BMCBI 2008»
15 years 6 months ago
Fast splice site detection using information content and feature reduction
Background: Accurate identification of splice sites in DNA sequences plays a key role in the prediction of gene structure in eukaryotes. Already many computational methods have be...
A. K. M. A. Baten, Saman K. Halgamuge, Bill C. H. ...
ICRA
2002
IEEE
147views Robotics» more  ICRA 2002»
15 years 11 months ago
Auxiliary Particle Filter Robot Localization from High-Dimensional Sensor Observations
We apply the auxiliary particle filter algorithm of Pitt and Shephard (1999) to the problem of robot localization. To deal with the high-dimensional sensor observations (images) ...
Nikos A. Vlassis, Bas Terwijn, Ben J. A. Krös...
ICANN
2001
Springer
15 years 11 months ago
Incremental Support Vector Machine Learning: A Local Approach
Abstract. In this paper, we propose and study a new on-line algorithm for learning a SVM based on Radial Basis Function Kernel: Local Incremental Learning of SVM or LISVM. Our meth...
Liva Ralaivola, Florence d'Alché-Buc