Sciweavers

175 search results - page 34 / 35
» max-cut and Containment Relations in Graphs
Sort
View
JCT
1998
193views more  JCT 1998»
13 years 5 months ago
Fractional Kernels in Digraphs
The aim of this note is to point out some combinatorial applications of a lemma of Scarf, proved first in the context of game theory. The usefulness of the lemma in combinatorics...
Ron Aharoni, Ron Holzman
AMKM
2003
Springer
13 years 11 months ago
A Spreading Activation Framework for Ontology-Enhanced Adaptive Information Access within Organisations
This research investigates a unique Indexing Structure and Navigational Interface which integrates (1) ontology-driven knowledge-base (2) statistically derived indexing parameters...
Md Maruf Hasan
ILP
2003
Springer
13 years 11 months ago
Mining Model Trees: A Multi-relational Approach
In many data mining tools that support regression tasks, training data are stored in a single table containing both the target field (dependent variable) and the attributes (indepe...
Annalisa Appice, Michelangelo Ceci, Donato Malerba
CIAC
2000
Springer
210views Algorithms» more  CIAC 2000»
13 years 10 months ago
Computing a Diameter-Constrained Minimum Spanning Tree in Parallel
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to ...
Narsingh Deo, Ayman Abdalla
BMCBI
2006
150views more  BMCBI 2006»
13 years 6 months ago
Cluster analysis of protein array results via similarity of Gene Ontology annotation
Background: With the advent of high-throughput proteomic experiments such as arrays of purified proteins comes the need to analyse sets of proteins as an ensemble, as opposed to t...
Cheryl Wolting, C. Jane McGlade, David Tritchler