Sciweavers

2421 search results - page 14 / 485
» Approximate Flow-Aware Networking
Sort
View
NETWORKS
2008
14 years 11 months ago
Approximation bounds for Black Hole Search problems
Ralf Klasing, Euripides Markou, Tomasz Radzik, Fab...
CORR
2010
Springer
162views Education» more  CORR 2010»
14 years 10 months ago
Networked Computing in Wireless Sensor Networks for Structural Health Monitoring
Abstract—This paper studies the problem of distributed computation over a network of wireless sensors. While this problem applies to many emerging applications, to keep our discu...
Apoorva Jindal, Mingyan Liu
ICC
2009
IEEE
140views Communications» more  ICC 2009»
14 years 9 months ago
Approximation Algorithms for Traffic Grooming in WDM Rings
Abstract-- This paper addresses the problem of traffic grooming in WDM rings in which all traffic emanates from a single node and all other nodes are destination nodes. This "...
Kevin Corcoran, Seth Flaxman, Mark Neyer, Peter Sc...
JCSS
2010
146views more  JCSS 2010»
14 years 10 months ago
Connected facility location via random facility sampling and core detouring
We present a simple randomized algorithmic framework for connected facility location problems. The basic idea is as follows: We run a black-box approximation algorithm for the unc...
Friedrich Eisenbrand, Fabrizio Grandoni, Thomas Ro...
PRL
2011
14 years 6 months ago
Efficient approximate Regularized Least Squares by Toeplitz matrix
Machine Learning based on the Regularized Least Square (RLS) model requires one to solve a system of linear equations. Direct-solution methods exhibit predictable complexity and s...
Sergio Decherchi, Paolo Gastaldo, Rodolfo Zunino