Sciweavers

3875 search results - page 484 / 775
» Approximation algorithms for the 0-extension problem
Sort
View
APPROX
2011
Springer
197views Algorithms» more  APPROX 2011»
14 years 6 months ago
Periodicity and Cyclic Shifts via Linear Sketches
We consider the problem of identifying periodic trends in data streams. We say a signal a ∈ Rn is p-periodic if ai = ai+p for all i ∈ [n − p]. Recently, Erg¨un et al. [4] pr...
Michael S. Crouch, Andrew McGregor
194
Voted
CVPR
2003
IEEE
16 years 8 months ago
Nonparametric Belief Propagation
In many applications of graphical models arising in computer vision, the hidden variables of interest are most naturally specified by continuous, non-Gaussian distributions. There...
Erik B. Sudderth, Alexander T. Ihler, William T. F...
INFOCOM
2009
IEEE
16 years 1 months ago
Time Slicing in Mobile TV Broadcast Networks with Arbitrary Channel Bit Rates
Abstract—Mobile TV networks have received significant attention from the industry and academia, as they have already been deployed in several countries and their expected market...
Cheng-Hsin Hsu, Mohamed Hefeeda
ICRA
2002
IEEE
187views Robotics» more  ICRA 2002»
15 years 11 months ago
Trajectory Planning using Reachable-State Density Functions
:This paper presents a trajectory planning algorithm for mobile robots which may be subject to kinodynamic constraints. Using computational methods from noncommutative harmonic ana...
Richard Mason, Joel W. Burdick
INFOCOM
2009
IEEE
16 years 1 months ago
Locally vs. Globally Optimized Flow-Based Content Distribution to Mobile Nodes
—The paper deals with efficient distribution of timely information to flows of mobile devices. We consider the case where a set of Information Dissemination Devices (IDDs) broa...
Mhameed Aezladen, Reuven Cohen, Danny Raz