Sciweavers

845 search results - page 60 / 169
» Connecting Many-Sorted Theories
Sort
View
MOBIHOC
2009
ACM
15 years 6 months ago
Low-connectivity and full-coverage three dimensional wireless sensor networks
Low-connectivity and full-coverage three dimensional Wireless Sensor Networks (WSNs) have many real-world applications. By low connectivity, we mean there are at least k disjoint ...
Xiaole Bai, Chuanlin Zhang, Dong Xuan, Jin Teng, W...
DCG
2008
82views more  DCG 2008»
14 years 12 months ago
Schnyder Woods and Orthogonal Surfaces
In this paper we study connections between planar graphs, Schnyder woods, and orthogonal surfaces. Schnyder woods and the face counting approach have important applications in gra...
Stefan Felsner, Florian Zickfeld
ECCC
2000
158views more  ECCC 2000»
14 years 11 months ago
On the Computational Power of Winner-Take-All
This article initiates a rigorous theoretical analysis of the computational power of circuits that employ modules for computing winner-take-all. Computational models that involve ...
Wolfgang Maass
ADCM
1998
133views more  ADCM 1998»
14 years 11 months ago
Numerical exploitation of symmetry in integral equations
: Linear integral operators describing physical problems on symmetric domains often are equivariant, which means that they commute with certain symmetries, i.e., with a group of or...
Eugene L. Allgower, Kurt Georg
DM
1998
95views more  DM 1998»
14 years 11 months ago
An Euler-type formula for median graphs
Let G be a median graph on n vertices and m edges and let k be the number of equivalence classes of the Djokovi´c’s relation Θ defined on the edge-set of G. Then 2n − m −...
Sandi Klavzar, Henry Martyn Mulder, Riste Skrekovs...