Sciweavers

945 search results - page 80 / 189
» Incremental Branching Programs
Sort
View
ESOP
2004
Springer
14 years 2 months ago
From Constraints to Finite Automata to Filtering Algorithms
Abstract. We introduce an approach to designing filtering algorithms by derivation from finite automata operating on constraint signatures. We illustrate this approach in two cas...
Mats Carlsson, Nicolas Beldiceanu
SNPD
2003
13 years 10 months ago
Incomplete Information Processing for Optimization of Distributed Applications
This paper focuses on non-strict processing, optimization, and partial evaluation of MPI programs which use incremental data structures (ISs). We describe the design and implement...
Alfredo Cristóbal-Salas, Andrei Tchernykh, ...
ICDE
2012
IEEE
205views Database» more  ICDE 2012»
11 years 11 months ago
Optimizing Statistical Information Extraction Programs over Evolving Text
—Statistical information extraction (IE) programs are increasingly used to build real-world IE systems such as Alibaba, CiteSeer, Kylin, and YAGO. Current statistical IE approach...
Fei Chen, Xixuan Feng, Christopher Re, Min Wang
OOPSLA
2005
Springer
14 years 2 months ago
Constructing a metacircular Virtual machine in an exploratory programming environment
Can virtual machine developers benefit from religiously observing the principles more often embraced for exploratory programming? To find out, we are concurrently constructing two...
David Ungar, Adam Spitz, Alex Ausch
ICSM
2005
IEEE
14 years 2 months ago
Reducing Build Time through Precompilations for Evolving Large Software
Large-scale legacy programs take long time to compile, thereby hampering productivity. This paper presents algorithms that reduce compilation time by analyzing syntactic dependenc...
Yijun Yu, Homayoun Dayani-Fard, John Mylopoulos, P...