Sciweavers

1605 search results - page 152 / 321
» On Partitional Labelings of Graphs
Sort
View
164
Voted
CVPR
2012
IEEE
13 years 3 months ago
Graph cuts optimization for multi-limb human segmentation in depth maps
We present a generic framework for object segmentation using depth maps based on Random Forest and Graph-cuts theory, and apply it to the segmentation of human limbs in depth maps...
Antonio Hernández-Vela, Nadezhda Zlateva, A...
SIROCCO
2007
15 years 2 months ago
Fast Periodic Graph Exploration with Constant Memory
We consider the problem of periodic exploration of all nodes in undirected graphs by using a nite state automaton called later a robot. The robot, using a constant number of state...
Leszek Gasieniec, Ralf Klasing, Russell A. Martin,...
109
Voted
ALENEX
2007
102views Algorithms» more  ALENEX 2007»
15 years 2 months ago
Linearization: Locally Self-Stabilizing Sorting in Graphs
We consider the problem of designing a distributed algorithm that, given an arbitrary connected graph G of nodes with unique labels, converts G into a sorted list of nodes. This a...
Melih Onus, Andréa W. Richa, Christian Sche...
SIGIR
2008
ACM
15 years 18 days ago
Learning query intent from regularized click graphs
This work presents the use of click graphs in improving query intent classifiers, which are critical if vertical search and general-purpose search services are to be offered in a ...
Xiao Li, Ye-Yi Wang, Alex Acero
100
Voted
ICA
2007
Springer
15 years 4 months ago
Text Clustering on Latent Thematic Spaces: Variants, Strengths and Weaknesses
Deriving a thematically meaningful partition of an unlabeled document corpus is a challenging task. In this context, the use of document representations based on latent thematic ge...
Xavier Sevillano, Germán Cobo, Francesc Al&...