Sciweavers

5105 search results - page 56 / 1021
» Approximate Structural Consistency
Sort
View
SPIRE
2009
Springer
15 years 6 months ago
Indexing Variable Length Substrings for Exact and Approximate Matching
We introduce two new index structures based on the q-gram index. The new structures index substrings of variable length instead of q-grams of fixed length. For both of the new ind...
Gonzalo Navarro, Leena Salmela
MP
2002
84views more  MP 2002»
14 years 11 months ago
A decomposition procedure based on approximate Newton directions
The efficient solution of large-scale linear and nonlinear optimization problems may require exploiting any special structure in them in an efficient manner. We describe and analy...
Antonio J. Conejo, Francisco J. Nogales, Francisco...
ICML
2008
IEEE
16 years 20 days ago
Democratic approximation of lexicographic preference models
Previous algorithms for learning lexicographic preference models (LPMs) produce a "best guess" LPM that is consistent with the observations. Our approach is more democra...
Fusun Yaman, Thomas J. Walsh, Michael L. Littman, ...
ISCAS
2007
IEEE
371views Hardware» more  ISCAS 2007»
15 years 6 months ago
FIR Filter Approximation by IIR Filters Based on Discrete-Time Vector Fitting
— We present a novel way of approximating FIR filters by IIR structures through generalizing the vector fitting (VF) algorithm, popularly used in continuous-time frequency-doma...
Ngai Wong, Chi-Un Lei
SOFSEM
2007
Springer
15 years 6 months ago
Fast Approximate Point Set Matching for Information Retrieval
We investigate randomised algorithms for subset matching with spatial point sets—given two sets of d-dimensional points: a data set T consisting of n points and a pattern P consi...
Raphaël Clifford, Benjamin Sach