Sciweavers

983 search results - page 165 / 197
» Negative-Weight Cycle Algorithms
Sort
View
APLAS
2010
ACM
13 years 10 months ago
Amortized Resource Analysis with Polymorphic Recursion and Partial Big-Step Operational Semantics
This paper studies the problem of statically determining upper bounds on the resource consumption of first-order functional programs. A previous work approached the problem with an...
Jan Hoffmann 0002, Martin Hofmann
DISOPT
2008
91views more  DISOPT 2008»
13 years 10 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
IPL
2008
68views more  IPL 2008»
13 years 10 months ago
The hub number of a graph
A hub set in a graph G is a set U V (G) such that any two vertices outside U are connected by a path whose internal vertices lie in U. We prove that h(G) hc(G) c(G) h(G) + 1, ...
Tracy Grauman, Stephen G. Hartke, Adam Jobson, Bil...
IJCV
2006
119views more  IJCV 2006»
13 years 10 months ago
Hand Motion Gesture Frequency Properties and Multimodal Discourse Analysis
Gesture and speech are co-expressive and complementary channels of a single human language system. While speech carries the major load of symbolic presentation, gesture provides th...
Yingen Xiong, Francis K. H. Quek
CORR
2007
Springer
128views Education» more  CORR 2007»
13 years 9 months ago
Equivalence of LP Relaxation and Max-Product for Weighted Matching in General Graphs
— Max-product belief propagation is a local, iterative algorithm to find the mode/MAP estimate of a probability distribution. While it has been successfully employed in a wide v...
Sujay Sanghavi