Sciweavers

3006 search results - page 513 / 602
» Dimensionality reduction and generalization
Sort
View
COMPGEOM
2011
ACM
14 years 7 months ago
An output-sensitive algorithm for persistent homology
In this paper, we present the first output-sensitive algorithm to compute the persistence diagram of a filtered simplicial complex. For any Γ > 0, it returns only those homo...
Chao Chen, Michael Kerber
EUROCRYPT
2011
Springer
14 years 7 months ago
Faster Explicit Formulas for Computing Pairings over Ordinary Curves
Abstract. We describe efficient formulas for computing pairings on ordinary elliptic curves over prime fields. First, we generalize lazy reduction techniques, previously considere...
Diego F. Aranha, Koray Karabina, Patrick Longa, Ca...
PERCOM
2011
ACM
14 years 6 months ago
A robust dead-reckoning pedestrian tracking system with low cost sensors
—The emergence of personal mobile device with low cost sensors, such as accelerometer and digital compass, has made dead-reckoning (DR) an attractive choice for indoor pedestrian...
Yunye Jin, Hong-Song Toh, Wee-Seng Soh, Wai-Choong...
165
Voted
SIGMETRICS
2011
ACM
270views Hardware» more  SIGMETRICS 2011»
14 years 6 months ago
Scalable monitoring via threshold compression in a large operational 3G network
Threshold-based performance monitoring in large 3G networks is very challenging for two main factors: large network scale and dynamics in both time and spatial domains. There exis...
Suk-Bok Lee, Dan Pei, MohammadTaghi Hajiaghayi, Io...
SIGMOD
2011
ACM
206views Database» more  SIGMOD 2011»
14 years 6 months ago
Sampling based algorithms for quantile computation in sensor networks
We study the problem of computing approximate quantiles in large-scale sensor networks communication-efficiently, a problem previously studied by Greenwald and Khana [12] and Shri...
Zengfeng Huang, Lu Wang, Ke Yi, Yunhao Liu