237 search results - page 36 / 48 » Approximation Algorithms for Minimum Tree Partition |
106
click to vote
KDD
2008
ACM
16 years 1 days ago
2008
ACM
Frequent patterns provide solutions to datasets that do not have well-structured feature vectors. However, frequent pattern mining is non-trivial since the number of unique patter...
92
Voted
JOIN
2007
14 years 11 months ago
2007
This paper is devoted to the following incremental problem. Initially, a graph and a distinguished subset of vertices, called initial group, are given. This group is connected by ...
117
Voted
WADS
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. A central issue in the design of modern communication networks is the provision of Quality-of-Service (QoS) guarantees at the presence of heterogeneous users. For instanc...
99
Voted
CIAC
2006
Springer
15 years 3 months ago
2006
Springer
Virtual private network design in the hose model deals with the reservation of capacities in a weighted graph such that the terminals in this network can communicate with one anoth...
STOC
2002
ACM
15 years 12 months ago
2002
ACM
Let f : {0, 1}n {0, 1} be a boolean function. For 0 let D (f) be the minimum depth of a decision tree for f that makes an error for fraction of the inputs x {0, 1}n . We also ma...