Sciweavers

822 search results - page 49 / 165
» Descendants in Increasing Trees
Sort
View
EUROMICRO
1999
IEEE
14 years 1 days ago
Software Synthesis for System Level Design Using Process Execution Trees
Software synthesis for system level design languages becomes feasible because the current technology, pricing and application trends will most likely alleviate the industrial empha...
Leo J. van Bokhoven, Jeroen Voeten, Marc Geilen
INFOCOM
1999
IEEE
14 years 21 hour ago
Optimal Partition of QoS Requirements on Unicast Paths and Multicast Trees
We investigate the problem of optimal resource allocation for end-to-end QoS requirements on unicast paths and multicast trees. Specifically, we consider a framework in which reso...
Dean H. Lorenz, Ariel Orda
KDD
1995
ACM
148views Data Mining» more  KDD 1995»
13 years 11 months ago
Learning Arbiter and Combiner Trees from Partitioned Data for Scaling Machine Learning
Knowledge discovery in databases has become an increasingly important research topic with the advent of wide area network computing. One of the crucial problems we study in this p...
Philip K. Chan, Salvatore J. Stolfo
CATS
1998
13 years 9 months ago
Finding the k Most Vital Edges with Respect to Minimum Spanning Trees for k=2 and 3
Let G(V, E) be a weighted, undirected, connected simple graph with n vertices and m edges. The k most vital edge problem with respect to minimum spanning trees is to find a set S o...
Weifa Liang, George Havas
PAMI
2006
145views more  PAMI 2006»
13 years 7 months ago
Convergent Tree-Reweighted Message Passing for Energy Minimization
Algorithms for discrete energy minimization are of fundamental importance in computer vision. In this paper we focus on the recent technique proposed by Wainwright et al. [33] - t...
Vladimir Kolmogorov