736 search results - page 34 / 148 » Distinguishing geometric graphs |
119
Voted
EJC
2010
15 years 23 days 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...
88
Voted
DCG
2010
15 years 23 days 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...
97
Voted
CORR
2006
Springer
15 years 21 days ago
2006
Springer
Gossip algorithms for aggregation have recently received significant attention for sensor network applications because of their simplicity and robustness in noisy and uncertain en...
109
Voted
ECCV
2010
Springer
15 years 5 months ago
2010
Springer
In this paper, we propose a method for detecting humans in imagery taken from a UAV. This is a challenging problem due to small number of pixels on target, which makes it more di�...
70
Voted
ISAAC
2003
Springer
15 years 5 months ago
2003
Springer
Fixed-angle polygonal chains in 3D serve as an interesting model of protein backbones. Here we consider such chains produced inside a “machine” modeled crudely as a cone, and e...