9842 search results - page 272 / 1969 » Problem complexity |
194
click to vote
FOCS
2006
IEEE
16 years 24 days ago
2006
IEEE
How much can randomness help computation? Motivated by this general question and by volume computation, one of the few instances where randomness provably helps, we analyze a noti...
173
click to vote
ICCV
2005
IEEE
16 years 10 days ago
2005
IEEE
This study addresses the problem of unsupervised visual learning. It examines existing popular model order selection criteria before proposes two novel criteria for improving visu...
158
click to vote
KDD
1998
ACM
15 years 11 months ago
1998
ACM
This paper explores unexpected results that lie at the intersection of two common themes in the KDD community: large datasets and the goal of building compact models. Experiments ...
180
click to vote
ECAI
1992
Springer
15 years 10 months ago
1992
Springer
ABSTRACT. This paper investigates the problem of finding subclasses of nonmonotonic reasoning which can be implemented efficiently. The ability to "define" propositions u...
176
click to vote
ECOOP
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We present Shekoosh, a novel framework for constraint-based generation of structurally complex inputs of large sizes. Given a Java predicate that represents the desired s...