5030 search results - page 256 / 1006 » cases 2007 |
186
click to vote
IPCO
2004
15 years 8 months ago
2004
We consider the problems of enumerating all minimal strongly connected subgraphs and all minimal dicuts of a given directed graph G = (V, E). We show that the first of these proble...
205
click to vote
LWA
2004
15 years 8 months ago
2004
Subgroup discovery can be applied for exploration or descriptive induction in order to discover "interesting" subgroups of the general population, given a certain proper...
193
click to vote
ESANN
2003
15 years 8 months ago
2003
In this paper we propose a new algorithm for rule extraction from a trained Multilayer Feedforward network. The algorithm is based on an interval arithmetic network inversion for p...
180
click to vote
SBBD
2004
15 years 8 months ago
2004
Traditional requirements for persistence layers do not consider limitations of the development platforms available for mobile devices. In order to facilitate the development of ap...
189
click to vote
SIS
2004
15 years 8 months ago
2004
Abstract. Sometimes there is a need to store sensitive data on an untrusted database server. Song, Wagner and Perrig have introduced a way to search for the existence of a word in ...