393 search results - page 31 / 79 » Approximation Algorithm for Directed Telephone Multicast Pro... |
CONIELECOMP
2005
IEEE
15 years 5 months ago
2005
IEEE
The approximate searching problem on compressed text tries to find all the matches of a pattern in a compressed text, without decompressing it and considering that the match of th...
116
click to vote
JCP
2007
14 years 11 months ago
2007
Abstract— We describe a general method to transform a non-Markovian sequential decision problem into a supervised learning problem using a K-bestpaths algorithm. We consider an a...
128
click to vote
CORR
2011
Springer
14 years 6 months ago
2011
Springer
Abstract—The capacity of multiuser networks has been a longstanding problem in information theory. Recently, Avestimehr et al. have proposed a deterministic network model to appr...
104
click to vote
WAOA
2005
Springer
15 years 5 months ago
2005
Springer
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set...
DIALM
2008
ACM
15 years 1 months ago
2008
ACM
We consider the Maximum Integral Flow with Energy Constraints problem: given a directed graph G = (V, E) with edge-weights {w(e) : e E} and node battery capacities {b(v) : v V }...