226 search results - page 23 / 46 » Parsing with the Shortest Derivation |
ICDCS
2005
IEEE
14 years 3 months ago
2005
IEEE
We study how a server may disseminate a large volume of data to a set of clients in the shortest possible time. We first consider a cooperative scenario where clients are willing...
ICCCN
2007
IEEE
14 years 1 months ago
2007
IEEE
Abstract-- Elastic applications are primarily interested in minimal delay achievable for their messages under current network load. In this paper, we investigate how to transmit su...
ESOP
2006
Springer
14 years 1 months ago
2006
Springer
We present and solve a path optimization problem on programs. Given a set of program nodes, called critical nodes, we find a shortest path through the program's control flow g...
CORR
2007
Springer
13 years 9 months ago
2007
Springer
We introduce the (private) entropy of a directed graph (in a new network coding sense) as well as a number of related concepts. We show that the entropy of a directed graph is ide...
TIP
1998
13 years 9 months ago
1998
—In this paper, we present fast and efficient methods for the lossy encoding of object boundaries that are given as eight-connect chain codes. We approximate the boundary by a p...