535 search results - page 56 / 107 » Generalized Version Space Trees |
IJFCS
1998
14 years 11 months ago
1998
Directed acyclic graphs (dags) are often used to model circuits. Path lengths in such dags represent circuit delays. In the vertex splitting problem, the objective is to determine...
119
click to vote
NAR
2011
14 years 2 months ago
2011
We updated the plant transcription factor (TF) database to version 2.0 (PlantTFDB 2.0, http:// planttfdb.cbi.pku.edu.cn) which contains 53 319 putative TFs predicted from 49 speci...
106
click to vote
TPHOL
2005
IEEE
15 years 5 months ago
2005
IEEE
The nominal approach to abstract syntax deals with the issues of bound names and α-equivalence by considering constructions and properties that are invariant with respect to permu...
117
click to vote
WG
1995
Springer
15 years 3 months ago
1995
Springer
We propose an O(n4) algorithm to build the modular decomposition tree of hypergraphs of dimension 3 and show how this algorithm can be generalized to compute in O(n3k−5) time th...
111
click to vote
ESA
2008
Springer
15 years 1 months ago
2008
Springer
For several NP-hard network design problems, the best known approximation algorithms are remarkably simple randomized algorithms called Sample-Augment algorithms in [11]. The algor...