Sciweavers

11214 search results - page 179 / 2243
» Just-in-time data structures
Sort
View
CORR
1999
Springer
222views Education» more  CORR 1999»
13 years 10 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
CIDR
2003
125views Algorithms» more  CIDR 2003»
13 years 11 months ago
Crossing the Structure Chasm
It has frequently been observed that most of the world’s data lies outside database systems. The reason is that database systems focus on structured data, leaving the unstructur...
Alon Y. Halevy, Oren Etzioni, AnHai Doan, Zachary ...
WETICE
2009
IEEE
14 years 5 months ago
Search Optimizations in Structured Peer-to-Peer Systems
Abstract—DHT systems are structured overlay networks capable of using P2P resources as a scalable platform for very large data storage applications. However, their efficiency ex...
Nuno Lopes, Carlos Baquero
PARMA
2004
114views Database» more  PARMA 2004»
13 years 11 months ago
PatManQL: A Language to Manipulate Patterns and Data in Hierarchical Catalogs
Hierarchical structures and catalogs is a way to organize and enrich semantically the available information in the Web. From simple tree-like structures with syntactic constraints ...
Panagiotis Bouros, Theodore Dalamagas, Timos K. Se...
KDD
2007
ACM
161views Data Mining» more  KDD 2007»
14 years 10 months ago
Discovering the hidden structure of house prices with a non-parametric latent manifold model
Sumit Chopra, Trivikraman Thampy, John Leahy, Andr...