Sciweavers

4698 search results - page 116 / 940
» Making Functionality More General
Sort
View
CPM
2010
Springer
146views Combinatorics» more  CPM 2010»
15 years 8 months ago
Parallel and Distributed Compressed Indexes
Abstract. We study parallel and distributed compressed indexes. Compressed indexes are a new and functional way to index text strings. They exploit the compressibility of the text,...
Luís M. S. Russo, Gonzalo Navarro, Arlindo ...
IJCNN
2006
IEEE
15 years 9 months ago
Automated Model Selection (AMS) on Finite Mixtures: A Theoretical Analysis
— From the Bayesian Ying-Yang (BYY) harmony learning theory, a harmony function has been developed for finite mixtures with a novel property that its maximization can make model...
Jinwen Ma
ASPLOS
2008
ACM
15 years 5 months ago
Tapping into the fountain of CPUs: on operating system support for programmable devices
The constant race for faster and more powerful CPUs is drawing to a close. No longer is it feasible to significantly increase the speed of the CPU without paying a crushing penalt...
Yaron Weinsberg, Danny Dolev, Tal Anker, Muli Ben-...
105
Voted
FSTTCS
1993
Springer
15 years 7 months ago
Induce-Statements and Induce-Expressions: Constructs for Inductive Programming
A for-loop is somewhat similar to an inductive argument. Just as the truth of a proposition P(n + 1) depends on the truth of P(n), the correctness of iteration n+1 of a for-loop de...
Theodore S. Norvell
ICFP
2003
ACM
16 years 3 months ago
Optimistic evaluation: an adaptive evaluation strategy for non-strict programs
Lazy programs are beautiful, but they are slow because they build many thunks. Simple measurements show that most of these thunks are unnecessary: they are in fact always evaluate...
Robert Ennals, Simon L. Peyton Jones