Sciweavers

532 search results - page 10 / 107
» Tree exploration with advice
Sort
View
AAAI
2006
13 years 9 months ago
Estimating Search Tree Size
We propose two new online methods for estimating the size of a backtracking search tree. The first method is based on a weighted sample of the branches visited by chronological ba...
Philip Kilby, John K. Slaney, Sylvie Thiéba...
TCBB
2010
166views more  TCBB 2010»
13 years 5 months ago
Approximate Maximum Parsimony and Ancestral Maximum Likelihood
— We explore the maximum parsimony (MP) and ancestral maximum likelihood (AML) criteria in phylogenetic tree reconstruction. Both problems are NP hard, so we seek approximate sol...
Noga Alon, Benny Chor, Fabio Pardi, Anat Rapoport
IPPS
2009
IEEE
14 years 2 months ago
Exploring FPGAs for accelerating the phylogenetic likelihood function
Driven by novel biological wet lab techniques such as pyrosequencing there has been an unprecedented molecular data explosion over the last 2-3 years. The growth of biological seq...
Nikolaos Alachiotis, Euripides Sotiriades, Apostol...
APLAS
2003
ACM
14 years 22 days ago
Rebuilding a Tree from Its Traversals: A Case Study of Program Inversion
Given the inorder and preorder traversal of a binary tree whose labels are all distinct, one can reconstruct the tree. This article examines two existing algorithms for rebuilding ...
Shin-Cheng Mu, Richard S. Bird
KDD
2012
ACM
186views Data Mining» more  KDD 2012»
11 years 10 months ago
Maximum inner-product search using cone trees
The problem of efficiently finding the best match for a query in a given set with respect to the Euclidean distance or the cosine similarity has been extensively studied. However...
Parikshit Ram, Alexander G. Gray