Sciweavers

6365 search results - page 346 / 1273
» Fast Local Computation Algorithms
Sort
View
FOCS
2006
IEEE
16 years 24 days ago
Near-Optimal Hashing Algorithms for Approximate Nearest Neighbor in High Dimensions
We present an algorithm for the c-approximate nearest neighbor problem in a d-dimensional Euclidean space, achieving query time of O(dn1/c2 +o(1) ) and space O(dn + n1+1/c2 +o(1) ...
Alexandr Andoni, Piotr Indyk
IPPS
2006
IEEE
16 years 23 days ago
A combined genetic-neural algorithm for mobility management
This work presents a new approach to solve the location management problem by using the location areas approach. A combination of a genetic algorithm and the Hopfield neural netwo...
Javid Taheri, Albert Y. Zomaya
ICDCS
1997
IEEE
15 years 11 months ago
Concurrency Control and View Notification Algorithms for Collaborative Replicated Objects
—This paper describes algorithms for implementing a high-level programming model for synchronous distributed groupware applications. In this model, several application data objec...
Robert E. Strom, Guruduth Banavar, Kevan Miller, A...
IEEECGIV
2009
IEEE
16 years 1 months ago
Surface Mesh Segmentation Using Local Geometry
—We present a novel algorithm to segment a 3D surface mesh into visually meaningful regions. Our approach is based on an analysis of the local geometry of vertices. In particular...
Chansophea Chuon, Sumanta Guha
CORR
2010
Springer
165views Education» more  CORR 2010»
15 years 5 months ago
Monte Carlo Methods for Top-k Personalized PageRank Lists and Name Disambiguation
We study a problem of quick detection of top-k Personalized PageRank lists. This problem has a number of important applications such as finding local cuts in large graphs, estima...
Konstantin Avrachenkov, Nelly Litvak, Danil Nemiro...