1813 search results - page 93 / 363 » Calculi of Approximation Spaces |
159
click to vote
SIAMCOMP
2000
15 years 6 months ago
2000
We present a linear programming-based method for nding \gadgets", i.e., combinatorial structures reducing constraints of one optimization problem to constraints of another. A...
172
click to vote
SIAMSC
2010
15 years 1 months ago
2010
In this paper we proposed quasi-Newton and limited memory quasi-Newton methods for objective functions defined on Grassmannians or a product of Grassmannians. Specifically we defin...
176
click to vote
ICDE
2011
IEEE
14 years 10 months ago
2011
IEEE
— An approximate string query is to find from a collection of strings those that are similar to a given query string. Answering such queries is important in many applications su...
168
click to vote
AICOM
2006
15 years 6 months ago
2006
This paper introduces a compact representation which helps to avoid the exponential blow-up in space of the Least Common Subsumer (lcs) of two ALEconcept descriptions. Based on th...
201
click to vote
CVPR
2004
IEEE
16 years 8 months ago
2004
IEEE
Weighted graph matching is a good way to align a pair of shapes represented by a set of descriptive local features; the set of correspondences produced by the minimum cost matchin...