Sciweavers

158 search results - page 29 / 32
» Mining scale-free networks using geodesic clustering
Sort
View
EGPGV
2004
Springer
175views Visualization» more  EGPGV 2004»
14 years 28 days ago
Interactive Parallel Visualization of Large Particle Datasets
This paper presents a new interactive parallel method for direct visualization of large particle datasets. Based on a parallel rendering cluster, a frame rate of 9 frames-per-seco...
Kevin Liang, Patricia Monger, Huge Couchman
ICDM
2009
IEEE
112views Data Mining» more  ICDM 2009»
14 years 2 months ago
Resolving Identity Uncertainty with Learned Random Walks
A pervasive problem in large relational databases is identity uncertainty which occurs when multiple entries in a database refer to the same underlying entity in the world. Relati...
Ted Sandler, Lyle H. Ungar, Koby Crammer
ICDCSW
2005
IEEE
14 years 1 months ago
Adaptive Real-Time Anomaly Detection with Improved Index and Ability to Forget
Anomaly detection in IP networks, detection of deviations from what is considered normal, is an important complement to misuse detection based on known attack descriptions. Perfor...
Kalle Burbeck, Simin Nadjm-Tehrani
CEE
2008
119views more  CEE 2008»
13 years 7 months ago
A clustering-based prefetching scheme on a Web cache environment
Web prefetching is an attractive solution to reduce the network resources consumed by Web services as well as the access latencies perceived by Web users. Unlike Web caching, whic...
George Pallis, Athena Vakali, Jaroslav Pokorn&yacu...
KDD
2007
ACM
244views Data Mining» more  KDD 2007»
14 years 8 months ago
A Recommender System Based on Local Random Walks and Spectral Methods
In this paper, we design recommender systems for weblogs based on the link structure among them. We propose algorithms based on refined random walks and spectral methods. First, w...
Zeinab Abbassi, Vahab S. Mirrokni