Sciweavers

628 search results - page 29 / 126
» On the Twofish Key Schedule
Sort
View
QSHINE
2009
IEEE
14 years 2 months ago
On-Demand Node Reclamation and Replacement for Guaranteed Area Coverage in Long-Lived Sensor Networks
To achieve required sensing coverage for a very long period of time is an important and challenging problem in sensor network design. Recently, Tong et al. have proposed a node rep...
Bin Tong, Zi Li, Guiling Wang, Wensheng Zhang
CORR
2010
Springer
126views Education» more  CORR 2010»
13 years 8 months ago
Towards Providing Low-Risk and Economically Feasible Network Data Transfer Services
: - In the first part of this paper we present the first steps towards providing low-risk and economically feasible network data transfer services. We introduce three types of data...
Mugurel Ionut Andreica, Vasile Deac, Stelian Tipa
ORL
1998
68views more  ORL 1998»
13 years 7 months ago
A fast bipartite network flow algorithm for selective assembly
Bipartite network flow problems naturally arise in applications such as selective assembly and preemptive scheduling. This paper presents fast algorithms for these problems that ...
Satoru Iwata, Tomomi Matsui, S. Thomas McCormick
SIGMETRICS
2002
ACM
105views Hardware» more  SIGMETRICS 2002»
13 years 7 months ago
Modeling and analysis of dynamic coscheduling in parallel and distributed environments
Scheduling in large-scale parallel systems has been and continues to be an important and challenging research problem. Several key factors, including the increasing use of off-the...
Mark S. Squillante, Yanyong Zhang, Anand Sivasubra...
JVCIR
2008
110views more  JVCIR 2008»
13 years 8 months ago
Video quality and system resources: Scheduling two opponents
In this article we present three key ideas which together form a flexible framework for maximizing user-perceived quality under given resources with modern video codecs (H.264). F...
Michael Roitzsch, Martin Pohlack