Sciweavers

7015 search results - page 240 / 1403
» Approximation algorithms for co-clustering
Sort
View
ALENEX
2007
158views Algorithms» more  ALENEX 2007»
15 years 8 months ago
Faster Filters for Approximate String Matching
We introduce a new filtering method for approximate string matching called the suffix filter. It has some similarity with well-known filtration algorithms, which we call factor...
Juha Kärkkäinen, Joong Chae Na
JCO
2007
149views more  JCO 2007»
15 years 6 months ago
A 2-approximation for the preceding-and-crossing structured 2-interval pattern problem
The 2-interval pattern problem over its various models and restrictions was proposed by Vialette (2004) for the application of RNA secondary structure prediction. We present an O(n...
Minghui Jiang
SCL
2010
98views more  SCL 2010»
15 years 4 months ago
Symbolic models for nonlinear time-delay systems using approximate bisimulations
In this paper we show that incrementally stable nonlinear time–delay systems admit symbolic models which are approximately equivalent, in the sense of approximate bisimulation, ...
Giordano Pola, Pierdomenico Pepe, Maria Domenica D...
ICDE
2000
IEEE
168views Database» more  ICDE 2000»
16 years 7 months ago
PAC Nearest Neighbor Queries: Approximate and Controlled Search in High-Dimensional and Metric Spaces
In high-dimensional and complex metric spaces, determining the nearest neighbor (NN) of a query object ? can be a very expensive task, because of the poor partitioning operated by...
Paolo Ciaccia, Marco Patella
VLDB
2007
ACM
107views Database» more  VLDB 2007»
16 years 6 months ago
VGRAM: Improving Performance of Approximate Queries on String Collections Using Variable-Length Grams
Many applications need to solve the following problem of approximate string matching: from a collection of strings, how to find those similar to a given string, or the strings in ...
Chen Li, Bin Wang, Xiaochun Yang