Sciweavers

279 search results - page 11 / 56
» Approximating Average Parameters of Graphs
Sort
View
ESA
2009
Springer
159views Algorithms» more  ESA 2009»
14 years 2 months ago
Contraction Bidimensionality: The Accurate Picture
We provide new combinatorial theorems on the structure of graphs that are contained as contractions in graphs of large treewidth. As a consequence of our combinatorial results we u...
Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thi...
CORR
2010
Springer
182views Education» more  CORR 2010»
13 years 7 months ago
Index coding via linear programming
Abstract Anna Blasiak Robert Kleinberg Eyal Lubetzky Index Coding has received considerable attention recently motivated in part by applications such as fast video-on-demand and e...
Anna Blasiak, Robert D. Kleinberg, Eyal Lubetzky
CPM
2008
Springer
148views Combinatorics» more  CPM 2008»
13 years 9 months ago
On-Line Approximate String Matching with Bounded Errors
We introduce a new dimension to the widely studied on-line approximate string matching problem, by introducing an error threshold parameter so that the algorithm is allowed to mis...
Marcos A. Kiwi, Gonzalo Navarro, Claudio Telha
TWC
2008
127views more  TWC 2008»
13 years 7 months ago
Energy-Delay Analysis of MAC Protocols in Wireless Networks
In this paper the tradeoff between energy and delay for wireless networks is studied. A network using a request-to-send (RTS) and clear-to-send (CTS) type medium access control (M...
Shih Yu Chang, Wayne E. Stark, Achilleas Anastasop...
QRE
2010
129views more  QRE 2010»
13 years 6 months ago
Improving quality of prediction in highly dynamic environments using approximate dynamic programming
In many applications, decision making under uncertainty often involves two steps- prediction of a certain quality parameter or indicator of the system under study and the subseque...
Rajesh Ganesan, Poornima Balakrishna, Lance Sherry