Sciweavers

968 search results - page 193 / 194
» A faster implementation of APlace
Sort
View
98
Voted
LISP
2007
74views more  LISP 2007»
14 years 11 months ago
Improving the lazy Krivine machine
Krivine presents the K machine, which produces weak head normal form results. Sestoft introduces several call-by-need variants of the K machine that implement result sharing via pu...
Daniel P. Friedman, Abdulaziz Ghuloum, Jeremy G. S...
CAD
2004
Springer
14 years 11 months ago
Control point adjustment for B-spline curve approximation
Pottmann et al. propose an iterative optimization scheme for approximating a target curve with a B-spline curve based on square distance minimization, or SDM. The main advantage o...
Huaiping Yang, Wenping Wang, Jia-Guang Sun
CCE
2004
14 years 11 months ago
Improving convergence of the stochastic decomposition algorithm by using an efficient sampling technique
This work focuses on the basic stochastic decomposition (SD) algorithm of Higle and Sen [J.L. Higle, S. Sen, Stochastic Decomposition, Kluwer Academic Publishers, 1996] for two-st...
José María Ponce-Ortega, Vicente Ric...
115
Voted
BMCBI
2002
120views more  BMCBI 2002»
14 years 11 months ago
tacg - a grep for DNA
Background: Pattern matching is the core of bioinformatics; it is used in database searching, restriction enzyme mapping, and finding open reading frames. It is done repeatedly ov...
Harry Mangalam
120
Voted
HPCA
2012
IEEE
13 years 7 months ago
SCD: A scalable coherence directory with flexible sharer set encoding
Large-scale CMPs with hundreds of cores require a directory-based protocol to maintain cache coherence. However, previously proposed coherence directories are hard to scale beyond...
Daniel Sanchez, Christos Kozyrakis