525 search results - page 29 / 105 » Bidimensionality and geometric graphs |
AAAI
2012
11 years 11 months ago
2012
Transfer learning proves to be effective for leveraging labeled data in the source domain to build an accurate classifier in the target domain. The basic assumption behind transf...
CORR
2006
Springer
13 years 8 months ago
2006
Springer
We investigate a prototypical agent-based model, the Naming Game, on random geometric networks. The Naming Game is a minimal model, employing local communications that captures th...
COMGEO
2007
ACM
13 years 8 months ago
2007
ACM
In this paper we investigate the relations between spanners, weak spanners, and power spanners in RD for any dimension D and apply our results to topology control in wireless netw...
EJC
2010
13 years 8 months ago
2010
Let be a finite building (or, more generally, a thick spherical and locally finite building). The chamber graph G(), whose edges are the pairs of adjacent chambers in , is known t...
DCG
2010
13 years 9 months ago
2010
Consider a graph G with n vertices. In this paper we study geometric conditions for an n-tuple of points in Rd to admit a non-zero self stress with underlying graph G. We introduce...