Sciweavers

1399 search results - page 118 / 280
» New Algorithms for k-Center and Extensions
Sort
View
COMCOM
2006
75views more  COMCOM 2006»
13 years 9 months ago
Finding a least hop(s) path subject to multiple additive constraints
In this paper, for the purpose of saving network resources, we first introduce and investigate a new problem referred to as the least hop(s) multiple additively constrained path (...
Gang Cheng, Nirwan Ansari
JUCS
2007
105views more  JUCS 2007»
13 years 9 months ago
Graded Sparse Graphs and Matroids
: Sparse graphs and their associated matroids play an important role in rigidity theory, where they capture the combinatorics of some families of generic minimally rigid structures...
Audrey Lee, Ileana Streinu, Louis Theran
MTA
2002
110views more  MTA 2002»
13 years 8 months ago
Fundamentals of Scheduling and Performance of Video Tape Libraries
Robotic tape libraries are popular for applications with very high storage requirements, such as video servers. Here, we study the throughput of a tape library system, we design a...
Costas Georgiadis, Peter Triantafillou, Christos F...
IH
2010
Springer
13 years 7 months ago
Short Collusion-Secure Fingerprint Codes against Three Pirates
In this article, we propose a new construction of probabilistic collusion-secure fingerprint codes against up to three pirates and give a theoretical security evaluation. Our pira...
Koji Nuida
ICDE
1999
IEEE
126views Database» more  ICDE 1999»
14 years 10 months ago
Improving the Access Time Performance of Serpentine Tape Drives
This paper presents a general model for estimating access times of serpentine tape drives. The model is used to schedule I/O requests in order to minimize the total access time. W...
Olav Sandstå, Roger Midtstraum