Sciweavers

329 search results - page 45 / 66
» Fast structural similarity index algorithm
Sort
View
SIGMOD
2009
ACM
155views Database» more  SIGMOD 2009»
14 years 7 months ago
Efficient top-k algorithms for fuzzy search in string collections
An approximate search query on a collection of strings finds those strings in the collection that are similar to a given query string, where similarity is defined using a given si...
Rares Vernica, Chen Li
ICDE
2007
IEEE
145views Database» more  ICDE 2007»
14 years 9 months ago
Fast Identification of Relational Constraint Violations
Logical constraints, (e.g., 'phone numbers in toronto can have prefixes 416, 647, 905 only'), are ubiquitous in relational databases. Traditional integrity constraints, ...
Amit Chandel, Nick Koudas, Ken Q. Pu, Divesh Sriva...
BMCBI
2008
124views more  BMCBI 2008»
13 years 7 months ago
Alignment of protein structures in the presence of domain motions
Background: Structural alignment is an important step in protein comparison. Well-established methods exist for solving this problem under the assumption that the structures under...
Roberto Mosca, Barbara Brannetti, Thomas R. Schnei...
UAI
2000
13 years 9 months ago
The Anchors Hierarchy: Using the Triangle Inequality to Survive High Dimensional Data
This paper is about the use of metric data structures in high-dimensionalor non-Euclidean space to permit cached sufficientstatisticsaccelerationsof learning algorithms. It has re...
Andrew W. Moore
ISM
2008
IEEE
110views Multimedia» more  ISM 2008»
14 years 1 months ago
A Hardware-Independent Fast Logarithm Approximation with Adjustable Accuracy
Many multimedia applications rely on the computation of logarithms, for example, when estimating log-likelihoods for Gaussian Mixture Models. Knowing of the demand to compute loga...
Oriol Vinyals, Gerald Friedland