Sciweavers

3268 search results - page 597 / 654
» The hub number of a graph
Sort
View
TCS
2010
14 years 6 months ago
An optimal algorithm to generate rooted trivalent diagrams and rooted triangular maps
Abstract. A trivalent diagram is a connected, two-colored bipartite graph (parallel edges allowed but not loops) such that every black vertex is of degree 1 or 3 and every white ve...
Samuel Alexandre Vidal
TIP
2010
129views more  TIP 2010»
14 years 6 months ago
Image Segmentation by MAP-ML Estimations
Abstract--Image segmentation plays an important role in computer vision and image analysis. In this paper, image segmentation is formulated as a labeling problem under a probabilit...
Shifeng Chen, Liangliang Cao, Yueming Wang, Jianzh...
CORR
2010
Springer
175views Education» more  CORR 2010»
14 years 6 months ago
On the Combinatorial Multi-Armed Bandit Problem with Markovian Rewards
We consider a combinatorial generalization of the classical multi-armed bandit problem that is defined as follows. There is a given bipartite graph of M users and N M resources. F...
Yi Gai, Bhaskar Krishnamachari, Mingyan Liu
ICASSP
2011
IEEE
14 years 3 months ago
A novel algorithm for occlusions and perspective effects using a 3D object process
In this paper, we introduce a novel probabilistic approach to handle occlusions and perspective effects. The proposed method is an object based method embedded in a marked point p...
Ahmed Gamal-Eldin, Xavier Descombes, Josiane Zerub...
ICCV
2011
IEEE
13 years 12 months ago
Discriminative Learning of Relaxed Hierarchy for Large-scale Visual Recognition
In the real visual world, the number of categories a classifier needs to discriminate is on the order of hundreds or thousands. For example, the SUN dataset [24] contains 899 sce...
Tianshi Gao, Daphne Koller