Sciweavers

174 search results - page 22 / 35
» Algorithms for center and Tverberg points
Sort
View
EMMCVPR
2003
Springer
13 years 12 months ago
Asymptotic Characterization of Log-Likelihood Maximization Based Algorithms and Applications
The asymptotic distribution of estimates that are based on a sub-optimal search for the maximum of the log-likelihood function is considered. In particular, estimation schemes that...
Doron Blatt, Alfred O. Hero
ADHOC
2006
97views more  ADHOC 2006»
13 years 6 months ago
A probabilistic algorithm for efficient and robust data propagation in wireless sensor networks
We study the problem of data propagation in sensor networks, comprised of a large number of very small and low-cost nodes, capable of sensing, communicating and computing. The dis...
Ioannis Chatzigiannakis, Tassos Dimitriou, Sotiris...
ICDE
2007
IEEE
182views Database» more  ICDE 2007»
14 years 8 months ago
DIKNN: An Itinerary-based KNN Query Processing Algorithm for Mobile Sensor Networks
Current approaches to K Nearest Neighbor (KNN) search in mobile sensor networks require certain kind of indexing support. This index could be either a centralized spatial index or...
Shan-Hung Wu, Kun-Ta Chuang, Chung-Min Chen, Ming-...
STOC
2003
ACM
117views Algorithms» more  STOC 2003»
14 years 7 months ago
Distinct distances in three and higher dimensions
Improving an old result of Clarkson et al., we show that the number of distinct distances determined by a set P of n points in three-dimensional space is (n77/141) = (n0.546 ), fo...
Boris Aronov, János Pach, Micha Sharir, G&a...
SIGMETRICS
2011
ACM
237views Hardware» more  SIGMETRICS 2011»
12 years 9 months ago
Analysis of DCTCP: stability, convergence, and fairness
Cloud computing, social networking and information networks (for search, news feeds, etc) are driving interest in the deployment of large data centers. TCP is the dominant Layer 3...
Mohammad Alizadeh, Adel Javanmard, Balaji Prabhaka...