Sciweavers

273 search results - page 23 / 55
» Can Pure Cutting Plane Algorithms Work
Sort
View
DISOPT
2008
91views more  DISOPT 2008»
13 years 7 months ago
Partition inequalities for capacitated survivable network design based on directed p-cycles
We study the design of capacitated survivable networks using directed p-cycles. A p-cycle is a cycle with at least three arcs, used for rerouting disrupted flow during edge failur...
Alper Atamtürk, Deepak Rajan
INFOCOM
2010
IEEE
13 years 5 months ago
Network Reliability With Geographically Correlated Failures
Abstract--Fiber-optic networks are vulnerable to natural disasters, such as tornadoes or earthquakes, as well as to physical failures, such as an anchor cutting underwater fiber ca...
Sebastian Neumayer, Eytan Modiano
PRESENCE
1998
123views more  PRESENCE 1998»
13 years 7 months ago
A Real-Time Algorithm for Accurate Collision Detection for Deformable Polyhedral Objects
We propose an accurate collision detection algorithm for use in virtual reality applications. The algorithm works for three-dimensional graphical environments where multiple objec...
Yoshifumi Kitamura, Andrew Smith, Haruo Takemura, ...
EMMCVPR
2009
Springer
14 years 2 months ago
Multi-label Moves for MRFs with Truncated Convex Priors
Optimization with graph cuts became very popular in recent years. As more applications rely on graph cuts, different energy functions are being employed. Recent evaluation of optim...
Olga Veksler
CVPR
2009
IEEE
15 years 2 months ago
Shape Analysis with Conformal Invariants for Multiply Connected Domains and its Application to Analyzing Brain Morphology
All surfaces can be classified by the conformal equivalence relation. Conformal invariants, which are shape indices that can be defined intrinsically on a surface, may be used t...
Paul M. Thompson, Tony F. Chan, Xianfeng Gu, Yalin...