Sciweavers

11784 search results - page 597 / 2357
» Interpolation for data structures
Sort
View
CORR
1999
Springer
222views Education» more  CORR 1999»
15 years 6 months ago
Analysis of approximate nearest neighbor searching with clustered point sets
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
Songrit Maneewongvatana, David M. Mount

Book
407views
17 years 3 months ago
Java Gently
"Java Gently teaches the reader how to program and how to do it in the best possible style in Java. In the process, it details the fundamental structures of the Java 2 languag...
Judy Bishop
ICIP
2009
IEEE
16 years 8 months ago
Pet Image Reconstruction Using Prior Information From Ct Or Mri
Functional properties of living tissues appear in PET, whereas structural information at significantly higher resolution and better image quality is provided by other modalities, ...
ICML
2002
IEEE
16 years 8 months ago
Multi-Instance Kernels
Learning from structured data is becoming increasingly important. However, most prior work on kernel methods has focused on learning from attribute-value data. Only recently, rese...
Adam Kowalczyk, Alex J. Smola, Peter A. Flach, Tho...
IPTPS
2003
Springer
16 years 11 days ago
SOMO: Self-Organized Metadata Overlay for Resource Management in P2P DHT
– In this paper, we first describe the concept of data overlay, which is a mechanism to implement arbitrary data structure on top of any structured P2P DHT. With this ion, we dev...
Zheng Zhang, Shuming Shi, Jing Zhu