Sciweavers

73 search results - page 14 / 15
» A type theory for probability density functions
Sort
View
MOBICOM
2004
ACM
13 years 10 months ago
On k-coverage in a mostly sleeping sensor network
Sensor networks are often desired to last many times longer than the active lifetime of individual sensors. This is usually achieved by putting sensors to sleep for most of their ...
Santosh Kumar, Ten-Hwang Lai, József Balogh
COMPGEOM
2011
ACM
12 years 8 months ago
Comparing distributions and shapes using the kernel distance
Starting with a similarity function between objects, it is possible to define a distance metric (the kernel distance) on pairs of objects, and more generally on probability distr...
Sarang C. Joshi, Raj Varma Kommaraju, Jeff M. Phil...
FOCS
2000
IEEE
13 years 9 months ago
Stable Distributions, Pseudorandom Generators, Embeddings and Data Stream Computation
In this article, we show several results obtained by combining the use of stable distributions with pseudorandom generators for bounded space. In particular: —We show that, for a...
Piotr Indyk
CIKM
2000
Springer
13 years 9 months ago
Dimensionality Reduction and Similarity Computation by Inner Product Approximations
—As databases increasingly integrate different types of information such as multimedia, spatial, time-series, and scientific data, it becomes necessary to support efficient retri...
Ömer Egecioglu, Hakan Ferhatosmanoglu
ICDE
2006
IEEE
194views Database» more  ICDE 2006»
14 years 6 months ago
The Gauss-Tree: Efficient Object Identification in Databases of Probabilistic Feature Vectors
In applications of biometric databases the typical task is to identify individuals according to features which are not exactly known. Reasons for this inexactness are varying meas...
Alexey Pryakhin, Christian Böhm, Matthias Sch...