Sciweavers

364 search results - page 42 / 73
» Computing Communities in Large Networks Using Random Walks
Sort
View
MOBISYS
2005
ACM
15 years 9 months ago
Energy efficiency of handheld computer interfaces: limits, characterization and practice
Energy efficiency has become a critical issue for battery-driven computers. Significant work has been devoted to improving it through better software and hardware. However, the hu...
Lin Zhong, Niraj K. Jha
SDM
2007
SIAM
73views Data Mining» more  SDM 2007»
14 years 11 months ago
Sketching Landscapes of Page Farms
The Web is a very large social network. It is important and interesting to understand the “ecology” of the Web: the general relations of Web pages to their environment. The un...
Bin Zhou 0002, Jian Pei
DIALM
2005
ACM
130views Algorithms» more  DIALM 2005»
14 years 11 months ago
On lower bounds for MAC layer contention in CSMA/CA-based wireless networks
Wireless LANs operating within unlicensed frequency bands require random access schemes such as CSMA/CA, so that wireless networks from different administrative domains (for exam...
Frank A. Zdarsky, Ivan Martinovic, Jens B. Schmitt
74
Voted
CCR
2010
133views more  CCR 2010»
14 years 9 months ago
The role of network trace anonymization under attack
In recent years, academic literature has analyzed many attacks on network trace anonymization techniques. These attacks usually correlate external information with anonymized data...
Martin Burkhart, Dominik Schatzmann, Brian Trammel...
ICCTA
2007
IEEE
15 years 1 months ago
What Graphs can be Efficiently Represented by BDDs?
We have carried out experimental research into implicit representation of large graphs using reduced ordered binary decision diagrams (OBDDs). We experimentally show that for grap...
Changxing Dong, Paul Molitor