Sciweavers

1646 search results - page 70 / 330
» fast 2007
Sort
View
137
Voted
ICCV
2007
IEEE
15 years 10 months ago
Fast Matching of Planar Shapes in Sub-cubic Runtime
The matching of planar shapes can be cast as a problem of finding the shortest path through a graph spanned by the two shapes, where the nodes of the graph encode the local simil...
Frank R. Schmidt, Dirk Farin, Daniel Cremers
146
Voted
ICDAR
2007
IEEE
15 years 10 months ago
Fast Lexicon-Based Scene Text Recognition with Sparse Belief Propagation
Using a lexicon can often improve character recognition under challenging conditions, such as poor image quality or unusual fonts. We propose a flexible probabilistic model for c...
Jerod J. Weinman, Erik G. Learned-Miller, Allen R....
126
Voted
ICDM
2007
IEEE
105views Data Mining» more  ICDM 2007»
15 years 10 months ago
Fast Mining of Complex Spatial Co-location Patterns Using GLIMIT
Most algorithms for mining interesting spatial colocations integrate the co-location / clique generation task with the interesting pattern mining task, and are usually based on th...
Florian Verhein, Ghazi Al-Naymat
112
Voted
IPPS
2007
IEEE
15 years 10 months ago
Using an FPGA for Fast Bit Accurate SoC Simulation
In this paper we describe a sequential simulation method to simulate large parallel homo- and heterogeneous systems on a single FPGA. The method is applicable for parallel systems...
Pascal T. Wolkotte, Philip K. F. Hölzenspies,...
110
Voted
IROS
2007
IEEE
109views Robotics» more  IROS 2007»
15 years 10 months ago
Fast vision-based minimum distance determination between known and unkown objects
Abstract – We present a method for quickly determining the minimum distance between multiple known and multiple unkown objects within a camera image. Known objects are objects wi...
Stefan Kuhn, Dominik Henrich