Sciweavers

4137 search results - page 482 / 828
» On the number of matchings of a tree
Sort
View
TC
2010
15 years 5 months ago
Scalable Node-Level Computation Kernels for Parallel Exact Inference
—In this paper, we investigate data parallelism in exact inference with respect to arbitrary junction trees. Exact inference is a key problem in exploring probabilistic graphical...
Yinglong Xia, Viktor K. Prasanna
JGT
2011
109views more  JGT 2011»
15 years 1 months ago
Total weight choosability of graphs
A graph G = (V, E) is called (k, k )-total weight choosable if the following holds: For any total list assignment L which assigns to each vertex x a set L(x) of k real numbers, an...
Tsai-Lien Wong, Xuding Zhu
CVPR
2008
IEEE
16 years 8 months ago
Learning and using taxonomies for fast visual categorization
The computational complexity of current visual categorization algorithms scales linearly at best with the number of categories. The goal of classifying simultaneously Ncat = 104 -...
Gregory Griffin, Darya Perona
ECCV
2008
Springer
16 years 8 months ago
Surface Visibility Probabilities in 3D Cluttered Scenes
Many methods for 3D reconstruction in computer vision rely on probability models, for example, Bayesian reasoning. Here we introduce a probability model of surface visibilities in ...
Michael S. Langer
VIS
2004
IEEE
168views Visualization» more  VIS 2004»
16 years 8 months ago
On the Role of Color in the Perception of Motion in Animated Visualizations
Although luminance contrast plays a predominant role in motion perception, significant additional effects are introduced by chromatic contrasts. In this paper, relevant results fr...
Daniel Weiskopf