Sciweavers

2446 search results - page 413 / 490
» Characterizing the Performance of
Sort
View
APPROX
2000
Springer
107views Algorithms» more  APPROX 2000»
14 years 2 months ago
Online real-time preemptive scheduling of jobs with deadlines
In this paper, we derive bounds on performance guarantees of online algorithms for real-time preemptive scheduling of jobs with deadlines on K machines when jobs are characterized ...
Bhaskar DasGupta, Michael A. Palis
ICCV
1998
IEEE
14 years 2 months ago
Condensing Image Databases when Retrieval is Based on Non-Metric Distances
One of the key problems in appearance-based vision is understanding how to use a set of labeled images to classify new images. Classification systems that can model human performa...
David W. Jacobs, Daphna Weinshall, Yoram Gdalyahu
RAID
1999
Springer
14 years 2 months ago
Audit logs: to keep or not to keep?
We approached this line of inquiry by questioning the conventional wisdom that audit logs are too large to be analyzed and must be reduced and filtered before the data can be anal...
Christopher Wee
IPPS
1998
IEEE
14 years 2 months ago
Runtime Support for Virtual BSP Computer
Abstract. Several computing environments including wide area networks and nondedicated networks of workstations are characterized by frequent unavailability of the participating ma...
Mohan V. Nibhanupudi, Boleslaw K. Szymanski
RTAS
1997
IEEE
14 years 2 months ago
Exploiting Redundancy for Timeliness in TCP Boston
While ATM bandwidth-reservation techniques are able to o er the guarantees necessary for the delivery of real-time streams in many applications (e.g. live audio and video), they s...
Azer Bestavros, Gitae Kim