Sciweavers

416 search results - page 16 / 84
» Simple and Efficient Algorithm for Approximate Dictionary Ma...
Sort
View
ICIP
2002
IEEE
14 years 9 months ago
A new and simple shape descriptor based on a non-parametric multiscale model
In this paper, we present a new and robust shape descriptor, which can be efficiently used to quickly prune a search for similar shapes in a large image database. The proposed sha...
Max Mignotte
ALGORITHMICA
2010
107views more  ALGORITHMICA 2010»
13 years 7 months ago
A Universal Online Caching Algorithm Based on Pattern Matching
We present a universal algorithm for the classical online problem of caching or demand paging. We consider the caching problem when the page request sequence is drawn from an unkn...
Gopal Pandurangan, Wojciech Szpankowski
CISS
2008
IEEE
13 years 7 months ago
Measuring interference in overcomplete signal representations
Currently, there is no quantitative way to ascertain how an overcomplete signal representation describes a signal and its features using terms drawn from a dictionary. Though spars...
Bob L. Sturm, John J. Shynk, Laurent Daudet
ECCV
2010
Springer
13 years 8 months ago
Activities as Time Series of Human Postures
Abstract. This paper presents an exemplar-based approach to detecting and localizing human actions, such as running, cycling, and swinging, in realistic videos with dynamic backgro...
William Brendel, Sinisa Todorovic
MFCS
2005
Springer
14 years 1 months ago
Greedy Approximation via Duality for Packing, Combinatorial Auctions and Routing
We study simple greedy approximation algorithms for general class of integer packing problems. We provide a novel analysis based on the duality theory of linear programming. This e...
Piotr Krysta