2503 search results - page 208 / 501 » A study of 3-arc graphs |
178
click to vote
DCOSS
2009
Springer
15 years 11 months ago
2009
Springer
We study the problem of computing a family of connected dominating sets in wireless sensor networks (WSN) in a distributed manner. A WSN is modelled as a unit disk graph G = (V, E)...
160
click to vote
GD
2001
Springer
15 years 11 months ago
2001
Springer
This paper studies the problem of computing an orthogonal drawing of a graph with labels along the edges. Labels are not allowed to overlap with each other or with edges to which t...
149
click to vote
ICPR
2000
IEEE
15 years 11 months ago
2000
IEEE
The statistical pattern recognition is a promising framework for text-to-text translation. However, a natural extension to speech-input translation is not straightforward. In this...
156
click to vote
CORR
2002
Springer
15 years 6 months ago
2002
Springer
We show that the hitting time of the discrete time quantum random walk on the n-bit hypercube from one corner to its opposite is polynomial in n. This gives the first exponential ...
162
click to vote
ENTCS
2002
15 years 6 months ago
2002
We study the partial algebra of typed terms with an associative commutative and idempotent operator (typed AC-terms). The originality lies in the representation of the typing poli...