Sciweavers

184 search results - page 26 / 37
» Query Complexity Lower Bounds for Reconstruction of Codes
Sort
View
ICIP
2005
IEEE
14 years 9 months ago
Scene analysis for reducing motion JPEG 2000 video surveillance delivery bandwidth and complexity
In this paper, we propose a new object-based video coding/transmission system using the emerging Motion JPEG 2000 standard [1] for the efficient storage and delivery of video surve...
Christophe Parisot, Jérôme Meessen, J...
ISVC
2009
Springer
14 years 13 days ago
Deformable Proximity Queries and Their Application in Mobile Manipulation Planning
Abstract. We describe a proximity query algorithm for the exact minimum distance computation between arbitrarily shaped objects. Special characteristics of the Gilbert-Johnson-Keer...
Marc Gissler, Christian Dornhege, Bernhard Nebel, ...
SODA
2000
ACM
123views Algorithms» more  SODA 2000»
13 years 9 months ago
Communication complexity of document exchange
We address the problem of minimizing the communication involved in the exchange of similar documents. We consider two users, A and B, who hold documents x and y respectively. Neit...
Graham Cormode, Mike Paterson, Süleyman Cenk ...
COCOON
2005
Springer
14 years 1 months ago
Promised and Distributed Quantum Search
This paper gives a quantum algorithm to search in an set S for a k-tuple satisfying some predefined relation, with the promise that some components of a desired k-tuple are in som...
Shengyu Zhang
INFOCOM
2002
IEEE
14 years 24 days ago
On the capacity of wireless networks: The relay case
Abstract— In [1], Gupta and Kumar determined the capacity of wireless networks under certain assumptions, among them point-to-point coding, which excludes for example multi-acces...
Michael Gastpar, Martin Vetterli