Sciweavers

1046 search results - page 138 / 210
» Approximation Algorithms for Domination Search
Sort
View
ICCV
2005
IEEE
16 years 5 months ago
Object Recognition in High Clutter Images Using Line Features
We present an object recognition algorithm that uses model and image line features to locate complex objects in high clutter environments. Finding correspondences between model an...
Philip David, Daniel DeMenthon
211
Voted
SIAMIS
2011
14 years 10 months ago
Gradient-Based Methods for Sparse Recovery
The convergence rate is analyzed for the sparse reconstruction by separable approximation (SpaRSA) algorithm for minimizing a sum f(x) + ψ(x), where f is smooth and ψ is convex, ...
William W. Hager, Dzung T. Phan, Hongchao Zhang
PE
2006
Springer
145views Optimization» more  PE 2006»
15 years 3 months ago
Closed form solutions for mapping general distributions to quasi-minimal PH distributions
Approximating general distributions by phase-type (PH) distributions is a popular technique in stochastic analysis, since the Markovian property of PH distributions often allows a...
Takayuki Osogami, Mor Harchol-Balter
CCCG
2001
15 years 4 months ago
Translational polygon covering using intersection graphs
We investigate the following translational 2D polygon covering problem: for a collection of covering polygons and a target point (or polygon) set, decide if the covering polygons ...
Karen Daniels, Rajasekhar Inkulu
KDD
2007
ACM
179views Data Mining» more  KDD 2007»
15 years 9 months ago
Mining statistically important equivalence classes and delta-discriminative emerging patterns
The support-confidence framework is the most common measure used in itemset mining algorithms, for its antimonotonicity that effectively simplifies the search lattice. This com...
Jinyan Li, Guimei Liu, Limsoon Wong