706 search results - page 67 / 142 » Efficient Algorithms for k -Disjoint Paths Problems on DAGs |
ICETET
2009
IEEE
14 years 2 months ago
2009
IEEE
: Optical Burst Switching is a promising technology in Optical Network. Scheduling of data burst in data channels in an optimal way is one of a key problem in Optical Burst Switche...
WIOPT
2010
IEEE
13 years 5 months ago
2010
IEEE
Scheduling of transmissions is one of the most fundamental problems in the context of wireless networks. In this article, we consider the problem of computing power efficient sched...
ICDE
2010
IEEE
14 years 7 months ago
2010
IEEE
A fundamental problem in XML query processing is tree pattern query (TPQ) matching which computes all data instances in an XML database that match an input TPQ. There is a lot of r...
KDD
2008
ACM
14 years 8 months ago
2008
ACM
In this paper, we propose a set of novel regression-based approaches to effectively and efficiently summarize frequent itemset patterns. Specifically, we show that the problem of ...
BMCBI
2010
13 years 7 months ago
2010
Background: Chow and Liu showed that the maximum likelihood tree for multivariate discrete distributions may be found using a maximum weight spanning tree algorithm, for example K...