155 search results - page 13 / 31 » Dynamic Succinct Ordered Trees |
ECCV
1998
Springer
15 years 11 months ago
1998
Springer
?It is well-known that the problem of matching two relational structures can be posed as an equivalent problem of finding a maximal clique in a (derived) ?association graph.? Howev...
HIPEAC
2009
Springer
15 years 2 months ago
2009
Springer
Abstract. In transactional memory, aborted transactions reduce performance, and waste computing resources. Ideally, concurrent execution of transactions should be optimally ordered...
AMC
2007
14 years 9 months ago
2007
This paper presents a new dynamic generating graphical model for point-sets matching. The existing algorithms on graphical models proved to be quite robust to noise but are suscep...
DEXA
2010
Springer
14 years 9 months ago
2010
Springer
Given a spatio-temporal network (ST network) whose edge properties vary with time, a time-sub-interval minimum spanning tree (TSMST) is a collection of distinct minimum spanning t...
61
Voted
INFOCOM
2008
IEEE
15 years 4 months ago
2008
IEEE
Abstract—In order to improve scalability and reduce maintenance overhead for structured Peer-to-Peer systems, researchers design optimal architectures with constant degree and lo...