Sciweavers

3341 search results - page 668 / 669
» Managing a Large
Sort
View
KDD
2012
ACM
242views Data Mining» more  KDD 2012»
12 years 6 days ago
Query-driven discovery of semantically similar substructures in heterogeneous networks
Heterogeneous information networks that contain multiple types of objects and links are ubiquitous in the real world, such as bibliographic networks, cyber-physical networks, and ...
Xiao Yu, Yizhou Sun, Peixiang Zhao, Jiawei Han
KDD
2012
ACM
200views Data Mining» more  KDD 2012»
12 years 6 days ago
Vertex neighborhoods, low conductance cuts, and good seeds for local community methods
The communities of a social network are sets of vertices with more connections inside the set than outside. We theoretically demonstrate that two commonly observed properties of s...
David F. Gleich, C. Seshadhri
KDD
2012
ACM
166views Data Mining» more  KDD 2012»
12 years 6 days ago
Selecting a characteristic set of reviews
Online reviews provide consumers with valuable information that guides their decisions on a variety of fronts: from entertainment and shopping to medical services. Although the pr...
Theodoros Lappas, Mark Crovella, Evimaria Terzi
SIGMOD
2009
ACM
250views Database» more  SIGMOD 2009»
14 years 10 months ago
Query processing techniques for solid state drives
Solid state drives perform random reads more than 100x faster than traditional magnetic hard disks, while offering comparable sequential read and write bandwidth. Because of their...
Dimitris Tsirogiannis, Stavros Harizopoulos, Mehul...
ISCC
2002
IEEE
122views Communications» more  ISCC 2002»
14 years 2 months ago
Efficiency/friendliness tradeoffs in TCP Westwood
In this paper, we propose a refinement of TCP Westwood allowing the management of the Efficiency/Friendliness-toNewReno tradeoff. We show that the refined TCP Westwood is able to ...
Ren Wang, Massimo Valla, M. Y. Sanadidi, Bryan K. ...