519 search results - page 99 / 104 » A New Approach to Strongly Polynomial Linear Programming |
CP
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. In recent years, dynamic local search (DLS) clause weighting algorithms have emerged as the local search state-of-the-art for solving propositional satisfiability proble...
ALT
2003
Springer
15 years 3 months ago
2003
Springer
Abstract. A crucial problem in machine learning is to choose an appropriate representation of data, in a way that emphasizes the relations we are interested in. In many cases this ...
135
click to vote
ICALP
2009
Springer
15 years 11 months ago
2009
Springer
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...
102
click to vote
ICS
2010
Tsinghua U.
15 years 9 months ago
2010
Tsinghua U.
: Design of secure systems can often be expressed as ensuring that some property is maintained at every step of a distributed computation among mutually-untrusting parties. Special...
115
click to vote
BMCBI
2011
14 years 3 months ago
2011
Background: Using microarray and sequencing platforms, a large number of copy number variations (CNVs) have been identified in humans. In practice, because our human genome is a d...