Sciweavers

275 search results - page 31 / 55
» Using Randomized Caches in Probabilistic Real-Time Systems
Sort
View
SMA
1993
ACM
107views Solid Modeling» more  SMA 1993»
13 years 11 months ago
Relaxed parametric design with probabilistic constraints
: Parametric design is an important modeling paradigm in computer aided design. Relationships (constraints) between the degrees of freedom (DOFs) of the model, instead of the DOFs ...
Yacov Hel-Or, Ari Rappoport, Michael Werman
ATAL
2009
Springer
14 years 2 months ago
Analyzing the performance of randomized information sharing
In large, collaborative, heterogeneous teams, team members often collect information that is useful to other members of the team. Recognizing the utility of such information and d...
Prasanna Velagapudi, Oleg A. Prokopyev, Katia P. S...
ICDE
2008
IEEE
124views Database» more  ICDE 2008»
14 years 9 months ago
Randomized Synopses for Query Assurance on Data Streams
The overwhelming flow of information in many data stream applications forces many companies to outsource to a third-party the deployment of a Data Stream Management System (DSMS) f...
Ke Yi, Feifei Li, Marios Hadjieleftheriou, George ...
TVLSI
2010
13 years 2 months ago
C-Pack: A High-Performance Microprocessor Cache Compression Algorithm
Microprocessor designers have been torn between tight constraints on the amount of on-chip cache memory and the high latency of off-chip memory, such as dynamic random access memor...
Xi Chen, Lei Yang, Robert P. Dick, Li Shang, Haris...
VLDB
1999
ACM
151views Database» more  VLDB 1999»
13 years 12 months ago
Cache Conscious Indexing for Decision-Support in Main Memory
As random access memory gets cheaper, it becomes increasingly affordable to build computers with large main memories. We consider decision support workloads within the context of...
Jun Rao, Kenneth A. Ross