Sciweavers

17 search results - page 2 / 4
» Efficient pairing computation on supersingular Abelian varie...
Sort
View
PODS
2005
ACM
131views Database» more  PODS 2005»
14 years 5 months ago
Space efficient mining of multigraph streams
The challenge of monitoring massive amounts of data generated by communication networks has led to the interest in data stream processing. We study streams of edges in massive com...
Graham Cormode, S. Muthukrishnan
ADBIS
2009
Springer
162views Database» more  ADBIS 2009»
13 years 9 months ago
Efficient Set Similarity Joins Using Min-prefixes
Identification of all objects in a dataset whose similarity is not less than a specified threshold is of major importance for management, search, and analysis of data. Set similari...
Leonardo Ribeiro, Theo Härder
BMCBI
2010
113views more  BMCBI 2010»
13 years 5 months ago
Efficient protein alignment algorithm for protein search
Background: Proteins show a great variety of 3D conformations, which can be used to infer their evolutionary relationship and to classify them into more general groups; therefore ...
Zaixin Lu, Zhiyu Zhao, Bin Fu
KDD
2006
ACM
149views Data Mining» more  KDD 2006»
14 years 5 months ago
Regularized discriminant analysis for high dimensional, low sample size data
Linear and Quadratic Discriminant Analysis have been used widely in many areas of data mining, machine learning, and bioinformatics. Friedman proposed a compromise between Linear ...
Jieping Ye, Tie Wang
CVPR
2008
IEEE
14 years 7 months ago
A fast local descriptor for dense matching
We introduce a novel local image descriptor designed for dense wide-baseline matching purposes. We feed our descriptors to a graph-cuts based dense depth map estimation algorithm ...
Engin Tola, Vincent Lepetit, Pascal Fua