1067 search results - page 150 / 214 » Probabilistic regular graphs |
94
Voted
STOC
2005
ACM
16 years 26 days ago
2005
ACM
We show that every weighted connected graph G contains as a subgraph a spanning tree into which the edges of G can be embedded with average stretch O log2 n log log n . Moreover, w...
115
Voted
ICDCS
2006
IEEE
15 years 6 months ago
2006
IEEE
In this paper, we study distributed approximation algorithms for fault-tolerant clustering in wireless ad hoc and sensor networks. A k-fold dominating set of a graph G = (V, E) is...
118
Voted
ICRA
2005
IEEE
15 years 6 months ago
2005
IEEE
— We consider the problem of inferring sensor positions and a topological (i.e. qualitative) map of an environment given a set of cameras with non-overlapping fields of view. In...
105
Voted
SSPR
1998
Springer
15 years 4 months ago
1998
Springer
This paper presents a probabilistic similarity measure for object recognition from large libraries of line-patterns. We commence from a structural pattern representation which use...
127
Voted
CIKM
2008
Springer
15 years 2 months ago
2008
Springer
An expert finding system allows a user to type a simple text query and retrieve names and contact information of individuals that possess the expertise expressed in the query. Thi...