Sciweavers

132 search results - page 21 / 27
» A Simple Test for Interval Graphs
Sort
View
COR
2006
97views more  COR 2006»
14 years 10 months ago
Evaluating the performance of cost-based discretization versus entropy- and error-based discretization
Discretization is defined as the process that divides continuous numeric values into intervals of discrete categorical values. In this article, the concept of cost-based discretiz...
Davy Janssens, Tom Brijs, Koen Vanhoof, Geert Wets
ICML
2007
IEEE
15 years 10 months ago
Learning distance function by coding similarity
We consider the problem of learning a similarity function from a set of positive equivalence constraints, i.e. 'similar' point pairs. We define the similarity in informa...
Aharon Bar-Hillel, Daphna Weinshall
RECOMB
2007
Springer
15 years 10 months ago
QNet: A Tool for Querying Protein Interaction Networks
Molecular interaction databases can be used to study the evolution of molecular pathways across species. Querying such pathways is a challenging computational problem, and recent e...
Banu Dost, Tomer Shlomi, Nitin Gupta 0002, Eytan R...
PASTE
2005
ACM
15 years 3 months ago
Static control-flow analysis for reverse engineering of UML sequence diagrams
UML sequence diagrams are commonly used to represent the interactions among collaborating objects. Reverse-engineered sequence diagrams are constructed from existing code, and hav...
Atanas Rountev, Olga Volgin, Miriam Reddoch
DM
2006
128views more  DM 2006»
14 years 10 months ago
Non-trivial t-designs without repeated blocks exist for all t
A computer package is being developed at Bayreuth for the generation and investigation of discrete structures. The package is a C and C++ class library of powerful algorithms endow...
Luc Teirlinck