1688 search results - page 95 / 338 » The Complexity of Rationalizing Matchings |
PVLDB
2010
13 years 8 months ago
2010
In a variety of emerging applications one needs to decide whether a graph G matches another Gp, i.e., whether G has a topological structure similar to that of Gp. The traditional ...
ICDAR
2011
IEEE
12 years 9 months ago
2011
IEEE
—We present a multiresolution scheme for symbol representation and recognition based on statistical shape features. We define a symbol as a set of shape points, each of which is...
CORR
2006
Springer
13 years 10 months ago
2006
Springer
Let S = s1, s2, s3, ..., sn be a given vector of n distinct real numbers. The rank of z R with respect to S is defined as the number of elements si S such that si z. We consider...
ICCV
2005
IEEE
15 years 3 days ago
2005
IEEE
Discriminative learning is challenging when examples are sets of features, and the sets vary in cardinality and lack any sort of meaningful ordering. Kernel-based classification m...
WWW
2008
ACM
14 years 11 months ago
2008
ACM
Motivated by several marketplace applications on rapidly growing online social networks, we study the problem of efficient offline matching algorithms for online exchange markets....