Sciweavers

2254 search results - page 325 / 451
» Computing the minimal covering set
Sort
View
MOBIHOC
2002
ACM
16 years 5 months ago
On the minimum node degree and connectivity of a wireless multihop network
This paper investigates two fundamental characteristics of a wireless multihop network: its minimum node degree and its k?connectivity. Both topology attributes depend on the spat...
Christian Bettstetter
SDM
2009
SIAM
176views Data Mining» more  SDM 2009»
16 years 3 months ago
Discovery of Geospatial Discriminating Patterns from Remote Sensing Datasets.
Large amounts of remotely sensed data calls for data mining techniques to fully utilize their rich information content. In this paper, we study new means of discovery and summariz...
Wei Ding 0003, Tomasz F. Stepinski, Josue Salazar
FDL
2008
IEEE
16 years 17 days ago
Contradiction Analysis for Constraint-based Random Simulation
Constraint-based random simulation is state-of-the-art in verification of multi-million gate industrial designs. This method is based on stimulus generation by constraint solving...
Daniel Große, Robert Wille, Robert Siegmund,...
INFOCOM
2008
IEEE
16 years 15 days ago
The Inframetric Model for the Internet
—A large amount of algorithms has recently been designed for the Internet under the assumption that the distance defined by the round-trip delay (RTT) is a metric. Moreover, man...
Pierre Fraigniaud, Emmanuelle Lebhar, Laurent Vien...
P2P
2008
IEEE
102views Communications» more  P2P 2008»
16 years 15 days ago
Free-Riding, Fairness, and Firewalls in P2P File-Sharing
Peer-to-peer file-sharing networks depend on peers uploading data to each other. Some peers, called free-riders, will not upload data unless there is an incentive to do so. Algor...
Jacob Jan-David Mol, Johan A. Pouwelse, Dick H. J....