Sciweavers

970 search results - page 142 / 194
» On encodings of spanning trees
Sort
View
VLSID
2002
IEEE
127views VLSI» more  VLSID 2002»
14 years 11 months ago
Switching Activity Estimation of Large Circuits using Multiple Bayesian Networks
Switching activity estimation is a crucial step in estimating dynamic power consumption in CMOS circuits. In [1], we proposed a new switching probability model based on Bayesian N...
Sanjukta Bhanja, N. Ranganathan
STOC
2001
ACM
134views Algorithms» more  STOC 2001»
14 years 11 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 11 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 10 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 8 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