1921 search results - page 257 / 385 » Stereo Without Search |
159
Voted
FROCOS
2009
Springer
15 years 10 months ago
2009
Springer
In recent years, the problem of extracting a MUS (Minimal Unsatisfiable Subformula) from an unsatisfiable CNF has received much attention. Indeed, when a Boolean formula is proved ...
127
click to vote
AIED
2007
Springer
15 years 10 months ago
2007
Springer
Complex student models often include key parameters critical to their behavior and effectiveness. For example, one meta-cognitive model of student help-seeking in intelligent tutor...
161
click to vote
FGR
2004
IEEE
15 years 9 months ago
2004
IEEE
An extension of the AdaBoost learning algorithm is proposed and brought to bear on the face detection problem. In each weak classifier selection cycle, the novel totally correctiv...
153
click to vote
CP
2006
Springer
15 years 9 months ago
2006
Springer
The max k-armed bandit problem is a recently-introduced online optimization problem with practical applications to heuristic search. Given a set of k slot machines, each yielding p...
152
click to vote
CSR
2006
Springer
15 years 9 months ago
2006
Springer
Given two strings (a text t of length n and a pattern p) and a natural number w, window subsequence problems consist in deciding whether p occurs as a subsequence of t and/or findi...