Sciweavers

1521 search results - page 14 / 305
» The Stardinates - Visualizing Highly Structured Data
Sort
View
130
Voted
CVPR
2010
IEEE
15 years 24 days ago
Transform Coding for Fast Approximate Nearest Neighbor Search in High Dimensions
We examine the problem of large scale nearest neighbor search in high dimensional spaces and propose a new approach based on the close relationship between nearest neighbor search...
Jonathan Brandt
ADC
2003
Springer
123views Database» more  ADC 2003»
15 years 7 months ago
A Distance-Based Packing Method for High Dimensional Data
Minkowski-sum cost model indicates that balanced data partitioning is not beneficial for high dimensional data. Thus we study several unbalanced partitioning methods and propose ...
Tae-wan Kim, Ki-Joune Li

Publication
141views
14 years 2 hour ago
Measures of Diversity for Populations and Distances Between Individuals with Highly Reorganizable Genomes
In this paper we address the problem of defining a measure of diversity for a population of individuals whose genome can be subjected to major reorganizations during the evolution...
Claudio Mattiussi, Markus Waibel, Dario Floreano
ICS
2000
Tsinghua U.
15 years 5 months ago
Push vs. pull: data movement for linked data structures
As the performance gap between the CPU and main memory continues to grow, techniques to hide memory latency are essential to deliver a high performance computer system. Prefetchin...
Chia-Lin Yang, Alvin R. Lebeck
WDAS
2000
15 years 3 months ago
Scalable Distributed Data Structures: A Survey
This paper reviews literature on scalable data structures for searching in a distributed computing environment. Starting with a system where one server manages a file of a given s...
Adriano Di Pasquale, Enrico Nardelli