Sciweavers

2004 search results - page 36 / 401
» Sampling from large graphs
Sort
View
ANOR
2006
59views more  ANOR 2006»
14 years 11 months ago
The empirical behavior of sampling methods for stochastic programming
Abstract. We investigate the quality of solutions obtained from sample-average approximations to two-stage stochastic linear programs with recourse. We use a recently developed sof...
Jeff Linderoth, Alexander Shapiro, Stephen Wright
88
Voted
CODES
2004
IEEE
15 years 3 months ago
Hardware synthesis from coarse-grained dataflow specification for fast HW/SW cosynthesis
This paper concerns automatic hardware synthesis from data flow graph (DFG) specification for fast HW/SW cosynthesis. A node in DFG represents a coarse grain block such as FIR and...
Hyunuk Jung, Soonhoi Ha
CVPR
2011
IEEE
14 years 7 months ago
Tracking 3D Human Pose with Large Root Node Uncertainty
Representing articulated objects as a graphical model has gained much popularity in recent years, often the root node of the graph describes the global position and orientation of...
Ben Daubney, Xianghua Xie
CVPR
2005
IEEE
16 years 1 months ago
Mixture Trees for Modeling and Fast Conditional Sampling with Applications in Vision and Graphics
We introduce mixture trees, a tree-based data-structure for modeling joint probability densities using a greedy hierarchical density estimation scheme. We show that the mixture tr...
Frank Dellaert, Vivek Kwatra, Sang Min Oh
VTC
2006
IEEE
15 years 5 months ago
On the Peak Factor of Sampled and Continuous Signals
Abstract: The peak factor of a continuous digitallymodulated signal is often analyzed from its samples taken at the Nyquist rate. This, however, may involve a significant error. It...
Sergey Loyka, François Gagnon