Sciweavers

3008 search results - page 579 / 602
» Independence in connected graphs
Sort
View
VLDB
2004
ACM
163views Database» more  VLDB 2004»
15 years 11 months ago
Compressing Large Boolean Matrices using Reordering Techniques
Large boolean matrices are a basic representational unit in a variety of applications, with some notable examples being interactive visualization systems, mining large graph struc...
David S. Johnson, Shankar Krishnan, Jatin Chhugani...
ILP
2003
Springer
15 years 11 months ago
Mining Model Trees: A Multi-relational Approach
In many data mining tools that support regression tasks, training data are stored in a single table containing both the target field (dependent variable) and the attributes (indepe...
Annalisa Appice, Michelangelo Ceci, Donato Malerba
ESA
2001
Springer
105views Algorithms» more  ESA 2001»
15 years 10 months ago
SNPs Problems, Complexity, and Algorithms
Abstract. Single nucleotide polymorphisms (SNPs) are the most frequent form of human genetic variation. They are of fundamental importance for a variety of applications including m...
Giuseppe Lancia, Vineet Bafna, Sorin Istrail, Ross...
ESOP
2001
Springer
15 years 10 months ago
On the Complexity of Constant Propagation
Constant propagation (CP) is one of the most widely used optimizations in practice (cf. [9]). Intuitively, it addresses the problem of statically detecting whether an expression al...
Markus Müller-Olm, Oliver Rüthing
HYBRID
1998
Springer
15 years 10 months ago
Formal Verification of Safety-Critical Hybrid Systems
This paper investigates how formal techniques can be used for the analysis and verification of hybrid systems [1,5,7,16] -- systems involving both discrete and continuous behavior....
Carolos Livadas, Nancy A. Lynch