Sciweavers

672 search results - page 111 / 135
» Lower-stretch spanning trees
Sort
View
STOC
2001
ACM
134views Algorithms» more  STOC 2001»
14 years 7 months ago
Fully-dynamic min-cut
We show that we can maintain up to polylogarithmic edge connectivity for a fully-dynamic graph in ~O(pn) time per edge insertion or deletion. Within logarithmic factors, this matc...
Mikkel Thorup
ICDE
2010
IEEE
260views Database» more  ICDE 2010»
14 years 7 months ago
Anonymizing Weighted Social Network Graphs
The increasing popularity of social networks has initiated a fertile research area in information extraction and data mining. Although such analysis can facilitate better understan...
Sudipto Das, Ömer Egecioglu, Amr El Abbadi
PERCOM
2006
ACM
14 years 7 months ago
A Simulation-Based Study on the Throughput Capacity of Topology Control in CSMA/CA Networks
Although it is commonly assumed that the use of topology control can improve the throughput capacity of wireless networks, analytical results on this topic are sometimes contradic...
Douglas M. Blough, Cyrus Harvesf, Giovanni Resta, ...
SDM
2009
SIAM
160views Data Mining» more  SDM 2009»
14 years 4 months ago
Discovering Substantial Distinctions among Incremental Bi-Clusters.
A fundamental task of data analysis is comprehending what distinguishes clusters found within the data. We present the problem of mining distinguishing sets which seeks to find s...
Faris Alqadah, Raj Bhatnagar
DAC
2009
ACM
14 years 2 months ago
O-Router: an optical routing framework for low power on-chip silicon nano-photonic integration
In this work, we present a new optical routing framework, O-Router for future low-power on-chip optical interconnect integration utilizing silicon compatible nano-photonic devices...
Duo Ding, Yilin Zhang, Haiyu Huang, Ray T. Chen, D...