Sciweavers

3735 search results - page 463 / 747
» Order compression schemes
Sort
View
TIT
2008
141views more  TIT 2008»
15 years 6 months ago
Dimensionality Reduction for Distributed Estimation in the Infinite Dimensional Regime
Distributed estimation of an unknown signal is a common task in sensor networks. The scenario usually envisioned consists of several nodes, each making an observation correlated wi...
Olivier Roy, Martin Vetterli
TIT
2008
72views more  TIT 2008»
15 years 6 months ago
On the Construction of (Explicit) Khodak's Code and Its Analysis
Variable-to-variable codes are very attractive yet not well understood data compression schemes. In 1972 Khodak claimed to provide upper and lower bounds for the achievable redund...
Yann Bugeaud, Michael Drmota, Wojciech Szpankowski
PAMI
2010
265views more  PAMI 2010»
15 years 5 months ago
Motion Segmentation in the Presence of Outlying, Incomplete, or Corrupted Trajectories
—In this paper, we study the problem of segmenting tracked feature point trajectories of multiple moving objects in an image sequence. Using the affine camera model, this proble...
Shankar Rao, Roberto Tron, René Vidal, Yi M...
ICASSP
2011
IEEE
14 years 10 months ago
Rapid image retrieval for mobile location recognition
Recognizing the location and orientation of a mobile device from captured images is a promising application of image retrieval algorithms. Matching the query images to an existing...
Georg Schroth, Anas Al-Nuaimi, Robert Huitl, Flori...
CTRSA
2011
Springer
223views Cryptology» more  CTRSA 2011»
14 years 10 months ago
Expedient Non-malleability Notions for Hash Functions
Non-malleability of a cryptographic primitive is a fundamental security property which ensures some sort of independence of cryptographic values. The notion has been extensively st...
Paul Baecher, Marc Fischlin, Dominique Schröd...