Sciweavers

145 search results - page 13 / 29
» Fast, Randomized Join-Order Selection - Why Use Transformati...
Sort
View
CIKM
2010
Springer
14 years 10 months ago
Fast dimension reduction for document classification based on imprecise spectrum analysis
This paper proposes an algorithm called Imprecise Spectrum Analysis (ISA) to carry out fast dimension reduction for document classification. ISA is designed based on the one-sided...
Hu Guan, Bin Xiao, Jingyu Zhou, Minyi Guo, Tao Yan...
TCOS
2010
14 years 10 months ago
Approximate Shortest Path Queries Using Voronoi Duals
We propose an approximation method to answer point-to-point shortest path queries in undirected edge-weighted graphs, based on random sampling and Voronoi duals. We compute a simp...
Shinichi Honiden, Michael E. Houle, Christian Somm...
102
Voted
ICCV
1995
IEEE
15 years 3 months ago
Fast Object Recognition in Noisy Images Using Simulated Annealing
A fast simulatedannealingalgorithmis developed for automatic object recognition. The object recognition problem is addressed as the problem of best describing a match between a hy...
Margrit Betke, Nicholas C. Makris
CVPR
2005
IEEE
16 years 2 months ago
Randomized Trees for Real-Time Keypoint Recognition
In earlier work, we proposed treating wide baseline matching of feature points as a classification problem, in which each class corresponds to the set of all possible views of suc...
Vincent Lepetit, Pascal Lagger, Pascal Fua
CVIU
2004
143views more  CVIU 2004»
15 years 6 days ago
Shape matching of partially occluded curves invariant under projective transformation
This paper describes a method to identify partially occluded shapes which are randomly oriented in 3D space. The goal is to match the object contour present in an image with an ob...
Carlos Orrite, José Elías Herrero Ja...