5473 search results - page 740 / 1095 » On the graph isomorphism problem |
134
click to vote
NAACL
2007
15 years 8 months ago
2007
We relate the problem of finding the best application of a Synchronous ContextFree Grammar (SCFG) rule during parsing to a Markov Random Field. This representation allows us to u...
217
click to vote
ACST
2006
15 years 8 months ago
2006
Consider the problem of membership query for a given partially ordered set. We devise a greedy algorithm which can produce near-optimal search strategies. Rigorous analysis has be...
172
click to vote
SODA
2001
ACM
15 years 8 months ago
2001
ACM
We give an implementation of the Goemans-Williamson clustering procedure which is at the core of several approximation algorithms including those for Generalized Steiner Trees, Pr...
164
click to vote
MVA
1998
15 years 8 months ago
1998
An efficient matching method for segment-based stereo vision is proposed. A potential matching graph which describes the connectivity between candidate matching pairs of segments ...
184
click to vote
EOR
2006
15 years 6 months ago
2006
: All information systems have to be protected. As the number of information objects and the number of users increase the task of information system's protection becomes more ...