Sciweavers

202 search results - page 32 / 41
» Cycle Cover with Short Cycles
Sort
View
WSC
2001
13 years 9 months ago
On improving the performance of simulation-based algorithms for average reward processes with application to network pricing
We address performance issues associated with simulationbased algorithms for optimizing Markov reward processes. Specifically, we are concerned with algorithms that exploit the re...
Enrique Campos-Náñez, Stephen D. Pat...
ECCV
2010
Springer
13 years 8 months ago
Activities as Time Series of Human Postures
Abstract. This paper presents an exemplar-based approach to detecting and localizing human actions, such as running, cycling, and swinging, in realistic videos with dynamic backgro...
William Brendel, Sinisa Todorovic
CN
2010
88views more  CN 2010»
13 years 7 months ago
Two-link failure protection in WDM mesh networks with p-cycles
In WDM networks, it is important to protect connections against link failures due to the high bandwidth provided by a fiber link. Although many p-cycle based schemes have been pro...
Taiming Feng, Long Long, Ahmed E. Kamal, Lu Ruan
COMBINATORICA
2008
84views more  COMBINATORICA 2008»
13 years 7 months ago
Parity check matrices and product representations of squares
Let NF(n, k, r) denote the maximum number of columns in an n-row matrix with entries in a finite field F in which each column has at most r nonzero entries and every k columns are...
Assaf Naor, Jacques Verstraëte
CORR
2007
Springer
128views Education» more  CORR 2007»
13 years 7 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