Sciweavers

1494 search results - page 236 / 299
» Polynomial time algorithms for network information flow
Sort
View
IPSN
2009
Springer
14 years 3 months ago
Near-optimal Bayesian localization via incoherence and sparsity
This paper exploits recent developments in sparse approximation and compressive sensing to efficiently perform localization in a sensor network. We introduce a Bayesian framework...
Volkan Cevher, Petros Boufounos, Richard G. Barani...
GIS
2005
ACM
14 years 9 months ago
Monitoring dynamic spatial fields using responsive geosensor networks
Information about dynamic spatial fields, such as temperature, windspeed, or the concentration of gas pollutant in the air, is important for many environmental applications. At th...
Matt Duckham, Silvia Nittel, Michael F. Worboys
COLCOM
2007
IEEE
14 years 3 months ago
Cooperative security in distributed sensor networks
— Distributed sensor network protocols, such as routing, time synchronization or data aggregation protocols make use of collaborative techniques to minimize the consumption of sc...
Oscar García Morchon, Heribert Baldus, Tobi...
CONEXT
2008
ACM
13 years 10 months ago
Efficient IP-address lookup with a shared forwarding table for multiple virtual routers
Virtual routers are a promising way to provide network services such as customer-specific routing, policy-based routing, multi-topology routing, and network virtulization. However...
Jing Fu, Jennifer Rexford
EPIA
2003
Springer
14 years 2 months ago
Evolutionary Neuroestimation of Fitness Functions
Abstract. One of the most influential factors in the quality of the solutions found by an evolutionary algorithm is the appropriateness of the fitness function. Specifically in ...
Jesús S. Aguilar-Ruiz, Daniel Mateos, Domin...