Sciweavers

1664 search results - page 159 / 333
» Distance labeling in graphs
Sort
View
COMPGEOM
2004
ACM
15 years 10 months ago
Low-dimensional embedding with extra information
A frequently arising problem in computational geometry is when a physical structure, such as an ad-hoc wireless sensor network or a protein backbone, can measure local information...
Mihai Badoiu, Erik D. Demaine, Mohammad Taghi Haji...
TCS
2008
15 years 4 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»
15 years 6 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
16 years 5 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
16 years 5 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...