Sciweavers

2324 search results - page 104 / 465
» A Fast Keyword-Spotting Technique
Sort
View
ECCV
2010
Springer
15 years 15 days ago
Fast dynamic texture detection
Dynamic textures can be considered to be spatio-temporally varying visual patterns in image sequences with certain temporal regularity. We propose a novel and efficient approach t...
BMVC
2002
15 years 15 days ago
Bundle adjustment: a fast method with weak initialisation
Bundle adjustment is one of the cornerstone to recover the scene structure from a sequence of images. The main drawback of this technique, due to nonlinear optimisation, is the ne...
Sébastien Cornou, Michel Dhome, Patrick Say...
DEBS
2007
ACM
14 years 12 months ago
Chained forests for fast subsumption matching
Content delivery is becoming increasingly popular on the Internet. There are many ways to match content to subscribers. In this paper, we focus on subsumption-based matching. We p...
Sasu Tarkoma
AAAI
2010
14 years 11 months ago
Fast Algorithms for Top-k Approximate String Matching
Top-k approximate querying on string collections is an important data analysis tool for many applications, and it has been exhaustively studied. However, the scale of the problem ...
Zhenglu Yang, Jianjun Yu, Masaru Kitsuregawa
RSS
2007
134views Robotics» more  RSS 2007»
14 years 11 months ago
A Fast and Practical Algorithm for Generalized Penetration Depth Computation
— We present an efficient algorithm to compute the generalized penetration depth (PDg) between rigid models. Given two overlapping objects, our algorithm attempts to compute the...
Liangjun Zhang, Young J. Kim, Dinesh Manocha