Sciweavers

736 search results - page 33 / 148
» Distinguishing geometric graphs
Sort
View
DAM
2008
102views more  DAM 2008»
13 years 8 months ago
On the computational complexity of partial covers of Theta graphs
By use of elementary geometric arguments we prove the existence of a special integral solution of a certain system of linear equations. The existence of such a solution yields the...
Jirí Fiala, Jan Kratochvíl, Attila P...
CORR
2006
Springer
95views Education» more  CORR 2006»
13 years 8 months ago
Naming Games in Spatially-Embedded Random Networks
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...
Qiming Lu, Gyorgy Korniss, Boleslaw K. Szymanski
COCO
2004
Springer
93views Algorithms» more  COCO 2004»
14 years 1 months ago
Lower Bounds for Testing Bipartiteness in Dense Graphs
We consider the problem of testing bipartiteness in the adjacency matrix model. The best known algorithm, due to Alon and Krivelevich, distinguishes between bipartite graphs and g...
Andrej Bogdanov, Luca Trevisan
PAMI
2010
274views more  PAMI 2010»
13 years 3 months ago
3D Face Recognition Using Isogeodesic Stripes
In this paper, we present a novel approach to 3D face matching that shows high effectiveness in distinguishing facial differences between distinct individuals from differences indu...
Stefano Berretti, Alberto Del Bimbo, Pietro Pala
COMGEO
2007
ACM
13 years 8 months ago
Geometric spanners with applications in wireless networks
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...
Christian Schindelhauer, Klaus Volbert, Martin Zie...