Sciweavers

720 search results - page 32 / 144
» Linear k-arboricities on trees
Sort
View
COCOON
2005
Springer
14 years 2 months ago
On the Approximation of Computing Evolutionary Trees
Given a set of leaf-labelled trees with identical leaf sets, the well-known MAST problem consists of finding a subtree homeomorphically included in all input trees and with the la...
Vincent Berry, Sylvain Guillemot, François ...
CORR
2010
Springer
174views Education» more  CORR 2010»
13 years 8 months ago
Gaussian Process Bandits for Tree Search
We motivate and analyse a new Tree Search algorithm, based on recent advances in the use of Gaussian Processes for bandit problems. We assume that the function to maximise on the ...
Louis Dorard, John Shawe-Taylor
IPPS
1995
IEEE
14 years 5 days ago
Performance evaluation of a new parallel preconditioner
The linear systems associated with large, sparse, symmetric, positive definite matrices are often solved iteratively using the preconditioned conjugate gradient method. We have d...
Keith D. Gremban, Gary L. Miller, Marco Zagha
TIC
2000
Springer
174views System Software» more  TIC 2000»
14 years 6 days ago
Alias Types for Recursive Data Structures
Linear type systems permit programmers to deallocate or explicitly recycle memory, but they are severly restricted by the fact that they admit no aliasing. This paper describes a ...
David Walker, J. Gregory Morrisett
BMCBI
2010
172views more  BMCBI 2010»
13 years 8 months ago
Inferring gene regression networks with model trees
Background: Novel strategies are required in order to handle the huge amount of data produced by microarray technologies. To infer gene regulatory networks, the first step is to f...
Isabel A. Nepomuceno-Chamorro, Jesús S. Agu...