Sciweavers

167 search results - page 6 / 34
» A New Lower Bound for A(17, 6, 6)
Sort
View
ISAAC
2009
Springer
98views Algorithms» more  ISAAC 2009»
14 years 1 months ago
New Bounds on the Average Distance from the Fermat-Weber Center of a Planar Convex Body
The Fermat-Weber center of a planar body Q is a point in the plane from which the average distance to the points in Q is minimal. We first show that for any convex body Q in the ...
Adrian Dumitrescu, Csaba D. Tóth
PERCOM
2010
ACM
13 years 5 months ago
encDPWS - message encoding of SOAP Web Services
—Current efforts in real world deployment of wireless sensor networks end up in the development of the 6LoWPAN protocols. While big industrial consortia develop new technologies,...
Guido Moritz, Dirk Timmermann, Regina Stoll, Frank...
IPL
2010
111views more  IPL 2010»
13 years 5 months ago
Connecting face hitting sets in planar graphs
We show that any face hitting set of size n of a connected planar graph with a minimum degree of at least 3 is contained in a connected subgraph of size 5n − 6. Furthermore we s...
Pascal Schweitzer, Patrick Schweitzer
DGCI
2009
Springer
14 years 1 months ago
Distances on Lozenge Tilings
In this paper, a structural property of the set of lozenge tilings of a 2n-gon is highlighted. We introduce a simple combinatorial value called Hamming-distance, which is a lower b...
Olivier Bodini, Thomas Fernique, Eric Rémil...
SODA
2004
ACM
160views Algorithms» more  SODA 2004»
13 years 8 months ago
Complexities for generalized models of self-assembly
In this paper, we extend Rothemund and Winfree's examination of the tile complexity of tile self-assembly [6]. They provided a lower bound of ( log N log log N ) on the tile ...
Gagan Aggarwal, Michael H. Goldwasser, Ming-Yang K...