Sciweavers

27 search results - page 5 / 6
» Accuracy of Approximate String Joins Using Grams
Sort
View
BIBE
2005
IEEE
13 years 11 months ago
Improved Phylogenetic Motif Detection Using Parsimony
We have recently demonstrated (La et al, Proteins, 58:2005) that sequence fragments approximating the overall familial phylogeny, called phylogenetic motifs (PMs), represent a pro...
Usman Roshan, Dennis R. Livesay, David La
VLDB
2005
ACM
121views Database» more  VLDB 2005»
13 years 10 months ago
Online Estimation For Subset-Based SQL Queries
The largest databases in use today are so large that answering a query exactly can take minutes, hours, or even days. One way to address this problem is to make use of approximati...
Chris Jermaine, Alin Dobra, Abhijit Pol, Shantanu ...
ICAIL
2003
ACM
13 years 10 months ago
A Comparative Evaluation of Name-Matching Algorithms
Name matching—recognizing when two different strings are likely to denote the same entity—is an important task in many legal information systems, such as case-management syste...
Karl Branting
ICDE
2009
IEEE
174views Database» more  ICDE 2009»
14 years 5 days ago
Sketching Sampled Data Streams
—Sampling is used as a universal method to reduce the running time of computations – the computation is performed on a much smaller sample and then the result is scaled to comp...
Florin Rusu, Alin Dobra
SIGMOD
2010
ACM
259views Database» more  SIGMOD 2010»
13 years 10 months ago
PODS: a new model and processing algorithms for uncertain data streams
Uncertain data streams, where data is incomplete, imprecise, and even misleading, have been observed in many environments. Feeding such data streams to existing stream systems pro...
Thanh T. L. Tran, Liping Peng, Boduo Li, Yanlei Di...