Sciweavers

740 search results - page 51 / 148
» An approximation ratio for biclustering
Sort
View
ISAAC
2010
Springer
257views Algorithms» more  ISAAC 2010»
15 years 4 months ago
Approximating Minimum Bending Energy Path in a Simple Corridor
Abstract. In this paper, we consider the problem of computing a minimum bending energy path (or MinBEP) in a simple corridor. Given a simple 2D corridor C bounded by straight line ...
Jinhui Xu, Lei Xu, Yulai Xie
TASLP
2010
142views more  TASLP 2010»
15 years 26 days ago
Beyond the Narrowband Approximation: Wideband Convex Methods for Under-Determined Reverberant Audio Source Separation
We consider the problem of extracting the source signals from an under-determined convolutive mixture assuming known mixing filters. State-of-the-art methods operate in the time-fr...
M. Kowalski, Emmanuel Vincent, Rémi Gribonv...
P2P
2009
IEEE
115views Communications» more  P2P 2009»
16 years 26 days ago
An Approximation Algorithm for Minimum-Delay Peer-to-Peer Streaming
Peer-to-peer (P2P) technology provides a scalable solution in multimedia streaming. Many streaming applications, such as IPTV and video conferencing, have rigorous constraints on ...
Fei Huang, Binoy Ravindran, Anil Vullikanti
INFOCOM
2008
IEEE
16 years 16 days ago
Approximation Algorithms for Computing Capacity of Wireless Networks with SINR Constraints
—A fundamental problem in wireless networks is to estimate its throughput capacity - given a set of wireless nodes, and a set of connections, what is the maximum rate at which da...
Deepti Chafekar, V. S. Anil Kumar, Madhav V. Marat...
WADS
2007
Springer
145views Algorithms» more  WADS 2007»
16 years 7 days ago
Approximate Shortest Paths Guided by a Small Index
Distance oracles and graph spanners are excerpts of a graph that allow to compute approximate shortest paths. Here, we consider the situation where it is possible to access the ori...
Jörg Derungs, Riko Jacob, Peter Widmayer