Sciweavers

572 search results - page 76 / 115
» Isotonic Classification Trees
Sort
View
82
Voted
IADIS
2008
15 years 5 months ago
Identification of Bankruptcy Fraud in Dutch Organizations
The damage of bankruptcy fraud is substantial. In response, the Dutch Ministry of Justice started a project to reduce the number of bankruptcy fraud cases by increasing the probab...
Bernard P. Veldkamp, Theo de Vries
125
Voted
NIPS
2001
15 years 4 months ago
Kernel Machines and Boolean Functions
We give results about the learnability and required complexity of logical formulae to solve classification problems. These results are obtained by linking propositional logic with...
Adam Kowalczyk, Alex J. Smola, Robert C. Williamso...
107
Voted
CORR
2010
Springer
55views Education» more  CORR 2010»
15 years 3 months ago
Using Financial Ratios to Identify Romanian Distressed Companies
In the context of the current financial crisis, when more companies are facing bankruptcy or insolvency, the paper aims to find methods to identify distressed firms by using finan...
Madalina Ecaterina Andreica, Mugurel Ionut Andreic...
137
Voted
EJC
2008
15 years 3 months ago
Dyck paths with coloured ascents
We introduce a notion of Dyck paths with coloured ascents. For several ways of colouring, when the set of colours is itself some class of lattice paths, we establish bijections be...
Andrei Asinowski, Toufik Mansour
128
Voted
DAM
2006
100views more  DAM 2006»
15 years 3 months ago
A combinatorial algorithm for weighted stable sets in bipartite graphs
Abstract. Computing a maximum weighted stable set in a bipartite graph is considered wellsolved and usually approached with preflow-push, Ford-Fulkerson or network simplex algorith...
Ulrich Faigle, Gereon Frahling