2924 search results - page 380 / 585 » Lower Bounds in Distributed Computing |
144
click to vote
DCC
2003
IEEE
15 years 10 months ago
2003
IEEE
—This paper introduces a new high-rate analysis of the multiple description scalar quantizer (MDSQ) with balanced descriptions. The analysis provides insight into the structure o...
131
click to vote
ECCV
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. This paper presents an approach to object discovery in a given unlabeled image set, based on mining repetitive spatial configurations of image contours. Contours that si...
156
click to vote
STACS
2001
Springer
15 years 9 months ago
2001
Springer
We prove new results on evasiveness of monotone graph properties by extending the techniques of Kahn, Saks, and Sturtevant [Combinatorica, 4 (1984), pp. 297–306]. For the propert...
149
click to vote
ECCV
2000
Springer
15 years 9 months ago
2000
Springer
Abstract. Condensation is a popular algorithm for sequential inference that resamples a sampled representation of the posterior. The algorithm is known to be asymptotically correct...
138
click to vote
GD
1999
Springer
15 years 9 months ago
1999
Springer
In this paper we address the problem of drawing planar graphs with circular arcs while maintaining good angular resolution and small drawing area. We present a lower bound on the a...