520 search results - page 76 / 104 » Subset Counting in Trees |
101
click to vote
JCO
2007
14 years 11 months ago
2007
Let G = (V, E) be a connected multigraph, whose edges are associated with labels specified by an integer-valued function L : E → N. In addition, each label ℓ ∈ N has a non-...
DATAMINE
2002
14 years 11 months ago
2002
We present an application of inductive concept learning and interactive visualization techniques to a large-scale commercial data mining project. This paper focuses on design and c...
131
click to vote
CGF
2010
14 years 6 months ago
2010
In this paper, we present an efficient approach for the interactive rendering of large-scale urban models, which can be integrated seamlessly with virtual globe applications. Our ...
114
click to vote
TSP
2010
14 years 6 months ago
2010
Sparse graphical models have proven to be a flexible class of multivariate probability models for approximating high-dimensional distributions. In this paper, we propose techniques...
104
click to vote
SODA
2012
ACM
13 years 2 months ago
2012
ACM
The Directed Steiner Tree (DST) problem is a cornerstone problem in network design. We focus on the generalization of the problem with higher connectivity requirements. The proble...