983 search results - page 77 / 197 » Negative-Weight Cycle Algorithms |
121
click to vote
COMBINATORICS
2007
15 years 3 months ago
2007
A simple 2-matching in a graph is a subgraph all of whose nodes have degree 1 or 2. A simple 2-matching is called k-restricted if every connected component has > k edges. We co...
132
click to vote
CORR
1999
Springer
15 years 2 months ago
1999
Springer
Abstract: Systematic testing of object-oriented software turned out to be much more complex than testing conventional software. Especially the highly incremental and iterative deve...
132
click to vote
DM
1999
15 years 2 months ago
1999
We examine powers of Hamiltonian paths and cycles as well as Hamiltonian (power) completion problems in several highly structured graph classes. For threshold graphs we give effic...
TCAD
1998
15 years 2 months ago
1998
—This paper introduces a novel optimization paradigm for increasing the throughput of digital systems. The basic idea consists of transforming fixed-latency units into variable-...
234
click to vote
CIKM
2011
Springer
14 years 3 months ago
2011
Springer
Word prediction performed by language models has an important role in many tasks as e.g. word sense disambiguation, speech recognition, hand-writing recognition, query spelling an...