280 search results - page 28 / 56 » Using Determining Sets to Distinguish Kneser Graphs |
108
click to vote
IPCO
2008
15 years 1 months ago
2008
Abstract. Determining the integrality gap of the bidirected cut relaxation for the metric Steiner tree problem, and exploiting it algorithmically, is a long-standing open problem. ...
117
click to vote
MLDM
2007
Springer
15 years 5 months ago
2007
Springer
Recursive Feature Elimination (RFE) combined with feature ranking is an effective technique for eliminating irrelevant features when the feature dimension is large, but it is diffi...
122
click to vote
ALGORITHMICA
2008
14 years 12 months ago
2008
Grid computing systems pool together the resources of many workstations to create a virtual computing reservoir. Users can "draw" resources using a pay-as-you-go model, c...
101
Voted
CAV
2010
Springer
2010
Springer
Universal Causality Graphs: A Precise Happens-Before Model for Detecting Bugs in Concurrent Programs
15 years 1 months ago
Triggering errors in concurrent programs is a notoriously difficult task. A key reason for this is the behavioral complexity resulting from the large number of interleavings of op...
102
click to vote
AMAI
2004
Springer
15 years 5 months ago
2004
Springer
Learning the parameters (conditional and marginal probabilities) from a data set is a common method of building a belief network. Consider the situation where we have known graph s...