Sciweavers

56 search results - page 9 / 12
» Distributed Computation of All Node Replacements of a Minimu...
Sort
View
MOBIHOC
2007
ACM
14 years 7 months ago
Bounds for the capacity of wireless multihop networks imposed by topology and demand
Existing work on the capacity of wireless networks predominantly considers homogeneous random networks with random work load. The most relevant bounds on the network capacity, e.g...
Alireza Keshavarz-Haddad, Rudolf H. Riedi
ADHOCNOW
2007
Springer
14 years 1 months ago
Routing in Wireless Networks with Position Trees
Sensor networks are wireless adhoc networks where all the nodes cooperate for routing messages in the absence of a fixed infrastructure. Non-flooding, guaranteed delivery routing...
Edgar Chávez, Nathalie Mitton, Hécto...
ISPA
2005
Springer
14 years 26 days ago
Ethernet as a Lossless Deadlock Free System Area Network
The way conventional Ethernet is used today differs in two aspects from how dedicated system area networks are used. Firstly, dedicated system area networks are lossless and only d...
Sven-Arne Reinemo, Tor Skeie
INFOCOM
2007
IEEE
14 years 1 months ago
Distributed Low-Complexity Maximum-Throughput Scheduling for Wireless Backhaul Networks
— We introduce a low-complexity distributed slotted MAC protocol that can support all feasible arrival rates in a wireless backhaul network (WBN). For arbitrary wireless networks...
Abdul Kader Kabbani, Theodoros Salonidis, Edward W...
VLDB
1998
ACM
120views Database» more  VLDB 1998»
13 years 11 months ago
PUBLIC: A Decision Tree Classifier that Integrates Building and Pruning
Classification is an important problem in data mining. Given a database of records, each with a class label, a classifier generates a concise and meaningful description for each c...
Rajeev Rastogi, Kyuseok Shim