Sciweavers

364 search results - page 30 / 73
» Computing Communities in Large Networks Using Random Walks
Sort
View
120
Voted
ICPP
2006
IEEE
15 years 8 months ago
Adaptively Routing P2P Queries Using Association Analysis
Unstructured peer-to-peer networks have become a very popular method for content distribution in the past few years. By not enforcing strict rules on the network’s topology or c...
Brian D. Connelly, Christopher W. Bowron, Li Xiao,...
138
Voted
MOBICOM
2003
ACM
15 years 7 months ago
Range-free localization schemes for large scale sensor networks
Wireless Sensor Networks have been proposed for a multitude of location-dependent applications. For such systems, the cost and limitations of the hardware on sensing nodes prevent...
Tian He, Chengdu Huang, Brian M. Blum, John A. Sta...
153
Voted
DCOSS
2011
Springer
14 years 2 months ago
Planning the trajectories of multiple mobile sinks in large-scale, time-sensitive WSNs
—Controlled sink mobility has been shown to be very beneficial in lifetime prolongation of wireless sensor networks (WSNs) by avoiding the typical hot-spot problem near the sink...
Wint Yi Poe, Michael Beck, Jens B. Schmitt
149
Voted
JMLR
2012
13 years 5 months ago
Random Search for Hyper-Parameter Optimization
Grid search and manual search are the most widely used strategies for hyper-parameter optimization. This paper shows empirically and theoretically that randomly chosen trials are ...
James Bergstra, Yoshua Bengio
CORR
2007
Springer
144views Education» more  CORR 2007»
15 years 2 months ago
Distributing the Kalman Filter for Large-Scale Systems
This paper derives a near optimal distributed Kalman filter to estimate a large-scale random field monitored by a network of N sensors. The field is described by a sparsely con...
Usman A. Khan, José M. F. Moura