736 search results - page 54 / 148 » A dynamic data structure for approximate range searching |
HIPC
2007
Springer
14 years 20 days ago
2007
Springer
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
ACIVS
2006
Springer
14 years 2 months ago
2006
Springer
The nearest neighbor (NN) classifier is well suited for generic object recognition. However, it requires storing the complete training data, and classification time is linear in ...
SIGMOD
2001
ACM
14 years 9 months ago
2001
ACM
Similarity search in large time series databases has attracted much research interest recently. It is a difficult problem because of the typically high dimensionality of the data....
TMI
1998
13 years 8 months ago
1998
—In this paper a method for the objective assessment of burn scars is proposed. The quantitative measures developed in this research provide an objective way to calculate elastic...
SAC
2004
ACM
14 years 2 months ago
2004
ACM
Field-based coordination is a very promising approach for a wide range of application scenarios in modern dynamic networks. To implement such an approach, one can rely on distribu...