Sciweavers

4865 search results - page 646 / 973
» The Complexity of Graph Connectivity
Sort
View
MOBIHOC
2009
ACM
16 years 6 months ago
Fine-grained boundary recognition in wireless ad hoc and sensor networks by topological methods
Location-free boundary recognition is crucial and critical for many fundamental network functionalities in wireless ad hoc and sensor networks. Previous designs, often coarse-grai...
Dezun Dong, Yunhao Liu, Xiangke Liao
KDD
2008
ACM
224views Data Mining» more  KDD 2008»
16 years 6 months ago
The structure of information pathways in a social communication network
Social networks are of interest to researchers in part because they are thought to mediate the flow of information in communities and organizations. Here we study the temporal dyn...
Gueorgi Kossinets, Jon M. Kleinberg, Duncan J. Wat...
KDD
2004
ACM
190views Data Mining» more  KDD 2004»
16 years 6 months ago
Kernel k-means: spectral clustering and normalized cuts
Kernel k-means and spectral clustering have both been used to identify clusters that are non-linearly separable in input space. Despite significant research, these methods have re...
Inderjit S. Dhillon, Yuqiang Guan, Brian Kulis
VLSID
2002
IEEE
94views VLSI» more  VLSID 2002»
16 years 6 months ago
A Unified Method to Handle Different Kinds of Placement Constraints in Floorplan Design
In floorplan design, it is common that a designer will want to control the positions of some modules in the final packing for various purposes like data path alignment, I/O connec...
Evangeline F. Y. Young, Chris C. N. Chu, M. L. Ho
OSDI
2008
ACM
16 years 6 months ago
Block Mason
The flexibility provided by hardware virtualization allows administrators to rapidly create, destroy, and migrate systems across physical hosts. Unfortunately, the storage systems...
Dutch T. Meyer, Brendan Cully, Jake Wires, Norman ...