4488 search results - page 322 / 898 » Properties of NP-Complete Sets |
192
Voted
COOPIS
2004
IEEE
15 years 10 months ago
2004
IEEE
Previous workflow mining works have concentrated their efforts on process behavioral aspects. Although powerful, these proposals are found lacking in functionalities and performanc...
168
click to vote
CP
2006
Springer
15 years 10 months ago
2006
Springer
We consider probabilistic constrained linear programs with general distributions for the uncertain parameters. These problems generally involve non-convex feasible sets. We develo...
171
click to vote
ECML
2006
Springer
15 years 10 months ago
2006
Springer
Label ranking studies the problem of learning a mapping from instances to rankings over a predefined set of labels. We approach this setting from a case-based perspective and propo...
198
click to vote
MFDBS
1991
15 years 10 months ago
1991
We study an approach to relational databases which treats relations not as subsets of a Cartesian product but as subsets of some domain { a partially ordered space of descriptions...
178
Voted
DGCI
2009
Springer
15 years 10 months ago
2009
Springer
For discrete sets coded by the Freeman chain describing their contour, several linear algorithms have been designed for determining their shape properties. Most of them are based ...