Sciweavers

983 search results - page 22 / 197
» Negative-Weight Cycle Algorithms
Sort
View
ECCV
2008
Springer
16 years 1 months ago
Beyond Loose LP-Relaxations: Optimizing MRFs by Repairing Cycles
This paper presents a new MRF optimization algorithm, which is derived from Linear Programming and manages to go beyond current state-of-the-art techniques (such as those based on ...
Nikos Komodakis, Nikos Paragios
JSC
2007
84views more  JSC 2007»
14 years 11 months ago
Simplicial cycles and the computation of simplicial trees
We generalize the concept of a cycle from graphs to simplicial complexes. We show that a simplicial cycle is either a sequence of facets connected in the shape of a circle, or is ...
Massimo Caboara, Sara Faridi, Peter Selinger
TPDS
2010
109views more  TPDS 2010»
14 years 10 months ago
Minimal Sets of Turns for Breaking Cycles in Graphs Modeling Networks
Abstract—We propose an algorithm that provides for deadlockfree and livelock-free routing, in particular in wormhole routed networks. The proposed algorithm requires nearly minim...
Lev B. Levitin, Mark G. Karpovsky, Mehmet Mustafa
ISQED
2011
IEEE
240views Hardware» more  ISQED 2011»
14 years 2 months ago
Fast optimization of nano-CMOS mixed-signal circuits through accurate metamodeling
—Design optimization methodologies for AMS-SoCs with analog, digital, and mixed-signal portions have not received significant attention, due to their high complexity. In mixed-s...
Oleg Garitselov, Saraju P. Mohanty, Elias Kougiano...
CALC
2001
Springer
161views Cryptology» more  CALC 2001»
15 years 4 months ago
The Shortest Vector Problem in Lattices with Many Cycles
In this paper we investigate how the complexity of the shortest vector problem in a lattice Λ depends on the cycle structure of the additive group Zn /Λ. We give a proof that the...
Mårten Trolin