2553 search results - page 135 / 511 » Modeling Trees with Hypertextures |
INFOCOM
1999
IEEE
15 years 2 months ago
1999
IEEE
We consider how to allocate bandwidth in a multicast tree so as to optimize some global measure of performance. In our model each receiver has a budget to be used for bandwidth res...
FOIKS
2010
Springer
15 years 1 months ago
2010
Springer
Armstrong databases are a popular tool in example-based database design. An Armstrong database for a given constraint set from a fixed constraint class Z satisfies precisely those ...
ACL
2004
14 years 11 months ago
2004
This paper proposes a new approach for coreference resolution which uses the Bell tree to represent the search space and casts the coreference resolution problem as finding the be...
HICSS
2008
IEEE
14 years 10 months ago
2008
IEEE
Given an edge-weighted tree T, a k-trunk is a subtree Tk with k leaves in T which minimizes the sum of the distances of all vertices in T from Tk plus the weight of Tk. In this pa...
SEFM
2007
IEEE
15 years 4 months ago
2007
IEEE
We model security protocols as a game tree using concepts of game semantics. Using this model we ascribe semantics to protocols written in the standard simple arrow notation. Acco...