Sciweavers

1272 search results - page 162 / 255
» Approximate Parameterized Matching
Sort
View
139
Voted
ICIP
2005
IEEE
16 years 5 months ago
The M-term pursuit for image representation and progressive compression
This paper introduces a sparse signal representation algorithm in redundant dictionaries, called the M-Term Pursuit (MTP), with an application to image representation and scalable ...
Adel Rahmoune, Pierre Vandergheynst, Pascal Frossa...
269
Voted
VLDB
2002
ACM
184views Database» more  VLDB 2002»
16 years 4 months ago
Database indexing for large DNA and protein sequence collections
Our aim is to develop new database technologies for the approximate matching of unstructured string data using indexes. We explore the potential of the suffix tree data structure i...
Ela Hunt, Malcolm P. Atkinson, Robert W. Irving
140
Voted
SSDBM
2006
IEEE
139views Database» more  SSDBM 2006»
15 years 9 months ago
Sampling Trajectory Streams with Spatiotemporal Criteria
Monitoring movement of high-dimensional points is essential for environmental databases, geospatial applications, and biodiversity informatics as it reveals crucial information ab...
Michalis Potamias, Kostas Patroumpas, Timos K. Sel...
WADS
2005
Springer
114views Algorithms» more  WADS 2005»
15 years 9 months ago
Linear Time Algorithms for Generalized Edge Dominating Set Problems
Abstract. In this paper we consider a generalization of the edge dominating set (EDS) problem, in which each edge e needs to be covered be times and refer to this as the b-EDS prob...
André Berger, Ojas Parekh
GRAPHICSINTERFACE
2003
15 years 5 months ago
Dynamic Canvas for Non-Photorealistic Walkthroughs
The static background paper or canvas texture usually used for non-photorealistic animation greatly impedes the sensation of motion and results in a disturbing “shower door” e...
Matthieu Cunzi, Joëlle Thollot, Sylvain Paris...