Sciweavers

2638 search results - page 93 / 528
» Random Geometric Complexes
Sort
View
APPROX
2004
Springer
108views Algorithms» more  APPROX 2004»
15 years 10 months ago
Estimating Frequency Moments of Data Streams Using Random Linear Combinations
The problem of estimating the kth frequency moment Fk for any nonnegative k, over a data stream by looking at the items exactly once as they arrive, was considered in a seminal pap...
Sumit Ganguly
ICPR
2008
IEEE
15 years 11 months ago
Fingerprint orientation analysis with topological modeling
This paper proposes to characterize the fingerprint orientation using a novel topological representation, which transforms the orientation field into a map composed of a set of ...
Zujun Hou, Jun Li, Hwee Keong Lam, Tai Pang Chen, ...
CHI
1993
ACM
15 years 8 months ago
Synthetic synesthesia: mixing sound with color
An interface is described that uses color and spatial relations to provide an intuitive interface for sound manipulation. A simple geometric shape, called the Geometric Sound Mixe...
Kristinn R. Thórisson, Karen Donoghue
135
Voted
DCOSS
2010
Springer
15 years 7 months ago
Fast Decentralized Averaging via Multi-scale Gossip
Abstract. We are interested in the problem of computing the average consensus in a distributed fashion on random geometric graphs. We describe a new algorithm called Multi-scale Go...
Konstantinos I. Tsianos, Michael G. Rabbat
JACM
2010
135views more  JACM 2010»
15 years 2 months ago
A dynamic data structure for 3-D convex hulls and 2-D nearest neighbor queries
We present a fully dynamic randomized data structure that can answer queries about the convex hull of a set of n points in three dimensions, where insertions take O(log3 n) expect...
Timothy M. Chan