11219 search results - page 173 / 2244 » Retroactive data structures |
178
click to vote
BMCBI
2011
14 years 8 months ago
2011
Background: The search for cluster structure in microarray datasets is a base problem for the so-called “-omic sciences”. A difficult problem in clustering is how to handle da...
178
click to vote
BMCBI
2011
14 years 8 months ago
2011
Background: Copy number variants (CNVs), including deletions, amplifications, and other rearrangements, are common in human and cancer genomes. Copy number data from array compara...
125
click to vote
ICMS
2010
15 years 3 months ago
2010
This paper presents a computational framework that allows for a robust extraction of the extremal structure of scalar and vector fields on 2D manifolds embedded in 3D. This struct...
123
click to vote
NIPS
2007
15 years 6 months ago
2007
Can we leverage learning techniques to build a fast nearest-neighbor (ANN) retrieval data structure? We present a general learning framework for the NN problem in which sample que...
192
click to vote
CORR
2009
Springer
15 years 2 months ago
2009
Springer
Abstract. We apply Uppaal Tiga to automatically compute adaptive scheduling strategies for an industrial case study dealing with a state-of-the-art image processing pipeline of a p...