Sciweavers

154 search results - page 30 / 31
» Approximate String Matching: A Simpler Faster Algorithm
Sort
View
IROS
2006
IEEE
96views Robotics» more  IROS 2006»
13 years 11 months ago
Topological Mapping Inspired by Techniques in DNA Sequence Alignment
Abstract— This paper introduces a method of building topological maps using sequences of images and the approximate string matching algorithm, which is commonly used in DNA seque...
Alan M. Zhang, Lindsay Kleeman, R. Andrew Russell
MTA
2007
141views more  MTA 2007»
13 years 5 months ago
Flexible integration of multimedia sub-queries with qualitative preferences
Complex multimedia queries, aiming to retrieve from large databases those objects that best match the query specification, are usually processed by splitting them into a set of m ...
Ilaria Bartolini, Paolo Ciaccia, Vincent Oria, M. ...
CVPR
2008
IEEE
14 years 7 months ago
Reduce, reuse & recycle: Efficiently solving multi-label MRFs
In this paper, we present novel techniques that improve the computational and memory efficiency of algorithms for solving multi-label energy functions arising from discrete MRFs o...
Karteek Alahari, Pushmeet Kohli, Philip H. S. Torr
STOC
2003
ACM
188views Algorithms» more  STOC 2003»
14 years 6 months ago
Almost random graphs with simple hash functions
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
Martin Dietzfelbinger, Philipp Woelfel
CORR
2011
Springer
210views Education» more  CORR 2011»
13 years 23 days ago
Statistical Compressed Sensing of Gaussian Mixture Models
A novel framework of compressed sensing, namely statistical compressed sensing (SCS), that aims at efficiently sampling a collection of signals that follow a statistical distribu...
Guoshen Yu, Guillermo Sapiro