Sciweavers

1347 search results - page 165 / 270
» On the Structure of the Minimum Time Function
Sort
View
ICASSP
2011
IEEE
14 years 8 months ago
A general Bayesian algorithm for visual object tracking based on sparse features
This paper describes a Bayesian algorithm for rigid/non-rigid 2D visual object tracking based on sparse image features. The algorithm is inspired by the way human visual cortex se...
Mauricio Soto Alvarez, Carlo S. Regazzoni
TSD
1999
Springer
15 years 8 months ago
Prague Dependency Treebank: Restoration of Deletions
The use of the treebank as a resource for linguistic research has led us to look for an annotation scheme representing not only surface syntactic information (in ‘analytic treesâ...
Eva Hajicová, Ivana Kruijff-Korbayová...
FOCS
2009
IEEE
15 years 8 months ago
Space-Efficient Framework for Top-k String Retrieval Problems
Given a set D = {d1, d2, ..., dD} of D strings of total length n, our task is to report the "most relevant" strings for a given query pattern P. This involves somewhat mo...
Wing-Kai Hon, Rahul Shah, Jeffrey Scott Vitter
BMCBI
2008
123views more  BMCBI 2008»
15 years 4 months ago
Shape based indexing for faster search of RNA family databases
Background: Most non-coding RNA families exert their function by means of a conserved, common secondary structure. The Rfam data base contains more than five hundred structurally ...
Stefan Janssen, Jens Reeder, Robert Giegerich
MOR
2010
120views more  MOR 2010»
15 years 2 months ago
Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Lojasiewicz In
We study the convergence properties of an alternating proximal minimization algorithm for nonconvex structured functions of the type: L(x, y) = f(x)+Q(x, y)+g(y), where f : Rn → ...
Hedy Attouch, Jérôme Bolte, Patrick R...