Sciweavers

1054 search results - page 114 / 211
» Fast Approximated SIFT
Sort
View
VLDB
2006
ACM
162views Database» more  VLDB 2006»
16 years 4 months ago
Dependency trees in sub-linear time and bounded memory
We focus on the problem of efficient learning of dependency trees. Once grown, they can be used as a special case of a Bayesian network, for PDF approximation, and for many other u...
Dan Pelleg, Andrew W. Moore
SIGMOD
2005
ACM
116views Database» more  SIGMOD 2005»
16 years 4 months ago
ProDA: a suite of web-services for progressive data analysis
Online Scientific Applications (OSA) require statistical analysis of large multidimensional datasets. Towards this end, we have designed and developed a data storage and retrieval...
Mehrdad Jahangiri, Cyrus Shahabi
BIRD
2007
Springer
120views Bioinformatics» more  BIRD 2007»
15 years 10 months ago
Joining Softassign and Dynamic Programming for the Contact Map Overlap Problem
Comparison of 3-dimensional protein folds is a core problem in molecular biology. The Contact Map Overlap (CMO) scheme provides one of the most common measures for protein structur...
Brijnesh J. Jain, Michael Lappe
ICCSA
2005
Springer
15 years 9 months ago
Quasi-interpolants Based Multilevel B-Spline Surface Reconstruction from Scattered Data
Abstract. This paper presents a new fast and local method of 3D surface reconstruction for scattered data. The algorithm makes use of quasiinterpolants to compute the control point...
Byung-Gook Lee, Joon-Jae Lee, Ki-Ryoung Kwon
ICA
2004
Springer
15 years 9 months ago
Minimax Mutual Information Approach for ICA of Complex-Valued Linear Mixtures
Abstract. Recently, the authors developed the Minimax Mutual Information algorithm for linear ICA of real-valued mixtures, which is based on a density estimate stemming from Jaynes...
Jian-Wu Xu, Deniz Erdogmus, Yadunandana N. Rao, Jo...