3328 search results - page 538 / 666 » Topological Quantum Computation |
139
click to vote
MOBIHOC
2002
ACM
16 years 3 months ago
2002
ACM
Due to hidden terminals and a dynamic topology, contention among stations in an ad-hoc network is not homogeneous. Some stations are at a disadvantage in opportunity of access to ...
148
Voted
MOBIHOC
2001
ACM
16 years 3 months ago
2001
ACM
We propose a new routing graph, the Restricted Delaunay Graph (RDG), for ad hoc networks. Combined with a node clustering algorithm, RDG can be used as an underlying graph for geo...
128
click to vote
EWSN
2008
Springer
16 years 3 months ago
2008
Springer
We consider the problem of determining the transmission power assignment that maximizes the lifetime of a data-gathering wireless sensor network with stationary nodes and static tr...
155
click to vote
EWSN
2004
Springer
16 years 3 months ago
2004
Springer
Directed diffusion is a prominent example of data-centric routing based on application layer data and purely local interactions. In its functioning it relies heavily on network-wid...
149
Voted
EVOW
2010
Springer
15 years 10 months ago
2010
Springer
We propose a novel distance based method for phylogenetic tree reconstruction. Our method is based on a conceptual clustering method that extends the well-known decision tree learn...