Sciweavers

2796 search results - page 268 / 560
» The coolest path problem
Sort
View
MOBIHOC
2008
ACM
16 years 6 months ago
Strong barrier coverage of wireless sensor networks
Constructing sensor barriers to detect intruders crossing a randomly-deployed sensor network is an important problem. Early results have shown how to construct sensor barriers to ...
Benyuan Liu, Olivier Dousse, Jie Wang, Anwar Saipu...
ISCAS
2008
IEEE
217views Hardware» more  ISCAS 2008»
16 years 1 months ago
Approximate L0 constrained non-negative matrix and tensor factorization
— Non-negative matrix factorization (NMF), i.e. V ≈ WH where both V, W and H are non-negative has become a widely used blind source separation technique due to its part based r...
Morten Mørup, Kristoffer Hougaard Madsen, L...
NCA
2007
IEEE
16 years 28 days ago
Scheduling Bulk File Transfers with Start and End Times
The advancement of optical networking technologies has enabled e-science applications that often require transport of large volumes of scientific data. In support of such data-in...
Kannan Rajah, Sanjay Ranka, Ye Xia
WADS
2007
Springer
180views Algorithms» more  WADS 2007»
16 years 23 days ago
Spanners for Geometric Intersection Graphs
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
Martin Fürer, Shiva Prasad Kasiviswanathan
INFOCOM
2006
IEEE
16 years 21 days ago
Integrated Intermediate Waveband and Wavelength Switching for Optical WDM Mesh Networks
— As wavelength-division multiplexing (WDM) evolves towards practical applications in optical transport networks, waveband switching (WBS) has been introduced to cut down the ope...
Mengke Li, Byrav Ramamurthy