519 search results - page 55 / 104 » A New Approach to Strongly Polynomial Linear Programming |
104
click to vote
ICALP
2000
Springer
15 years 5 months ago
2000
Springer
We consider two natural generalizations of the notion of transversal to a finite hypergraph, arising in data-mining and machine learning, the so called multiple and partial transve...
110
click to vote
ICALP
1998
Springer
15 years 5 months ago
1998
Springer
An architecture is described for designing systems that acquire and manipulate large amounts of unsystematized, or so-called commonsense, knowledge. Its aim is to exploit to the fu...
121
click to vote
CCS
2006
ACM
15 years 5 months ago
2006
ACM
Attack graphs are important tools for analyzing security vulnerabilities in enterprise networks. Previous work on attack graphs has not provided an account of the scalability of t...
132
click to vote
ICLP
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. In this doctoral work we aim at developing a new approach to labelled semantics and equivalences for the Concurrent Constraint Programming (CCP) which will enable a broad...
113
click to vote
ISNN
2005
Springer
15 years 6 months ago
2005
Springer
Recently, a mathematical proof is obtained in (Liu, Chiu, Xu, 2004) on the so called one-bit-matching conjecture that all the sources can be separated as long as there is an one-to...