Sciweavers

666 search results - page 110 / 134
» New primal-dual algorithms for Steiner tree problems
Sort
View
PODS
2007
ACM
159views Database» more  PODS 2007»
14 years 9 months ago
Generalized hypertree decompositions: np-hardness and tractable variants
The generalized hypertree width GHW(H) of a hypergraph H is a measure of its cyclicity. Classes of conjunctive queries or constraint satisfaction problems whose associated hypergr...
Georg Gottlob, Thomas Schwentick, Zoltán Mi...
JHSN
2007
165views more  JHSN 2007»
13 years 9 months ago
Slack allocation techniques for intra-path load balancing
: Network resource provisioning techniques need to perform both inter-path and intra-path load balancing to maximize the network’s resource usage efficiency while supporting end...
Kartik Gopalan, Tzi-cker Chiueh, Yow-Jian Lin
DLOG
2007
13 years 11 months ago
Blocking Automata for PSPACE DLs
In Description Logics (DLs), both tableau-based and automata-based algorithms are frequently used to show decidability and complexity results for basic inference problems such as c...
Franz Baader, Jan Hladik, Rafael Peñaloza
TCBB
2010
144views more  TCBB 2010»
13 years 3 months ago
Querying Graphs in Protein-Protein Interactions Networks Using Feedback Vertex Set
Recent techniques increase rapidly the amount of our knowledge on interactions between proteins. The interpretation of these new information depends on our ability to retrieve kno...
Guillaume Blin, Florian Sikora, Stéphane Vi...
RECOMB
2005
Springer
14 years 9 months ago
Constructing a Smallest Refining Galled Phylogenetic Network
Reticulation events occur frequently in many types of species. Therefore, to develop accurate methods for reconstructing phylogenetic networks in order to describe evolutionary his...
Trinh N. D. Huynh, Jesper Jansson, Nguyen Bao Nguy...