2168 search results - page 314 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
133
click to vote
CIVR
2007
Springer
15 years 10 months ago
2007
Springer
We present a novel matching and similarity evaluation method for planar geometric shapes represented by sets of polygonal curves. Given two shapes, the matching algorithm randomly...
153
click to vote
ICFP
2007
ACM
16 years 4 months ago
2007
ACM
We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies ...
138
click to vote
CVPR
2003
IEEE
15 years 9 months ago
2003
IEEE
A framework for analyzing distortions in non-single viewpoint imaging systems is presented. Such systems possess loci of viewpoints called caustics. In general, perspective (or un...
128
click to vote
ECCV
2004
Springer
16 years 5 months ago
2004
Springer
Abstract. We describe a new approach for learning to perform classbased segmentation using only unsegmented training examples. As in previous methods, we first use training images ...
149
click to vote
MOBIHOC
2007
ACM
16 years 3 months ago
2007
ACM
The non-existence of an end-to-end path poses a challenge in adapting the traditional routing algorithms to delay tolerant networks (DTNs). Previous works include centralized rout...