4137 search results - page 169 / 828 » On the number of matchings of a tree |
180
click to vote
HICSS
2008
IEEE
15 years 6 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...
170
click to vote
KBS
2002
15 years 6 months ago
2002
The automatic induction of classification rules from examples in the form of a decision tree is an important technique used in data mining. One of the problems encountered is the o...
173
click to vote
AAAI
2012
13 years 9 months ago
2012
In many dynamic matching applications—especially high-stakes ones—the competitive ratios of prior-free online algorithms are unacceptably poor. The algorithm should take distr...
193
click to vote
DEBS
2007
ACM
15 years 10 months ago
2007
ACM
Content-based publish/subscribe systems allow matching the content of events with predicates in the subscriptions. However, most existing systems only allow a limited set of opera...
189
click to vote
ICDE
2012
IEEE
13 years 9 months ago
2012
IEEE
—Sequence analysis is very important in our daily life. Typically, each sequence is associated with an ordered list of elements. For example, in a movie rental application, a cus...