Sciweavers

35419 search results - page 7071 / 7084
» How Are We Doing
Sort
View
ICDM
2010
IEEE
146views Data Mining» more  ICDM 2010»
13 years 7 months ago
One-Class Matrix Completion with Low-Density Factorizations
Consider a typical recommendation problem. A company has historical records of products sold to a large customer base. These records may be compactly represented as a sparse custom...
Vikas Sindhwani, Serhat Selcuk Bucak, Jianying Hu,...
ICDM
2010
IEEE
230views Data Mining» more  ICDM 2010»
13 years 7 months ago
Clustering Large Attributed Graphs: An Efficient Incremental Approach
In recent years, many networks have become available for analysis, including social networks, sensor networks, biological networks, etc. Graph clustering has shown its effectivenes...
Yang Zhou, Hong Cheng, Jeffrey Xu Yu
IMC
2010
ACM
13 years 7 months ago
Speed testing without speed tests: estimating achievable download speed from passive measurements
How fast is the network? The speed at which real users can download content at different locations and at different times is an important metric for service providers. Knowledge o...
Alexandre Gerber, Jeffrey Pang, Oliver Spatscheck,...
MM
2010
ACM
158views Multimedia» more  MM 2010»
13 years 7 months ago
Image segmentation with patch-pair density priors
In this paper, we investigate how an unlabeled image corpus can facilitate the segmentation of any given image. A simple yet efficient multi-task joint sparse representation model...
Xiaobai Liu, Jiashi Feng, Shuicheng Yan, Hai Jin
SADFE
2010
IEEE
13 years 7 months ago
Fonts for Forensics
: Like other latent evidence that cannot be directly perceived by people, bit sequences have to be presented through tools. Presentations of digital forensic evidence often involve...
Fred Cohen
« Prev « First page 7071 / 7084 Last » Next »