Sciweavers

6715 search results - page 812 / 1343
» Learning from a Test Set
Sort
View
INFORMS
2010
138views more  INFORMS 2010»
15 years 5 months ago
Pruning Moves
The concept of dominance among nodes of a branch-decision tree, although known since a long time, is not exploited by general-purpose Mixed-Integer Linear Programming (MILP) enume...
Matteo Fischetti, Domenico Salvagnin
KDD
2009
ACM
269views Data Mining» more  KDD 2009»
16 years 7 months ago
Frequent pattern mining with uncertain data
In this paper, we will examine the frequent pattern mining for uncertain data sets. We will show how the broad classes of algorithms can be extended to the uncertain data setting....
Charu C. Aggarwal, Yan Li, Jianyong Wang, Jing Wan...
IPPS
2007
IEEE
16 years 1 months ago
Decomposing Partial Order Execution Graphs to Improve Message Race Detection
In message-passing parallel applications, messages are not delivered in a strict order. In most applications, the computation results and the set of messages produced during the e...
Basile Schaeli, Sebastian Gerlach, Roger D. Hersch
CIARP
2005
Springer
16 years 20 days ago
Reward-Punishment Editing for Mixed Data
The KNN rule has been widely used in many pattern recognition problems, but it is sensible to noisy data within the training set, therefore, several sample edition methods have bee...
Raúl Rodríguez-Colín, Jes&uac...
EGPGV
2004
Springer
214views Visualization» more  EGPGV 2004»
16 years 15 days ago
Hierarchical Visualization and Compression of Large Volume Datasets Using GPU Clusters
We describe a system for the texture-based direct volume visualization of large data sets on a PC cluster equipped with GPUs. The data is partitioned into volume bricks in object ...
Magnus Strengert, Marcelo Magallón, Daniel ...