Sciweavers

304 search results - page 10 / 61
» Dynamic ordered sets with exponential search trees
Sort
View
TMI
2008
138views more  TMI 2008»
13 years 8 months ago
Dynamic Positron Emission Tomography Data-Driven Analysis Using Sparse Bayesian Learning
A method is presented for the analysis of dynamic positron emission tomography (PET) data using sparse Bayesian learning. Parameters are estimated in a compartmental framework usin...
Jyh-Ying Peng, John A. D. Aston, R. N. Gunn, Cheng...
KDD
2012
ACM
186views Data Mining» more  KDD 2012»
11 years 11 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
SODA
2004
ACM
89views Algorithms» more  SODA 2004»
13 years 10 months ago
Interpolation search for non-independent data
We define a deterministic metric of "well-behaved data" that enables searching along the lines of interpolation search. Specifically, define to be the ratio of distance...
Erik D. Demaine, Thouis R. Jones, Mihai Patrascu
BMCBI
2004
112views more  BMCBI 2004»
13 years 8 months ago
A double classification tree search algorithm for index SNP selection
Background: In population-based studies, it is generally recognized that single nucleotide polymorphism (SNP) markers are not independent. Rather, they are carried by haplotypes, ...
Peisen Zhang, Huitao Sheng, Ryuhei Uehara
IBPRIA
2007
Springer
14 years 2 months ago
A Tabular Pruning Rule in Tree-Based Fast Nearest Neighbor Search Algorithms
Some fast nearest neighbor search (NNS) algorithms using metric properties have appeared in the last years for reducing computational cost. Depending on the structure used to store...
José Oncina, Franck Thollard, Eva Gó...