Sciweavers

355 search results - page 67 / 71
» An Algorithmic Solution of a Birkhoff Type Problem
Sort
View
PKDD
2005
Springer
129views Data Mining» more  PKDD 2005»
14 years 25 days ago
Interestingness is Not a Dichotomy: Introducing Softness in Constrained Pattern Mining
Abstract. The paradigm of pattern discovery based on constraints was introduced with the aim of providing to the user a tool to drive the discovery process towards potentially inte...
Stefano Bistarelli, Francesco Bonchi
JMLR
2006
169views more  JMLR 2006»
13 years 7 months ago
Bayesian Network Learning with Parameter Constraints
The task of learning models for many real-world problems requires incorporating domain knowledge into learning algorithms, to enable accurate learning from a realistic volume of t...
Radu Stefan Niculescu, Tom M. Mitchell, R. Bharat ...
I3
2007
13 years 8 months ago
Identity: How to name it, How to find it
The main objective of this work is to exploit the relationship between the information findability problem and a subject-based organization of information. Identification of a sub...
Christo Dichev, Darina Dicheva, Jan Fischer
MP
1998
136views more  MP 1998»
13 years 7 months ago
Minimum cost capacity installation for multicommodity network flows
Consider a directed graph G = (V;A), and a set of tra c demands to be shipped between pairs of nodes in V. Capacity has to be installed on the edges of this graph (in integer mult...
Daniel Bienstock, Sunil Chopra, Oktay Günl&uu...
GECCO
2009
Springer
100views Optimization» more  GECCO 2009»
14 years 1 months ago
Partial neighborhoods of elementary landscapes
This paper introduces a new component based model that makes it relatively simple to prove that certain types of landscapes are elementary. We use the model to reconstruct proofs ...
L. Darrell Whitley, Andrew M. Sutton