Sciweavers

3894 search results - page 455 / 779
» Approximation Algorithms for Biclustering Problems
Sort
View
IPCO
2007
98views Optimization» more  IPCO 2007»
15 years 6 months ago
Scheduling with Precedence Constraints of Low Fractional Dimension
Abstract. We consider the single machine scheduling problem to minimize the average weighted completion time under precedence constrains. Improving on the various 2-approximation a...
Christoph Ambühl, Monaldo Mastrolilli, Nikola...
138
Voted
TIT
2008
112views more  TIT 2008»
15 years 4 months ago
Rainbow Network Flow of Multiple Description Codes
This paper is an enquiry into the interaction between multiple description coding (MDC) and network routing. We are mainly concerned with rate-distortion optimized network flow of...
Xiaolin Wu, Bin Ma, Nima Sarshar
CVPR
2003
IEEE
16 years 6 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
15 years 11 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
166
Voted
ICRA
2002
IEEE
187views Robotics» more  ICRA 2002»
15 years 9 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