1327 search results - page 58 / 266 » Path following algorithm for the graph matching problem |
133
click to vote
TAMC
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. In this paper, we give streaming algorithms for some problems which are known to be in deterministic log-space, when the number of passes made on the input is unbounded. ...
131
click to vote
SIGMOD
2003
ACM
16 years 1 months ago
2003
ACM
Most previous solutions to the schema matching problem rely in some fashion upon identifying "similar" column names in the schemas to be matched, or by recognizing commo...
124
click to vote
ICPR
2008
IEEE
15 years 8 months ago
2008
IEEE
To automatically register foreground target in cluttered images, we present a novel hierarchical graph representation and a stochastic computing strategy in Bayesian framework. Th...
102
click to vote
ICRA
2010
IEEE
15 years 7 days ago
2010
IEEE
— The DPC algorithm developed in our previous work is an efficient way of computing optimal trajectories for multiple robots in a distributed fashion with timeparameterized cons...
124
click to vote
ICDM
2008
IEEE
15 years 8 months ago
2008
IEEE
Nonnegative matrix factorization (NMF) is a versatile model for data clustering. In this paper, we propose several NMF inspired algorithms to solve different data mining problems....