Sciweavers

350 search results - page 21 / 70
» Branching Programs for Tree Evaluation
Sort
View
IBPRIA
2007
Springer
14 years 1 months ago
A Tabular Pruning Rule in Tree-Based Fast Nearest Neighbor Search Algorithms
Some fast nearest neighbor search (NNS) algorithms using metric properties have appeared in the last years for reducing computational cost. Depending on the structure used to store...
José Oncina, Franck Thollard, Eva Gó...
LISP
1998
88views more  LISP 1998»
13 years 7 months ago
Visualizing Evaluation in Scheme
Abstract. RainbowScheme is a visual stepping system that presents Scheme program’s runtime state using icons, colored environment trees, and colored Scheme code. A Scheme program...
Sho-Huan Simon Tung
POPL
2010
ACM
14 years 4 months ago
Continuity Analysis of Programs
We present an analysis to automatically determine if a program represents a continuous function, or equivalently, if infinitesimal changes to its inputs can only cause infinitesim...
Swarat Chaudhuri, Sumit Gulwani, Roberto Lublinerm...
JCB
2000
137views more  JCB 2000»
13 years 7 months ago
NOTUNG: A Program for Dating Gene Duplications and Optimizing Gene Family Trees
Large scale gene duplication is a major force driving the evolution of genetic functional innovation. Whole genome duplications are widely believed to have played an important rol...
Kevin Chen, Dannie Durand, Martin Farach-Colton
CVPR
2005
IEEE
14 years 9 months ago
Stereo Correspondence by Dynamic Programming on a Tree
Dynamic programming on a scanline is one of the oldest and still popular methods for stereo correspondence. While efficient, its performance is far from the state of the art becau...
Olga Veksler