Sciweavers

4541 search results - page 202 / 909
» Cache-Oblivious Algorithms and Data Structures
Sort
View
STACS
2005
Springer
15 years 8 months ago
Approximate Range Mode and Range Median Queries
Abstract. We consider data structures and algorithms for preprocessing a labelled list of length n so that, for any given indices i and j we can answer queries of the form: What is...
Prosenjit Bose, Evangelos Kranakis, Pat Morin, Yih...
SIGPLAN
2002
15 years 2 months ago
Template meta-programming for Haskell
We propose a new extension to the purely functional programming language Haskell that supports compile-time meta-programming. The purpose of the system is to support the algorithm...
Tim Sheard, Simon L. Peyton Jones
SIGSOFT
2010
ACM
15 years 1 months ago
Representation dependence testing using program inversion
The definition of a data structure may permit many different concrete representations of the same logical content. A (client) program that accepts such a data structure as input i...
Aditya Kanade, Rajeev Alur, Sriram K. Rajamani, Ga...
ICDM
2003
IEEE
100views Data Mining» more  ICDM 2003»
15 years 8 months ago
Tractable Group Detection on Large Link Data Sets
Discovering underlying structure from co-occurrence data is an important task in a variety of fields, including: insurance, intelligence, criminal investigation, epidemiology, hu...
Jeremy Kubica, Andrew W. Moore, Jeff G. Schneider
PR
2006
116views more  PR 2006»
15 years 3 months ago
Shared farthest neighbor approach to clustering of high dimensionality, low cardinality data
Clustering algorithms are routinely used in biomedical disciplines, and are a basic tool in bioinformatics. Depending on the task at hand, there are two most popular options, the ...
Stefano Rovetta, Francesco Masulli