Sciweavers

1054 search results - page 200 / 211
» Fast Approximated SIFT
Sort
View
ISCA
2003
IEEE
108views Hardware» more  ISCA 2003»
15 years 2 months ago
Effective ahead Pipelining of Instruction Block Address Generation
On a N-way issue superscalar processor, the front end instruction fetch engine must deliver instructions to the execution core at a sustained rate higher than N instructions per c...
André Seznec, Antony Fraboulet
VRST
2003
ACM
15 years 2 months ago
Time-critical collision detection using an average-case approach
We present a novel, generic framework and algorithm for hierarchical collision detection, which allows an application to balance speed and quality of the collision detection. We p...
Jan Klein, Gabriel Zachmann
ICPR
2002
IEEE
15 years 2 months ago
Feasibility of Hough-Transform-Based Iris Localisation for Real-Time-Application
We present a fast method for locating iris features in frontal face images based on the Hough transform. It consists of an initial iris detection step and a tracking step which us...
Klaus D. Tönnies, Frank Behrens, Melanie Aurn...
SIGMOD
2010
ACM
323views Database» more  SIGMOD 2010»
15 years 2 months ago
Boosting spatial pruning: on optimal pruning of MBRs
Fast query processing of complex objects, e.g. spatial or uncertain objects, depends on efficient spatial pruning of the objects’ approximations, which are typically minimum bou...
Tobias Emrich, Hans-Peter Kriegel, Peer Kröge...
72
Voted
VLDB
2001
ACM
114views Database» more  VLDB 2001»
15 years 2 months ago
Distinct Sampling for Highly-Accurate Answers to Distinct Values Queries and Event Reports
Estimating the number of distinct values is a wellstudied problem, due to its frequent occurrence in queries and its importance in selecting good query plans. Previous work has sh...
Phillip B. Gibbons