519 search results - page 34 / 104 » A New Approach to Strongly Polynomial Linear Programming |
107
click to vote
DAC
1997
ACM
15 years 5 months ago
1997
ACM
The concept of improving the timing behavior of a circuit by relocating flip-flops is called retiming and was first presented by Leiserson and Saxe. The ASTRA algorithm propose...
110
click to vote
EUROCRYPT
2003
Springer
15 years 6 months ago
2003
Springer
A classical construction of stream ciphers is to combine several LFSRs and a highly non-linear Boolean function f. Their security is usually analysed in terms of correlation attack...
100
Voted
CTCS
1989
Springer
15 years 5 months ago
1989
Springer
We introduce the notion of a candidate for “multiple valued universal constructions” and define stable functors (which generalise functors with left adjoints) in terms of fac...
120
click to vote
MICS
2008
14 years 12 months ago
2008
We present an approach to studying the community structures of networks by using linear programming (LP). Starting with a network in terms of (a) a collection of nodes and (b) a co...
105
click to vote
AAAI
2004
15 years 2 months ago
2004
The relation between answer set programming (ASP) and propositional satisfiability (SAT) is at the center of many research papers, partly because of the tremendous performance boo...