558 search results - page 55 / 112 » Trees and Matchings |
118
click to vote
IPCV
2008
15 years 1 months ago
2008
Most of the existing image retrieval systems take the textual query from the user and utilize the metadata associated with the database images to retrieve the result. However, the...
DAC
1995
ACM
15 years 3 months ago
1995
ACM
We study the minimum-costbounded-skewrouting tree (BST) problem under the linear delay model. This problem captures several engineering tradeoffs in the design of routing topologi...
SIGMOD
2004
ACM
15 years 12 months ago
2004
ACM
XML is widely praised for its flexibility in allowing repeated and missing sub-elements. However, this flexibility makes it challenging to develop a bulk algebra, which typically ...
ACS
2008
14 years 12 months ago
2008
Abstract Subobject transformation systems (sts) are proposed as a novel formal framework for the analysis of derivations of transformation systems based on the algebraic, double-pu...
CG
2002
Springer
14 years 11 months ago
2002
Springer
The maxn algorithm (Luckhardt and Irani, 1986) for playing multiplayer games is flexible, but there are only limited techniques for pruning maxn game trees. This paper presents oth...