7988 search results - page 1377 / 1598 » A Useful Undecidable Theory |
175
click to vote
KDD
2008
ACM
16 years 4 months ago
2008
ACM
The input to an algorithm that learns a binary classifier normally consists of two sets of examples, where one set consists of positive examples of the concept to be learned, and ...
156
click to vote
KDD
2007
ACM
16 years 4 months ago
2007
ACM
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...
148
click to vote
CHI
2004
ACM
16 years 4 months ago
2004
ACM
Level of Web experience is often a factor for which researchers attempt to control while conducting experimental studies on Web usability. It is typically measured by some means o...
254
click to vote
POPL
2008
ACM
16 years 4 months ago
2008
ACM
Relevance heuristics allow us to tailor a program analysis to a particular property to be verified. This in turn makes it possible to improve the precision of the analysis where n...
145
click to vote
STOC
2005
ACM
16 years 4 months ago
2005
ACM
We consider the classical problem of scheduling parallel unrelated machines. Each job is to be processed by exactly one machine. Processing job j on machine i requires time pij . ...