Sciweavers

171 search results - page 17 / 35
» Approximation of Discrete Phase-Type Distributions
Sort
View
MOBIHOC
2007
ACM
14 years 7 months ago
Complexity in geometric SINR
In this paper we study the problem of scheduling wireless links in the geometric SINR model, which explicitly uses the fact that nodes are distributed in the Euclidean plane. We p...
Olga Goussevskaia, Yvonne Anne Oswald, Roger Watte...
COMPGEOM
2009
ACM
14 years 1 months ago
Randomly removing g handles at once
It was shown in [11] that any orientable graph of genus g can be probabilistically embedded into a graph of genus g − 1 with constant distortion. Removing handles one by one giv...
Glencora Borradaile, James R. Lee, Anastasios Sidi...
SCANGIS
2003
13 years 8 months ago
On the Adequacy of GIS-Generated Weed Maps for Precision Farming
Discrete sampling data is used in several environmental studies to create maps in order to support decision-making processes. The decision maps represent an increasing importance i...
Matthias Backes, Lutz Plümer
PPOPP
2011
ACM
12 years 10 months ago
Compact data structure and scalable algorithms for the sparse grid technique
The sparse grid discretization technique enables a compressed representation of higher-dimensional functions. In its original form, it relies heavily on recursion and complex data...
Alin Florindor Murarasu, Josef Weidendorfer, Gerri...
COLT
2008
Springer
13 years 9 months ago
Finding Metric Structure in Information Theoretic Clustering
We study the problem of clustering discrete probability distributions with respect to the Kullback-Leibler (KL) divergence. This problem arises naturally in many applications. Our...
Kamalika Chaudhuri, Andrew McGregor