8695 search results - page 96 / 1739 » Making the Complex Simple |
179
click to vote
JMLR
2010
15 years 1 months ago
2010
In this paper we address the problem of predicting when the available data is incomplete. We show that changing the generally accepted table-wise view of the sample items into a g...
150
click to vote
FDG
2009
ACM
16 years 22 days ago
2009
ACM
As the interactive entertainment industry matures, a better understanding of what makes software entertaining is needed. A natural starting point is the application of traditional...
154
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
We present sublinear-time (randomized) algorithms for finding simple cycles of length at least k 3 and tree-minors in bounded-degree graphs. The complexity of these algorithms is...
169
click to vote
AAAI
1994
15 years 7 months ago
1994
We describe a method for learning formulas in firstorder logic using a brute-force, smallest-first search. The method is exceedingly simple. It generates all irreducible well-form...
153
click to vote
MICRO
2006
IEEE
15 years 6 months ago
2006
IEEE
Runahead execution improves memory latency tolerance without significantly increasing processor complexity. Unfortunately, a runahead execution processor executes significantly mo...