Sciweavers

3227 search results - page 60 / 646
» Designing with Distance Fields
Sort
View
MSWIM
2005
ACM
14 years 3 months ago
Hop distances and flooding in wireless multihop networks with randomized beamforming
We show that randomized beamforming is a simple yet efficient communication strategy in wireless multihop networks if no neighbor location information is at hand. Already small an...
Robert Vilzmann, Christian Bettstetter, Daniel Med...
IEICET
2010
72views more  IEICET 2010»
13 years 8 months ago
Static Estimation of the Meteorological Visibility Distance in Night Fog with Imagery
In this paper, we propose a new way to estimate fog extinction at night using a classification of fog depending on the forward scattering. We show that a characterization of fog ...
Romain Gallen, Nicolas Hautière, Eric Dumon...
CORR
2011
Springer
214views Education» more  CORR 2011»
13 years 1 months ago
K-Median Clustering, Model-Based Compressive Sensing, and Sparse Recovery for Earth Mover Distance
We initiate the study of sparse recovery problems under the Earth-Mover Distance (EMD). Specifically, we design a distribution over m × n matrices A such that for any x, given A...
Piotr Indyk, Eric Price
SAC
2009
ACM
14 years 4 months ago
GPU-based computation of distance functions on road networks with applications
We present a GPU-based algorithm for computing discretized distance functions on road networks. As applications, we provide algorithms for computing discrete Order-k Network Voron...
Marta Fort, Joan Antoni Sellarès
KDD
1997
ACM
104views Data Mining» more  KDD 1997»
14 years 2 months ago
Proposal and Empirical Comparison of a Parallelizable Distance-Based Discretization Method
Many classification algorithms are designed to work with datasets that contain only discrete attributes. Discretization is the process of converting the continuous attributes of ...
Jesús Cerquides, Ramon López de M&aa...