1664 search results - page 221 / 333 » Distance labeling in graphs |
132
click to vote
ICASSP
2011
IEEE
14 years 9 months ago
2011
IEEE
Model-based methods for sequential organization in cochannel speech require pretrained speaker models and often prior knowledge of participating speakers. We propose an unsupervis...
200
click to vote
ICCS
2009
Springer
16 years 3 days ago
2009
Springer
Abstract. In knowledge bases, the open world assumption and the ability to express variables may lead to an answer redundancy problem. This problem occurs when the returned answers...
177
click to vote
PR
2007
15 years 5 months ago
2007
In this paper, we make use of the relationship between the Laplace–Beltrami operator and the graph Laplacian, for the purposes of embedding a graph onto a Riemannian manifold. T...
169
Voted
COMPGEOM
2003
ACM
15 years 10 months ago
2003
ACM
We introduce a new realistic input model for geometric graphs and nonconvex polyhedra. A geometric graph G is local if (1) the longest edge at every vertex v is only a constant fa...
165
click to vote
CVPR
2005
IEEE
16 years 7 months ago
2005
IEEE
In the last decades, a large family of algorithms supervised or unsupervised; stemming from statistic or geometry theory have been proposed to provide different solutions to the p...