Sciweavers

4112 search results - page 103 / 823
» Efficient Algorithms for the Spoonerism Problem
Sort
View
DAC
1998
ACM
16 years 5 months ago
Efficient Coloring of a Large Spectrum of Graphs
We have developed a new algorithm and software for graph coloring by systematically combining several algorithm and software development ideas that had crucial impact on the algor...
Darko Kirovski, Miodrag Potkonjak
152
Voted
INFOCOM
2000
IEEE
15 years 8 months ago
On the Construction of Energy-Efficient Broadcast and Multicast Trees in Wireless Networks
— The wireless networking environment presents formidable challenges to the study of broadcasting and multicasting problems. After addressing the characteristics of wireless netw...
Jeffrey E. Wieselthier, Gam D. Nguyen, Anthony Eph...
163
Voted
EWSN
2009
Springer
16 years 4 months ago
Solving the Wake-Up Scattering Problem Optimally
Abstract. In their EWSN'07 paper [1], Giusti et al. proposed a decentralized wake-up scattering algorithm for temporally spreading the intervals in which the nodes of a wirele...
Luigi Palopoli, Roberto Passerone, Amy L. Murphy, ...
TMC
2012
13 years 6 months ago
Distributed Throughput Maximization in Wireless Networks via Random Power Allocation
—We develop a distributed throughput-optimal power allocation algorithm in wireless networks. The study of this problem has been limited due to the nonconvexity of the underlying...
Hyang-Won Lee, Eytan Modiano, Long Bao Le
NA
2008
80views more  NA 2008»
15 years 4 months ago
Efficient eigenvalue computation for quasiseparable Hermitian matrices under low rank perturbations
In this paper we address the problem of efficiently computing all the eigenvalues of a large N
Yuli Eidelman, Luca Gemignani, Israel Gohberg