4886 search results - page 195 / 978 » Approximate Data Exchange |
266
click to vote
VLDB
2007
ACM
16 years 6 months ago
2007
ACM
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 ...
170
click to vote
EDBT
2002
ACM
16 years 6 months ago
2002
ACM
Abstract. We present a simple query language for XML, which supports hierarchical, Boolean-connected query patterns. The interpretation of a query is founded on cost-based query tr...
158
click to vote
EDBT
2009
ACM
16 years 1 months ago
2009
ACM
We study the problem of estimating selectivity of approximate substring queries. Its importance in databases is ever increasing as more and more data are input by users and are in...
208
click to vote
ICPR
2008
IEEE
16 years 24 days ago
2008
IEEE
This paper proposes a new approach to describe the salient contours in cluttered scenes. No need to do the preprocessing, such as edge detection, we directly use a set of random s...
151
click to vote
GBRPR
2007
Springer
16 years 16 days ago
2007
Springer
The traveling salesperson problem (TSP) is difficult to solve for input instances with large number of cities. Instead of finding the solution of an input with a large number of c...