Sciweavers

161 search results - page 20 / 33
» Efficient Algorithms for Handling Molecular Weighted Sequenc...
Sort
View
ICPR
2006
IEEE
14 years 8 months ago
Multi-View Active Shape Model with Robust Parameter Estimation
Active Shape Model is an efficient way for localizing objects with variable shapes. When ASM is extended to multiview cases, the parameter estimation approaches in previous works ...
Li Zhang, Haizhou Ai
PAMI
2010
112views more  PAMI 2010»
13 years 6 months ago
Polynomial Time Algorithms for Ratio Regions and a Variant of Normalized Cut
—In partitioning, clustering, and grouping problems, a typical goal is to group together similar objects, or pixels in the case of image processing. At the same time, another goa...
Dorit S. Hochbaum
JUCS
2007
122views more  JUCS 2007»
13 years 7 months ago
Efficient Access Methods for Temporal Interval Queries of Video Metadata
: Indexing video content is one of the most important problems in video databases. In this paper we present linear time and space algorithms for handling video metadata that repres...
Spyros Sioutas, Kostas Tsichlas, Bill Vassiliadis,...
CVPR
2005
IEEE
14 years 9 months ago
Robust L1 Norm Factorization in the Presence of Outliers and Missing Data by Alternative Convex Programming
Matrix factorization has many applications in computer vision. Singular Value Decomposition (SVD) is the standard algorithm for factorization. When there are outliers and missing ...
Qifa Ke, Takeo Kanade
STOC
2003
ACM
95views Algorithms» more  STOC 2003»
14 years 8 months ago
Random knapsack in expected polynomial time
In this paper, we present the first average-case analysis proving an expected polynomial running time for an exact algorithm for the 0/1 knapsack problem. In particular, we prove,...
René Beier, Berthold Vöcking