Sciweavers

930 search results - page 111 / 186
» Color Differential Structure
Sort
View
RSA
2008
123views more  RSA 2008»
15 years 2 months ago
Generating unlabeled connected cubic planar graphs uniformly at random
We present an expected polynomial time algorithm to generate an unlabeled connected cubic planar graph uniformly at random. We first consider rooted connected cubic planar graphs, ...
Manuel Bodirsky, Clemens Gröpl, Mihyun Kang
BMCBI
2011
14 years 9 months ago
Hierarchical graphs for rule-based modeling of biochemical systems
Background: In rule-based modeling, graphs are used to represent molecules: a colored vertex represents a component of a molecule, a vertex attribute represents the internal state...
Nathan W. Lemons, Bin Hu, William S. Hlavacek
CVPR
2003
IEEE
16 years 4 months ago
Probabilistic Tracking in Joint Feature-Spatial Spaces
In this paper we present a probabilistic framework for tracking regions based on their appearance. We exploit the feature-spatial distribution of a region representing an object a...
Ahmed M. Elgammal, Ramani Duraiswami, Larry S. Dav...
108
Voted
CVPR
2007
IEEE
16 years 4 months ago
Learning Conditional Random Fields for Stereo
State-of-the-art stereo vision algorithms utilize color changes as important cues for object boundaries. Most methods impose heuristic restrictions or priors on disparities, for e...
Daniel Scharstein, Chris Pal
122
Voted
ECCV
2006
Springer
16 years 4 months ago
Density Estimation Using Mixtures of Mixtures of Gaussians
In this paper we present a new density estimation algorithm using mixtures of mixtures of Gaussians. The new algorithm overcomes the limitations of the popular Expectation Maximiza...
Wael Abd-Almageed, Larry S. Davis