Sciweavers

3013 search results - page 290 / 603
» Context-Oriented Domain Analysis
Sort
View
JMLR
2010
172views more  JMLR 2010»
15 years 1 months ago
Modeling annotator expertise: Learning when everybody knows a bit of something
Supervised learning from multiple labeling sources is an increasingly important problem in machine learning and data mining. This paper develops a probabilistic approach to this p...
Yan Yan, Rómer Rosales, Glenn Fung, Mark W....
JSCIC
2010
101views more  JSCIC 2010»
15 years 1 months ago
Boundary-Conforming Discontinuous Galerkin Methods via Extensions from Subdomains
A new way of devising numerical methods is introduced whose distinctive feature is the computation of a finite element approximation only in a polyhedral subdomain D of the origina...
Bernardo Cockburn, Deepa Gupta, Fernando Reitich
MEMETIC
2010
311views more  MEMETIC 2010»
15 years 1 months ago
Iterated local search with Powell's method: a memetic algorithm for continuous global optimization
In combinatorial solution spaces Iterated Local Search (ILS) turns out to be exceptionally successful. The question arises: is ILS also capable of improving the optimization proces...
Oliver Kramer
TCIAIG
2010
15 years 1 months ago
Monte Carlo Tree Search in Hex
Hex, the classic board game invented by Piet Hein in 1942 and independently by John Nash in 1948, has been a domain of artificial intelligence research since Claude Shannon's ...
Broderick Arneson, Ryan B. Hayward, Philip Henders...
TIP
2010
111views more  TIP 2010»
15 years 1 months ago
Demosaicking by Alternating Projections: Theory and Fast One-Step Implementation
Color image demosaicking is a key process in the digital imaging pipeline. In this paper, we study a classical demosaicking algorithm based on alternating projections (AP), propos...
Yue M. Lu, Mina Karzand, Martin Vetterli