Sciweavers

NOCS
2010
IEEE
13 years 10 months ago
Ultra Fine-Grained Run-Time Power Gating of On-chip Routers for CMPs
Hiroki Matsutani, Michihiro Koibuchi, Daisuke Ikeb...
NEW2AN
2010
Springer
13 years 10 months ago
Heuristic Congestion Control for Message Deletion in Delay Tolerant Network
Delay tolerant network (DTN) challenges on large delay of communication, opportunistic and intermittent connectivity so that data can be transferred over vulnerable network. Most r...
Lertluck Leela-amornsin, Hiroshi Esaki
NEW2AN
2010
Springer
13 years 10 months ago
Scalable Video Coding Based on Three-Dimensional Discrete Pseudo Cosine Transform
This paper proposes a new spatial scalable and low-complexity videocompressionalgorithmbasedonmultiplicationfreethree-dimensional discrete pseudo-cosine transform (3-D DPCT). Pract...
Eugeniy Belyaev, Timofey Sukhov, Liu Kai
NETWORKS
2010
13 years 10 months ago
Network flow spanners
Abstract. In this paper, motivated by applications of ordinary (distance) spanners in communication networks and to address such issues as bandwidth constraints on network links, l...
Feodor F. Dragan, Chenyu Yan
NETWORKS
2010
13 years 10 months ago
Complexity of some inverse shortest path lengths problems
The input to an Inverse Shortest Path Lengths Problem (ISPL) consists of a graph G with arc weights, and a collection of source-sink pairs with prescribed distances that do not ne...
Tingting Cui, Dorit S. Hochbaum
NETWORKS
2010
13 years 10 months ago
A mean-variance model for the minimum cost flow problem with stochastic arc costs
This paper considers a minimum cost flow problem where arc costs are uncertain, and the decision maker wishes to minimize both the expected flow cost and the variance of this co...
Stephen D. Boyles, S. Travis Waller
NETWORKS
2010
13 years 10 months ago
Probabilistic models for the Steiner Tree problem
We consider a probabilistic model for the Steiner Tree problem. Under this model the problem is defined in a 2-stage setting over a first-stage complete weighted graph having it...
Vangelis Th. Paschos, Orestis Telelis, Vassilis Zi...
NETWORKS
2010
13 years 10 months ago
Simultaneous embeddings of graphs as median and antimedian subgraphs
Kannan Balakrishnan, Bostjan Bresar, Matjaz Kovse,...
NETWORKS
2010
13 years 10 months ago
Optical index of fault tolerant routings in WDM networks
Maˇnuch and Stacho [7] introduced the problem of designing f-tolerant routings in optical networks, i.e., routings which still satisfy the given requests even if f failures occur...
Stéphane Bessy, Clément Lepelletier