Sciweavers

6300 search results - page 1142 / 1260
» We have it easy, but do we have it right
Sort
View
ADBIS
2000
Springer
188views Database» more  ADBIS 2000»
15 years 5 months ago
Algorithms for Rewriting Aggregate Queries Using Views
Queries involving aggregation are typical in a number of database research areas, such as data warehousing, global information systems and mobile computing. One of the main ideas ...
Sara Cohen, Werner Nutt, Alexander Serebrenik
110
Voted
RTSS
1999
IEEE
15 years 5 months ago
Design and Implementation of Statistical Rate Monotonic Scheduling in KURT Linux
Statistical Rate Monotonic Scheduling (SRMS) is a generalization of the classical RMS results of Liu and Layland [LL73] for periodic tasks with highly variable execution times and...
Alia Atlas, Azer Bestavros
ICDAR
1997
IEEE
15 years 5 months ago
The Function of Documents
The purpose of a document is to facilitate the transfer of information from its author to its readers. It is the author’s job to design the document so that the information it c...
David S. Doermann, Azriel Rosenfeld, Ehud Rivlin
ISCA
1996
IEEE
130views Hardware» more  ISCA 1996»
15 years 5 months ago
Informing Memory Operations: Providing Memory Performance Feedback in Modern Processors
Memory latency is an important bottleneck in system performance that cannot be adequately solved by hardware alone. Several promising software techniques have been shown to addres...
Mark Horowitz, Margaret Martonosi, Todd C. Mowry, ...
SPAA
1996
ACM
15 years 5 months ago
Constant Time per Edge is Optimal on Rooted Tree Networks
We analyze the relationship between the expected packet delay in rooted tree networks and the distribution of time needed for a packet to cross an edge using convexity-based stoch...
Michael Mitzenmacher
« Prev « First page 1142 / 1260 Last » Next »