Sciweavers

340 search results - page 47 / 68
» Clustering with Lower Bound on Similarity
Sort
View
IGIS
1994
156views GIS» more  IGIS 1994»
15 years 1 months ago
Optimizing Spatial Data Structures For Static Data
During the last decade various spatial data structures have been designed and compared against each other, all of them re ecting a dynamic situation with ongoing object insertion a...
Lukas Bachmann, Bernd-Uwe Pagel, Hans-Werner Six
AHSWN
2008
92views more  AHSWN 2008»
14 years 9 months ago
The (k, l) Coredian Tree for Ad Hoc Networks
In this paper, we present a new efficient strategy for constructing a wireless tree network containing n nodes of diameter while satisfying the QoS requirements such as bandwidth...
Amit Dvir, Michael Segal
80
Voted
CORR
2008
Springer
118views Education» more  CORR 2008»
14 years 9 months ago
The price of certainty: "waterslide curves" and the gap to capacity
The classical problem of reliable point-to-point digital communication is to achieve a low probability of error while keeping the rate high and the total power consumption small. ...
Anant Sahai, Pulkit Grover
IPL
2006
141views more  IPL 2006»
14 years 9 months ago
Perfectly Reliable Message Transmission
We study the problem of Perfectly Reliable Message Transmission (PRMT) and Perfectly Secure Message Transmission (PSMT) between two nodes S and R in an undirected synchronous netw...
Arvind Narayanan, K. Srinathan, C. Pandu Rangan
ICDCSW
2009
IEEE
15 years 4 months ago
Performance Tradeoffs Among Percolation-Based Broadcast Protocols in Wireless Sensor Networks
Broadcast of information in wireless sensor networks is an important operation, e.g., for code updates, queries, membership information, etc. In this paper, we analyze and experim...
Vijay Raman, Indranil Gupta