Sciweavers

1813 search results - page 322 / 363
» Instance Pruning Techniques
Sort
View
NLP
2000
15 years 1 months ago
Monte-Carlo Sampling for NP-Hard Maximization Problems in the Framework of Weighted Parsing
Abstract. The purpose of this paper is (1) to provide a theoretical justification for the use of Monte-Carlo sampling for approximate resolution of NP-hard maximization problems in...
Jean-Cédric Chappelier, Martin Rajman
99
Voted
EDBT
2010
ACM
170views Database» more  EDBT 2010»
15 years 29 days ago
Augmenting OLAP exploration with dynamic advanced analytics
Online Analytical Processing (OLAP) is a popular technique for explorative data analysis. Usually, a fixed set of dimensions (such as time, place, etc.) is used to explore and ana...
Benjamin Leonhardi, Bernhard Mitschang, Rubé...
CEC
2009
IEEE
15 years 29 days ago
Using genetic programming to obtain implicit diversity
—When performing predictive data mining, the use of ensembles is known to increase prediction accuracy, compared to single models. To obtain this higher accuracy, ensembles shoul...
Ulf Johansson, Cecilia Sönströd, Tuve L&...
CSFW
2010
IEEE
15 years 23 days ago
Automating Open Bisimulation Checking for the Spi Calculus
We consider the problem of automating open bisimulation checking for the spi-calculus, an extension of the pi-calculus with cryptographic primitives. The notion of open bisimulatio...
Alwen Tiu, Jeremy E. Dawson
AAAI
2007
14 years 12 months ago
Understanding Performance Tradeoffs in Algorithms for Solving Oversubscribed Scheduling
In recent years, planning and scheduling research has paid increasing attention to problems that involve resource oversubscription, where cumulative demand for resources outstrips...
Laurence A. Kramer, Laura Barbulescu, Stephen F. S...