Sciweavers

4112 search results - page 403 / 823
» Efficient Algorithms for the Spoonerism Problem
Sort
View
TWC
2008
152views more  TWC 2008»
15 years 7 months ago
Bandwidth-Guaranteed Fair Scheduling with Effective Excess Bandwidth Allocation for Wireless Networks
Traffic scheduling is key to the provision of quality of service (QoS) differentiation and guarantees in wireless networks. Unlike its wireline counterpart, wireless communications...
Yaxin Cao, Ka-Cheong Leung, Victor O. K. Li
CORR
2004
Springer
144views Education» more  CORR 2004»
15 years 7 months ago
Iterative Quantization Using Codes On Graphs
We study codes on graphs combined with an iterative message passing algorithm for quantization. Specifically, we consider the binary erasure quantization (BEQ) problem which is th...
Emin Martinian, Jonathan S. Yedidia
ISAAC
2010
Springer
226views Algorithms» more  ISAAC 2010»
15 years 5 months ago
On Tractable Cases of Target Set Selection
We study the NP-complete TARGET SET SELECTION (TSS) problem occurring in social network analysis. Complementing results on its approximability and extending results for its restric...
André Nichterlein, Rolf Niedermeier, Johann...
ICIP
1994
IEEE
16 years 9 months ago
Robust B-Spline Image Smoothing
In this work we present a new approach to two - dimensional robust spline smoothing. The proposed method is based on M-estimator algorithms but unlike in other M-estimator based i...
Marta Karczewicz, Moncef Gabbouj, Jaakko Astola
ICML
2009
IEEE
16 years 8 months ago
Robot trajectory optimization using approximate inference
The general stochastic optimal control (SOC) problem in robotics scenarios is often too complex to be solved exactly and in near real time. A classical approximate solution is to ...
Marc Toussaint