Sciweavers

2370 search results - page 420 / 474
» The Characterization of Data-Accumulating Algorithms
Sort
View
ICALP
2004
Springer
15 years 3 months ago
The Black-Box Complexity of Nearest Neighbor Search
We define a natural notion of efficiency for approximate nearest-neighbor (ANN) search in general n-point metric spaces, namely the existence of a randomized algorithm which answ...
Robert Krauthgamer, James R. Lee
ICGI
2004
Springer
15 years 3 months ago
Identifying Clusters from Positive Data
The present work studies clustering from an abstract point of view and investigates its properties in the framework of inductive inference. Any class S considered is given by a hyp...
John Case, Sanjay Jain, Eric Martin, Arun Sharma, ...
LCTRTS
2004
Springer
15 years 3 months ago
Finding effective compilation sequences
Most modern compilers operate by applying a fixed, program-independent sequence of optimizations to all programs. Compiler writers choose a single “compilation sequence”, or ...
L. Almagor, Keith D. Cooper, Alexander Grosul, Tim...
CSB
2003
IEEE
130views Bioinformatics» more  CSB 2003»
15 years 3 months ago
Latent Structure Models for the Analysis of Gene Expression Data
Cluster methods have been successfully applied in gene expression data analysis to address tumor classification. By grouping tissue samples into homogeneous subsets, more systema...
Dong Hua, Dechang Chen, Xiuzhen Cheng, Abdou Youss...
PVG
2003
IEEE
138views Visualization» more  PVG 2003»
15 years 3 months ago
Sort-First, Distributed Memory Parallel Visualization and Rendering
While commodity computing and graphics hardware has increased in capacity and dropped in cost, it is still quite difficult to make effective use of such systems for general-purpos...
E. Wes Bethel, Greg Humphreys, Brian E. Paul, J. D...