Sciweavers

8512 search results - page 268 / 1703
» Computing Theory With Relevance
Sort
View
MP
2006
101views more  MP 2006»
15 years 6 months ago
Computational complexity of stochastic programming problems
Stochastic programming is the subfield of mathematical programming that considers optimization in the presence of uncertainty. During the last four decades a vast amount of litera...
Martin E. Dyer, Leen Stougie
IJIS
2007
88views more  IJIS 2007»
15 years 6 months ago
Recent advances in computational models of natural argument
This paper reviews recent advances in the interdisciplinary area lying between artificial intelligence and the theory of argumentation. The paper has two distinct foci: first, exam...
Chris Reed, Floriana Grasso
APAL
1998
121views more  APAL 1998»
15 years 5 months ago
Computably Enumerable Sets and Quasi-Reducibility
We consider the computably enumerable sets under the relation of Qreducibility. We first give several results comparing the upper semilattice of c.e. Q-degrees, RQ, ≤Q , under ...
Rodney G. Downey, Geoffrey LaForte, André N...
ICMI
2009
Springer
164views Biometrics» more  ICMI 2009»
16 years 22 days ago
GaZIR: gaze-based zooming interface for image retrieval
We introduce GaZIR, a gaze-based interface for browsing and searching for images. The system computes on-line predictions of relevance of images based on implicit feedback, and wh...
László Kozma, Arto Klami, Samuel Kas...
CIARP
2007
Springer
16 years 10 days ago
Learning in Computer Vision: Some Thoughts
Abstract. It is argued that the ability to generalise is the most important characteristic of learning and that generalisation may be achieved only if pattern recognition systems l...
Maria Petrou