Sciweavers

8825 search results - page 1595 / 1765
» All for one or one for all
Sort
View
CHI
2009
ACM
14 years 11 months ago
Sharing digital photographs in the home by tagging memorabilia
Abstract Within the home, digital photos lack the physical affordances that make collocated photo-sharing easy and opportunistic. Family members have difficulty accessing the perso...
Saul Greenberg, Michael Nunes
PODC
2009
ACM
14 years 11 months ago
Oblivious interference scheduling
In the interference scheduling problem, one is given a set of n communication requests described by pairs of points from a metric space. The points correspond to devices in a wire...
Alexander Fanghänel, Berthold Vöcking, H...
KDD
2009
ACM
239views Data Mining» more  KDD 2009»
14 years 11 months ago
Tell me something I don't know: randomization strategies for iterative data mining
There is a wide variety of data mining methods available, and it is generally useful in exploratory data analysis to use many different methods for the same dataset. This, however...
Heikki Mannila, Kai Puolamäki, Markus Ojala, ...
KDD
2009
ACM
188views Data Mining» more  KDD 2009»
14 years 11 months ago
Mining discrete patterns via binary matrix factorization
Mining discrete patterns in binary data is important for subsampling, compression, and clustering. We consider rankone binary matrix approximations that identify the dominant patt...
Bao-Hong Shen, Shuiwang Ji, Jieping Ye
KDD
2009
ACM
190views Data Mining» more  KDD 2009»
14 years 11 months ago
Efficient influence maximization in social networks
Influence maximization is the problem of finding a small subset of nodes (seed nodes) in a social network that could maximize the spread of influence. In this paper, we study the ...
Wei Chen, Yajun Wang, Siyu Yang
« Prev « First page 1595 / 1765 Last » Next »