Sciweavers

247 search results - page 28 / 50
» Scaling up all pairs similarity search
Sort
View
VLDB
2000
ACM
121views Database» more  VLDB 2000»
15 years 3 months ago
Fast Time Sequence Indexing for Arbitrary Lp Norms
Fast indexing in time sequence databases for similarity searching has attracted a lot of research recently. Most of the proposals, however, typically centered around the Euclidean...
Byoung-Kee Yi, Christos Faloutsos
IJON
2006
160views more  IJON 2006»
14 years 11 months ago
Attractor dynamics in a modular network model of the cerebral cortex
ional models of cortical associative memory often take a top-down approach. We have previously described such an abstract model with a hypercolumnar structure. Here we explore a s...
Mikael Lundqvist, Martin Rehn, Anders Lansner
NAR
2000
122views more  NAR 2000»
14 years 11 months ago
ProDom and ProDom-CG: tools for protein domain analysis and whole genome comparisons
ProDom contains all protein domain families automatically generated from the SWISS-PROT and TrEMBL sequence databases (http://www.toulouse. inra.fr/prodom.html ). ProDom-CG result...
Florence Corpet, Florence Servant, Jér&ocir...
CVPR
2009
IEEE
16 years 6 months ago
Active Learning for Large Multi-class Problems
Scarcity and infeasibility of human supervision for large scale multi-class classification problems necessitates active learning. Unfortunately, existing active learning methods ...
Prateek Jain (University of Texas at Austin), Ashi...
CVPR
2004
IEEE
16 years 1 months ago
Fast Contour Matching Using Approximate Earth Mover's Distance
Weighted graph matching is a good way to align a pair of shapes represented by a set of descriptive local features; the set of correspondences produced by the minimum cost matchin...
Kristen Grauman, Trevor Darrell