Sciweavers

2252 search results - page 355 / 451
» Improving Random Forests
Sort
View
AMT
2006
Springer
91views Multimedia» more  AMT 2006»
14 years 1 months ago
Rough Set Model for Constraint-based Multi-dimensional Association Rule Mining
Abstract. This paper presents a rough set model for constraint-based multidimensional association rule mining. It first overviews the progress in constraintbased multi-dimensional ...
Wanzhong Yang, Yuefeng Li, Yue Xu, Hang Liu
ANNPR
2006
Springer
14 years 1 months ago
Simple and Effective Connectionist Nonparametric Estimation of Probability Density Functions
Abstract. Estimation of probability density functions (pdf) is one major topic in pattern recognition. Parametric techniques rely on an arbitrary assumption on the form of the unde...
Edmondo Trentin
ASPDAC
2006
ACM
141views Hardware» more  ASPDAC 2006»
14 years 1 months ago
Depth-driven verification of simultaneous interfaces
The verification of modern computing systems has grown to dominate the cost of system design, often with limited success as designs continue to be released with latent bugs. This t...
Ilya Wagner, Valeria Bertacco, Todd M. Austin
CPM
2004
Springer
107views Combinatorics» more  CPM 2004»
14 years 1 months ago
Sorting by Reversals in Subquadratic Time
The problem of sorting a signed permutation by reversals is inspired by genome rearrangements in computational molecular biology. Given two genomes represented as two signed permut...
Eric Tannier, Marie-France Sagot
FOCS
2004
IEEE
14 years 1 months ago
Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity
We consider a stochastic variant of the NP-hard 0/1 knapsack problem in which item values are deterministic and item sizes are independent random variables with known, arbitrary d...
Brian C. Dean, Michel X. Goemans, Jan Vondrá...