Sciweavers

820 search results - page 16 / 164
» Finding low-utility data structures
Sort
View

Publication
417views
14 years 5 months ago
Data Structures and Algorithms for Nearest Neighbor Search in General Metric Spaces
We consider the computational problem of finding nearest neighbors in general metric spaces. Of particular interest are spaces that may not be conveniently embedded or approximate...
Peter N. Yianilos
IJIG
2002
126views more  IJIG 2002»
13 years 8 months ago
Finding the Beat: An Analysis of the Rhythmic Elements of Motion Pictures
This paper forms a continuation of our work focused on exploiting film grammar for the task of automated film understanding. We examine film rhythm, a powerful narrative concept u...
Brett Adams, Chitra Dorai, Svetha Venkatesh
ICDM
2007
IEEE
121views Data Mining» more  ICDM 2007»
14 years 2 months ago
Finding Predictive Runs with LAPS
We present an extension to the Lasso [9] for binary classification problems with ordered attributes. Inspired by the Fused Lasso [8] and the Group Lasso [10, 4] models, we aim to...
Suhrid Balakrishnan, David Madigan
BMCBI
2005
98views more  BMCBI 2005»
13 years 8 months ago
The effects of normalization on the correlation structure of microarray data
Background: Stochastic dependence between gene expression levels in microarray data is of critical importance for the methods of statistical inference that resort to pooling test-...
Xing Qiu, Andrew I. Brooks, Lev Klebanov, Andrei Y...
BMCBI
2007
144views more  BMCBI 2007»
13 years 8 months ago
Gene analogue finder: a GRID solution for finding functionally analogous gene products
Background: To date more than 2,1 million gene products from more than 100000 different species have been described specifying their function, the processes they are involved in a...
Angelica Tulipano, Giacinto Donvito, Flavio Licciu...