Sciweavers

658 search results - page 46 / 132
» Lower bounds for sorting networks
Sort
View
WADS
2009
Springer
274views Algorithms» more  WADS 2009»
14 years 2 months ago
Approximating Transitive Reductions for Directed Networks
Abstract. We consider minimum equivalent digraph problem, its maximum optimization variant and some non-trivial extensions of these two types of problems motivated by biological an...
Piotr Berman, Bhaskar DasGupta, Marek Karpinski
ICC
2007
IEEE
14 years 2 months ago
A New Cooperative Strategy for Deafness Prevention in Directional Ad Hoc Networks
— We propose the novel concept of cooperation for deafness prevention in directional antenna ad hoc networks, along with a low-complexity multiuser detector specialised for these...
Andrea Munari, Francesco Rossetto, Michele Zorzi
WDAG
2010
Springer
183views Algorithms» more  WDAG 2010»
13 years 6 months ago
What Is the Use of Collision Detection (in Wireless Networks)?
We show that the asymptotic gain in the time complexity when using collision detection depends heavily on the task by investigating three prominent problems for wireless networks,...
Johannes Schneider, Roger Wattenhofer
WG
1998
Springer
13 years 12 months ago
Graphs with Bounded Induced Distance
In this work we introduce the class of graphs with bounded induced distance of order k, (BID(k) for short). A graph G belongs to BID(k) if the distance between any two nodes in ev...
Serafino Cicerone, Gabriele Di Stefano
EWSN
2007
Springer
14 years 7 months ago
Efficient Routing from Multiple Sources to Multiple Sinks in Wireless Sensor Networks
Initial deployments of wireless sensor networks (WSNs) were based on a many-to-one communication paradigm, where a single sink collects data from a number of data sources. Recently...
Pietro Ciciriello, Luca Mottola, Gian Pietro Picco