Sciweavers

945 search results - page 132 / 189
» Graph Types
Sort
View
SIAMCOMP
2010
125views more  SIAMCOMP 2010»
14 years 9 months ago
Approximating Steiner Networks with Node-Weights
The (undirected) Steiner Network problem is: given a graph = ( , ) with edge/node-weights and edge-connectivity requirements { ( , ) : , }, find a minimumweight subgraph of conta...
Zeev Nutov
230
Voted
PLDI
2009
ACM
16 years 3 months ago
Sharing classes between families
Class sharing is a new language mechanism for building extensible software systems. Recent work has separately explored two different kinds of extensibility: first, family inherit...
Xin Qi, Andrew C. Myers
112
Voted
SAT
2009
Springer
109views Hardware» more  SAT 2009»
15 years 9 months ago
A Compact Representation for Syntactic Dependencies in QBFs
Different quantifier types in Quantified Boolean Formulae (QBF) introduce variable dependencies which have to be taken into consideration when deciding satisfiability of a QBF....
Florian Lonsing, Armin Biere
129
Voted
CSB
2005
IEEE
133views Bioinformatics» more  CSB 2005»
15 years 8 months ago
Biological Pathway Prediction from Multiple Data Sources Using Iterative Bayesian Updating
There is a diversity of functional genomics data, such as gene expression data from microarray experiments, phenotypic data from gene deletion experiments, protein-protein interac...
Corey Powell, Joshua M. Stuart
132
Voted
CHI
1996
ACM
15 years 6 months ago
Silk from a Sow's Ear: Extracting Usable Structures from the Web
In its current implementation, the World-Wide Web lacks much of the explicit structure and strong typing found in many closed hypertext systems. While this property has directly f...
Peter Pirolli, James E. Pitkow, Ramana Rao