Sciweavers

2721 search results - page 19 / 545
» An experimental analysis of Lemke-Howson algorithm
Sort
View
PASTE
2004
ACM
15 years 3 months ago
Evaluating the imprecision of static analysis
This work discusses two non-traditional approaches for evaluating the imprecision of static analysis. The approaches are based on proofs of feasibility or infeasibility that are c...
Atanas Rountev, Scott Kagan, Michael Gibas
ER
2005
Springer
200views Database» more  ER 2005»
15 years 3 months ago
How to Tame a Very Large ER Diagram (Using Link Analysis and Force-Directed Drawing Algorithms)
Abstract. Understanding a large schema without the assistance of persons already familiar with it (and its associated applications), is a hard and very time consuming task that occ...
Yannis Tzitzikas, Jean-Luc Hainaut
94
Voted
BMCBI
2006
101views more  BMCBI 2006»
14 years 9 months ago
SynTReN: a generator of synthetic gene expression data for design and analysis of structure learning algorithms
Background: The development of algorithms to infer the structure of gene regulatory networks based on expression data is an important subject in bioinformatics research. Validatio...
Tim Van den Bulcke, Koen Van Leemput, Bart Naudts,...
VDA
2010
166views Visualization» more  VDA 2010»
14 years 7 months ago
Critical region analysis of scalar fields in arbitrary dimensions
The exploration of multidimensional scalar fields is commonly based on the knowledge of the topology of their isosurfaces. The latter is established through the analysis of critic...
Madjid Allili, Marc Ethier, Tomasz Kaczynski
CSUR
1999
74views more  CSUR 1999»
14 years 9 months ago
Algorithm Engineering
Algorithm Engineering is concerned with the design, analysis, implementation, tuning, debugging and experimental evaluation of computer programs for solving algorithmic problems. ...
Giuseppe Cattaneo, Giuseppe F. Italiano