Sciweavers

1539 search results - page 33 / 308
» Fast and Simple Methods For Computing Control Points
Sort
View
71
Voted
ICPR
2002
IEEE
16 years 3 months ago
Speeding up SVM Decision Based on Mirror Points
In this paper, we propose a new method to speed up SVM decision based on the idea of mirror points. Decisions based on multiple simple classifiers, which are formed as a result of...
Jiun-Hung Chen, Chu-Song Chen
117
Voted
AR
2007
103views more  AR 2007»
15 years 2 months ago
Stability of autonomous vehicle path tracking with pure delays in the control loop
This paper presents a new method to analyze the stability of a general class of mobile robot path tracking algorithms taking into account explicitly the computation and communicat...
Guillermo Heredia, Aníbal Ollero
159
Voted
ECCV
2010
Springer
15 years 7 months ago
Fast Approximate Nearest Neighbor Methods for Non-Euclidean Manifolds with Applications to Human Activity Analysis in Videos
Approximate Nearest Neighbor (ANN) methods such as Locality Sensitive Hashing, Semantic Hashing, and Spectral Hashing, provide computationally ecient procedures for nding objects...
Rizwan Chaudhry, Yuri Ivanov
121
Voted
VMV
2007
141views Visualization» more  VMV 2007»
15 years 3 months ago
Distance Calculation between a Point and a Subdivision Surface
This article focuses on algorithms for fast computation of the Euclidean distance between a query point and a subdivision surface. The analyzed algorithms include uniform tessella...
Torsten Ullrich, Volker Settgast, Ulrich Krispel, ...
101
Voted
KDD
2005
ACM
130views Data Mining» more  KDD 2005»
16 years 2 months ago
Simple and effective visual models for gene expression cancer diagnostics
In the paper we show that diagnostic classes in cancer gene expression data sets, which most often include thousands of features (genes), may be effectively separated with simple ...
Gregor Leban, Minca Mramor, Ivan Bratko, Blaz Zupa...