Sciweavers

2912 search results - page 163 / 583
» Logistic Model Trees
Sort
View
121
Voted
QEST
2008
IEEE
15 years 10 months ago
A Parallel and Distributed Analysis Pipeline for Performance Tree Evaluation
Performance Trees are a unifying framework for the specification of performance queries involving measures and requirements. This paper describes an evaluation environment for Pe...
Darren K. Brien, Nicholas J. Dingle, William J. Kn...
111
Voted
SWAT
2004
Springer
108views Algorithms» more  SWAT 2004»
15 years 9 months ago
Pointed Binary Encompassing Trees
For n disjoint line segments in the plane we can construct a binary encompassing tree such that every vertex is pointed, what’s more, at every segment endpoint all incident edges...
Michael Hoffmann, Bettina Speckmann, Csaba D. T&oa...
116
Voted
SPIRE
2001
Springer
15 years 8 months ago
On Compression of Parse Trees
We consider methods for compressing parse trees, especially techniques based on statistical modeling. We regard a sequence of productions corresponding to a suffix of the path fr...
Jorma Tarhio
135
Voted
INFOCOM
1999
IEEE
15 years 8 months ago
Resource Allocation in a Multicast Tree
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...
Murali S. Kodialam, Steven H. Low
115
Voted
FOIKS
2010
Springer
15 years 7 months ago
On the Existence of Armstrong Data Trees for XML Functional Dependencies
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 ...
Sven Hartmann, Henning Köhler, Thu Trinh