Sciweavers

868 search results - page 25 / 174
» A general compression algorithm that supports fast searching
Sort
View
NECO
2008
108views more  NECO 2008»
13 years 7 months ago
An SMO Algorithm for the Potential Support Vector Machine
We describe a fast Sequential Minimal Optimization (SMO) procedure for solving the dual optimization problem of the recently proposed Potential Support Vector Machine (P-SVM). The...
Tilman Knebel, Sepp Hochreiter, Klaus Obermayer
CPM
1998
Springer
209views Combinatorics» more  CPM 1998»
13 years 12 months ago
A Fast Bit-Vector Algorithm for Approximate String Matching Based on Dynamic Programming
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
Gene Myers
WEBDB
2007
Springer
128views Database» more  WEBDB 2007»
14 years 1 months ago
Supporting Range Queries on Web Data Using k-Nearest Neighbor Search
A large volume of geospatial data is available on the web through various forms of applications. However, access to these data is limited by certain types of queries due to restric...
Wan D. Bae, Shayma Alkobaisi, Seon Ho Kim, Sada Na...
VRML
1997
ACM
13 years 12 months ago
QOTA: A Fast, Multi-Purpose Algorithm for Terrain Following in Virtual Environments
To keep avatars and other moving objects on the ground in virtual environments, it is necessary to find the points where these objects should contact the terrain. This is often do...
John W. Barrus, Richard C. Waters
SIAMSC
2008
145views more  SIAMSC 2008»
13 years 7 months ago
Fast Multilevel Algorithm for a Minimization Problem in Impulse Noise Removal
An effective 2-phase method for removing impulse noise was recently proposed. Its phase 1 identifies noisy pixel candidates by using median-type filters. Then in phase 2, it resto...
Raymond H. Chan, Ke Chen 0002