1068 search results - page 128 / 214 » Factorization as a Rank 1 Problem |
CORR
2012
Springer
13 years 5 months ago
2012
Springer
The problem of finding locally dense components of a graph is an important primitive in data analysis, with wide-ranging applications from community mining to spam detection and ...
STOC
2003
ACM
15 years 10 months ago
2003
ACM
We consider a fundamental problem in computational learning theory: learning an arbitrary Boolean function which depends on an unknown set of k out of n Boolean variables. We give...
HICSS
2006
IEEE
15 years 4 months ago
2006
IEEE
Information technologies (IT) have spread throughout all areas of modern society. However, the evolution of ethics that guide their use lags behind technological advances [2]. A p...
PODC
2010
ACM
14 years 12 months ago
2010
ACM
We give a graph decomposition technique that creates entirely independent subproblems for graph problems such as coloring and dominating sets that can be solved without synchroniz...
BCSHCI
2007
14 years 11 months ago
2007
This paper surveys the use of inferential statistics over the last two BCS HCI conferences and the last year (2006) of two leading HCI journals. Of the 80 papers covered, 41 used ...