Sciweavers

1091 search results - page 172 / 219
» Approximation Algorithms for Data Placement Problems
Sort
View
CPM
2004
Springer
107views Combinatorics» more  CPM 2004»
15 years 8 months ago
Sorting by Reversals in Subquadratic Time
The problem of sorting a signed permutation by reversals is inspired by genome rearrangements in computational molecular biology. Given two genomes represented as two signed permut...
Eric Tannier, Marie-France Sagot
INFOCOM
2010
IEEE
15 years 2 months ago
Distributed Dynamic Speed Scaling
In recent years we have witnessed a great interest in large distributed computing platforms, also known as clouds. While these systems offer enormous computing power, they are howe...
Rade Stanojevic, Robert Shorten
IJCAI
2007
15 years 6 months ago
Fast Incremental Square Root Information Smoothing
We propose a novel approach to the problem of simultaneous localization and mapping (SLAM) based on incremental smoothing, that is suitable for real-time applications in large-sca...
Michael Kaess, Ananth Ranganathan, Frank Dellaert
ICASSP
2008
IEEE
15 years 11 months ago
High-dynamic range compression using a fast multiscale optimization
to appear in Proc. IEEE Int’l Conf. on Acoustics, Speech, and Signal Processing, March, 2008 High-dynamic-range medical images take intensity values which cannot be visualized o...
Matthieu Maitre, Yunqiang Chen, Tong Fang
177
Voted
GLOBECOM
2007
IEEE
15 years 11 months ago
Non-Cooperative Power Control for Faded Wireless Ad Hoc Networks
— The problem of non-cooperative power control is studied for wireless ad hoc networks supporting data services. We develop a maximum throughput based non-cooperative power contr...
Xiaolu Zhang, Meixia Tao, Chun Sum Ng