Sciweavers

197 search results - page 25 / 40
» Simple deterministic approximation algorithms for counting m...
Sort
View
PRL
2007
99views more  PRL 2007»
13 years 7 months ago
Polygonal shape description for recognition of partially occluded objects
We introduce a new method for the recognition of partially occluded objects represented only by their contours. Object description, which stems from the inflection point detectio...
Filip Krolupper, Jan Flusser
COMPGEOM
2001
ACM
13 years 11 months ago
Segment intersection searching problems in general settings
We consider segment intersection searching amidst (possibly intersecting) algebraic arcs in the plane. We show how to preprocess n arcs in time O(n2+ ) into a data structure of si...
Vladlen Koltun
CORR
2007
Springer
183views Education» more  CORR 2007»
13 years 7 months ago
Compressed Sensing and Redundant Dictionaries
This article extends the concept of compressed sensing to signals that are not sparse in an orthonormal basis but rather in a redundant dictionary. It is shown that a matrix, whic...
Holger Rauhut, Karin Schnass, Pierre Vandergheynst
TSMC
1998
117views more  TSMC 1998»
13 years 7 months ago
A mean field annealing approach to robust corner detection
—This paper is an extension of our previous paper to improve the capability of detecting corners. We proposed a method of boundary smoothing for curvature estimation using a cons...
Kwanghoon Sohn, Jung H. Kim, Winser E. Alexander
FSTTCS
2009
Springer
14 years 2 months ago
Donation Center Location Problem
We introduce and study the donation center location problem, which has an additional application in network testing and may also be of independent interest as a general graph-theor...
Chien-Chung Huang, Zoya Svitkina