Sciweavers

8413 search results - page 278 / 1683
» Ordering Problem Subgoals
Sort
View
ICDM
2005
IEEE
134views Data Mining» more  ICDM 2005»
16 years 3 days ago
A Preference Model for Structured Supervised Learning Tasks
The preference model introduced in this paper gives a natural framework and a principled solution for a broad class of supervised learning problems with structured predictions, su...
Fabio Aiolli
PARA
2004
Springer
15 years 12 months ago
Performance of Taylor Model Methods for Validated Integration of ODEs
The performance of various Taylor model (TM)-based methods for the validated integration of ODEs is studied for some representative computational problems. For nonlinear problems, ...
Martin Berz, Kyoko Makino
IV
1999
IEEE
109views Visualization» more  IV 1999»
15 years 10 months ago
2D Texture Refinement Using Procedural Functions
In Computer Graphics, aliasing is a problem which is always present when discrete elements are mapped to continuous functions or vice-versa. Although there is no general solution ...
Esteban Walter Gonzalez Clua, Marcelo Dreux, Marce...
UAI
2008
15 years 8 months ago
Bounding Search Space Size via (Hyper)tree Decompositions
This paper develops a measure for bounding the performance of AND/OR search algorithms for solving a variety of queries over graphical models. We show how drawing a connection to ...
Lars Otten, Rina Dechter
IWEC
2004
15 years 7 months ago
Towards a Framework for Design Guidelines for Young Children?s Computer Games
This paper describes a number of general design problems with adventure-like computer games for young children in order to demonstrate the need for specific design guidelines for t...
Wolmet Barendregt, Mathilde M. Bekker