Sciweavers

2446 search results - page 457 / 490
» Characterizing the Performance of
Sort
View
ICPP
2000
IEEE
14 years 2 months ago
A Scalable Parallel Subspace Clustering Algorithm for Massive Data Sets
Clustering is a data mining problem which finds dense regions in a sparse multi-dimensional data set. The attribute values and ranges of these regions characterize the clusters. ...
Harsha S. Nagesh, Sanjay Goil, Alok N. Choudhary
INFOCOM
2000
IEEE
14 years 2 months ago
Quantifying the Benefit of Configurability in Circuit-Switched WDM Ring Networks
—In a reconfigurable network, lightpath connections can be dynamically changed to reflect changes in traffic conditions. This paper characterizes the gain in traffic capacity tha...
Brett Schein, Eytan Modiano
MOBICOM
2000
ACM
14 years 2 months ago
Caching strategies in on-demand routing protocols for wireless ad hoc networks
An on-demand routing protocol for wireless ad hoc networks is one that searches for and attempts to discover a route to some destination node only when a sending node originates a...
Yih-Chun Hu, David B. Johnson
CRYPTO
2000
Springer
134views Cryptology» more  CRYPTO 2000»
14 years 2 months ago
Taming the Adversary
Abstract. While there is a great deal of sophistication in modern cryptology, simple (and simplistic) explanations of cryptography remain useful and perhaps necessary. Many of the ...
Martín Abadi
DNA
2000
Springer
132views Bioinformatics» more  DNA 2000»
14 years 2 months ago
Engineered Communications for Microbial Robotics
Multicellular organisms create complex patterned structures from identical, unreliable components. Learning how to engineer such robust behavior is important to both an improved un...
Ron Weiss, Thomas F. Knight Jr.