Sciweavers

1605 search results - page 178 / 321
» On Partitional Labelings of Graphs
Sort
View
TCS
2008
13 years 10 months ago
Setting port numbers for fast graph exploration
We consider the problem of periodic graph exploration by a finite automaton in which an automaton with a constant number of states has to explore all unknown anonymous graphs of a...
David Ilcinkas
LEGE
2004
103views Education» more  LEGE 2004»
13 years 11 months ago
Structuring and merging Distributed Content
A flexible approach for structuring and merging distributed learning object is presented. At the basis of this approach there is a formal representation of a learning object, call...
Luca Stefanutti, Dietrich Albert, Cord Hockemeyer
ICML
2007
IEEE
14 years 11 months ago
Efficient inference with cardinality-based clique potentials
Many collective labeling tasks require inference on graphical models where the clique potentials depend only on the number of nodes that get a particular label. We design efficien...
Rahul Gupta, Ajit A. Diwan, Sunita Sarawagi
ICML
2007
IEEE
14 years 11 months ago
Transductive regression piloted by inter-manifold relations
In this paper, we present a novel semisupervised regression algorithm working on multiclass data that may lie on multiple manifolds. Unlike conventional manifold regression algori...
Huan Wang, Shuicheng Yan, Thomas S. Huang, Jianzhu...
ICDM
2008
IEEE
109views Data Mining» more  ICDM 2008»
14 years 4 months ago
Learning by Propagability
In this paper, we present a novel feature extraction framework, called learning by propagability. The whole learning process is driven by the philosophy that the data labels and o...
Bingbing Ni, Shuicheng Yan, Ashraf A. Kassim, Loon...