1272 search results - page 95 / 255 » Approximate Parameterized Matching |
253
click to vote
ICDE
2003
IEEE
16 years 4 months ago
2003
IEEE
XML data integration tools are facing a variety of challenges for their efficient and effective operation. Among these is the requirement to handle a variety of inconsistencies or...
117
Voted
ACCV
2006
Springer
15 years 9 months ago
2006
Springer
We propose a considerably faster approximation of the well known SIFT method. The main idea is to use efficient data structures for both, the detector and the descriptor. The detec...
99
Voted
DAGSTUHL
2004
15 years 4 months ago
2004
We study algorithms for approximation of the mild solution of stochastic heat equations on the spatial domain ]0, 1[ d . The error of an algorithm is defined in L2-sense. We derive...
141
click to vote
ISMB
1998
15 years 4 months ago
1998
We describe a model for strings of characters that is loosely based on the Lempel Ziv model with the addition that a repeated substring can be an approximate match to the original...
151
click to vote
ANCS
2010
ACM
15 years 28 days ago
2010
ACM
Packet classification is widely used in various network security and operation applications. Two of the main challenges are the increasing number of classification rules, amount o...