Sciweavers

79 search results - page 5 / 16
» Hardware-Based Implementation of the Common Approximate Subs...
Sort
View
84
Voted
ISSAC
2009
Springer
184views Mathematics» more  ISSAC 2009»
15 years 4 months ago
An iterative method for calculating approximate GCD of univariate polynomials
We present an iterative algorithm for calculating approximate greatest common divisor (GCD) of univariate polynomials with the real coefficients. For a given pair of polynomials a...
Akira Terui
IDEAS
2008
IEEE
80views Database» more  IDEAS 2008»
15 years 3 months ago
Improved count suffix trees for natural language data
With more and more natural language text stored in databases, handling respective query predicates becomes very important. Optimizing queries with predicates includes (sub)string ...
Guido Sautter, Cristina Abba, Klemens Böhm
ICDE
2010
IEEE
188views Database» more  ICDE 2010»
15 years 9 months ago
Space-efficient Online Approximation of Time Series Data: Streams, Amnesia, and Out-of-order
In this paper, we present an abstract framework for online approximation of time-series data that yields a unified set of algorithms for several popular models: data streams, amnes...
Sorabh Gandhi, Luca Foschini, Subhash Suri
ICDE
2008
IEEE
163views Database» more  ICDE 2008»
15 years 10 months ago
Approximate Joins for Data-Centric XML
In data integration applications, a join matches elements that are common to two data sources. Often, however, elements are represented slightly different in each source, so an app...
Nikolaus Augsten, Michael H. Böhlen, Curtis E...
JCB
2007
92views more  JCB 2007»
14 years 9 months ago
Neighbor Joining Algorithms for Inferring Phylogenies via LCA Distances
Reconstructing phylogenetic trees efficiently and accurately from distance estimates is an ongoing challenge in computational biology from both practical and theoretical consider...
Ilan Gronau, Shlomo Moran