Sciweavers

335 search results - page 21 / 67
» How to Use Spanning Trees to Navigate in Graphs
Sort
View
RTA
2010
Springer
15 years 7 months ago
Underspecified computation of normal forms
We consider the problem of computing, out of a set C of trees and a rewrite system R, those trees in C that cannot be rewritten into a tree in C. We solve this problem for sets of ...
Alexander Koller, Stefan Thater
NIPS
2004
15 years 7 months ago
Proximity Graphs for Clustering and Manifold Learning
Many machine learning algorithms for clustering or dimensionality reduction take as input a cloud of points in Euclidean space, and construct a graph with the input data points as...
Miguel Á. Carreira-Perpiñán, ...
CORR
2007
Springer
122views Education» more  CORR 2007»
15 years 6 months ago
How to Complete a Doubling Metric
In recent years, considerable advances have been made in the study of properties of metric spaces in terms of their doubling dimension. This line of research has not only enhanced...
Anupam Gupta, Kunal Talwar
CORR
2008
Springer
174views Education» more  CORR 2008»
15 years 6 months ago
Bounded Budget Connection (BBC) Games or How to make friends and influence people, on a budget
Motivated by applications in social networks, peer-to-peer and overlay networks, we define and study the Bounded Budget Connection (BBC) game - we have a collection of n players o...
Nikolaos Laoutaris, Laura J. Poplawski, Rajmohan R...
MDM
2009
Springer
115views Communications» more  MDM 2009»
16 years 17 days ago
Supporting Contexts for Indoor Navigation Using a Multilayered Space Model
Indoor navigation highly depends on context and requires flexible data structures to support the many use cases and configurations. For example, an indoor navigation system must c...
Thomas Becker, Claus Nagel, Thomas H. Kolbe