Sciweavers

1539 search results - page 298 / 308
» Fast and Simple Methods For Computing Control Points
Sort
View
KDD
2007
ACM
177views Data Mining» more  KDD 2007»
14 years 8 months ago
Mining optimal decision trees from itemset lattices
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
Élisa Fromont, Siegfried Nijssen
NETGAMES
2003
ACM
14 years 23 days ago
Spatial principles of level-design in multi-player first-person shooters
: This paper outlines the basic spatial principles of level design in multi-player first-person shooters with special reference to Counterstrike, basing itself on experiment, analy...
Christian Güttler, Troels Degn Johansson
GECCO
2008
Springer
143views Optimization» more  GECCO 2008»
13 years 8 months ago
Application domain study of evolutionary algorithms in optimization problems
This paper deals with the problem of comparing and testing evolutionary algorithms, that is, the benchmarking problem, from an analysis point of view. A practical study of the app...
Pilar Caamaño, Francisco Bellas, José...
SIAMMAX
2010
164views more  SIAMMAX 2010»
13 years 2 months ago
Uniqueness of Low-Rank Matrix Completion by Rigidity Theory
The problem of completing a low-rank matrix from a subset of its entries is often encountered in the analysis of incomplete data sets exhibiting an underlying factor model with app...
Amit Singer, Mihai Cucuringu
CGF
2007
158views more  CGF 2007»
13 years 7 months ago
Manipulating, Deforming and Animating Sampled Object Representations
A sampled object representation (SOR) defines a graphical model using data obtained from a sampling process, which takes a collection of samples at discrete positions in space in...
Min Chen, Carlos D. Correa, Shoukat Islam, Mark W....