Sciweavers

11211 search results - page 162 / 2243
» Data Structures
Sort
View
MPC
2004
Springer
94views Mathematics» more  MPC 2004»
15 years 11 months ago
Streaming Representation-Changers
Unfolds generate data structures, and folds consume them. A hylomorphism is a fold after an unfold, generating then consuming a virtual data structure. A metamorphism is the opposi...
Jeremy Gibbons
ASPDAC
2009
ACM
109views Hardware» more  ASPDAC 2009»
15 years 7 months ago
Soft lists: a native index structure for NOR-flash-based embedded devices
Efficient data indexing is significant to embedded devices, because both CPU cycles and energy are very precious resources. Soft lists, a new index structure for embedded devices w...
Li-Pin Chang, Chen-Hui Hsu
UAI
2000
15 years 7 months ago
The Anchors Hierarchy: Using the Triangle Inequality to Survive High Dimensional Data
This paper is about the use of metric data structures in high-dimensionalor non-Euclidean space to permit cached sufficientstatisticsaccelerationsof learning algorithms. It has re...
Andrew W. Moore
ICDE
2005
IEEE
133views Database» more  ICDE 2005»
16 years 7 months ago
Efficient Inverted Lists and Query Algorithms for Structured Value Ranking in Update-Intensive Relational Databases
We propose a new ranking paradigm for relational databases called Structured Value Ranking (SVR). SVR uses structured data values to score (rank) the results of keyword search que...
Lin Guo, Jayavel Shanmugasundaram, Kevin S. Beyer,...
ICPR
2002
IEEE
15 years 11 months ago
Exploratory Analysis of Point Proximity in Subspaces
We consider clustering as computation of a structure of proximity relationships within a data set in a feature space or its subspaces. We propose a data structure to represent suc...
Tin Kam Ho