Sciweavers

157 search results - page 14 / 32
» Randomized Algorithms for Minimum Distance Localization
Sort
View
ICCV
2011
IEEE
12 years 8 months ago
Perturb-and-MAP Random Fields: Using Discrete Optimization\\to Learn and Sample from Energy Models
We propose a novel way to induce a random field from an energy function on discrete labels. It amounts to locally injecting noise to the energy potentials, followed by finding t...
George Papandreou, Alan L. Yuille
IPTPS
2005
Springer
14 years 1 months ago
Locality Prediction for Oblivious Clients
To improve performance, large-scale Internet systems require clients to access nearby servers. While centralized systems can leverage static topology maps for rough network distan...
Kevin P. Shanahan, Michael J. Freedman
VTC
2010
IEEE
140views Communications» more  VTC 2010»
13 years 6 months ago
Analysis of Local Quasi-Stationarity Regions in an Urban Macrocell Scenario
—A common simplification in the treatment of random linear channels is the wide-sense stationary and uncorrelated scattering (WSSUS) assumption. For wireless channels, this assu...
Adrian Ispas, Gerd Ascheid, Christian Schneider, R...
WSC
2008
13 years 10 months ago
SR-1: A simulation-based algorithm for the Capacitated Vehicle Routing Problem
In this paper we present SR-1, a simulation-based heuristic algorithm for the Capacitated Vehicle Routing Problem (CVRP). Given a CVRP instance, SR-1 uses an initial "good so...
Javier Faulin, Miquel Gilibert, Angel A. Juan, Xav...
AINA
2005
IEEE
14 years 1 months ago
Nodes Localization through Data Fusion in Sensor Network
The Location of nodes in sensor network is an important problem with application in resource allocation, location sensitive browsing, and emergency communications. A key problem i...
Ren C. Luo, Ogst Chen, Liang Chao Tu