Sciweavers

4843 search results - page 942 / 969
» The Shortcut Problem - Complexity and Approximation
Sort
View
DCC
2000
IEEE
15 years 10 months ago
Summary Structures for Frequency Queries on Large Transaction Sets
As large-scale databases become commonplace, there has been signi cant interest in mining them for commercial purposes. One of the basic tasks that underlies many of these mining ...
Dow-Yung Yang, Akshay Johar, Ananth Grama, Wojciec...
INFOCOM
2000
IEEE
15 years 10 months ago
Broadcast Disks with Polynomial Cost Functions
— In broadcast disk systems, information is broadcasted in a shared medium. When a client needs an item from the disk, it waits until that item is broadcasted. The fundamental al...
Amotz Bar-Noy, Boaz Patt-Shamir, Igor Ziper
ISCC
2000
IEEE
156views Communications» more  ISCC 2000»
15 years 10 months ago
Inverse Multiplexing for ATM. Technical Operation, Applications and Performance Evaluation Study
-- In a WAN established infrastructure, one of the main problems ATM network planners and users face, when greater than T1/E1 bandwidth is required, is the high cost associated to ...
Marcos Postigo-Boix, Mónica Aguilar-Igartua...
SACMAT
2010
ACM
15 years 10 months ago
Mining roles with noisy data
There has been increasing interest in automatic techniques for generating roles for role based access control, a process known as role mining. Most role mining approaches assume t...
Ian Molloy, Ninghui Li, Yuan (Alan) Qi, Jorge Lobo...
RTSS
1999
IEEE
15 years 10 months ago
Deriving Deadlines and Periods for Real-Time Update Transactions
Typically, temporal validity of real-time data is maintained by periodic update transactions. In this paper, we examine the problem of period and deadline assignment for these upda...
Ming Xiong, Krithi Ramamritham