Sciweavers

2570 search results - page 198 / 514
» Fast Algorithms For The Computation Of Ranklets
Sort
View
SMA
2008
ACM
396views Solid Modeling» more  SMA 2008»
15 years 4 months ago
Fast mesh segmentation using random walks
3D mesh models are now widely available for use in various applications. The demand for automatic model analysis and understanding is ever increasing. Mesh segmentation is an impo...
Yu-Kun Lai, Shi-Min Hu, Ralph R. Martin, Paul L. R...
TSMC
2008
138views more  TSMC 2008»
15 years 4 months ago
Fast Diagnosis With Sensors of Uncertain Quality
This correspondence presents an approach to the detection and isolation of component failures in large-scale systems. In the case of sensors that report at rates of 1 Hz or less, t...
Ozgur Erdinc, Craig Brideau, Peter Willett, Thiaga...
FOCS
2006
IEEE
15 years 10 months 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
15 years 10 months 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 8 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...