Sciweavers

1717 search results - page 65 / 344
» On the analysis of the (1 1) memetic algorithm
Sort
View
FSTTCS
2004
Springer
15 years 6 months ago
Symbolic Reachability Analysis of Higher-Order Context-Free Processes
We consider the problem of symbolic reachability analysis of higher-order context-free processes. These models are generalizations of the context-free processes (also called BPA pr...
Ahmed Bouajjani, Antoine Meyer
INFOVIS
2003
IEEE
15 years 6 months ago
BARD: A visualization tool for biological sequence analysis
We present BARD (biological arc diagrams), a visualization tool for biological sequence analysis. The development of BARD began with the application of Wattenberg’s arc diagrams...
Rhazes Spell, Rachael Brady, Fred Dietrich
107
Voted
CORR
2007
Springer
105views Education» more  CORR 2007»
15 years 18 days ago
Relative-Error CUR Matrix Decompositions
Many data analysis applications deal with large matrices and involve approximating the matrix using a small number of “components.” Typically, these components are linear combi...
Petros Drineas, Michael W. Mahoney, S. Muthukrishn...
125
Voted
COMPGEOM
2003
ACM
15 years 5 months ago
Updating and constructing constrained delaunay and constrained regular triangulations by flips
I discuss algorithms based on bistellar flips for inserting and deleting constraining (d − 1)-facets in d-dimensional constrained Delaunay triangulations (CDTs) and weighted CD...
Jonathan Richard Shewchuk
103
Voted
ESOP
2010
Springer
15 years 4 months ago
CFA2: A Context-Free Approach to Control-Flow Analysis
Abstract. In a functional language, the dominant control-flow mechanism is function call and return. Most higher-order flow analyses, including k-CFA, do not handle call and retu...
Dimitrios Vardoulakis, Olin Shivers