Sciweavers

7758 search results - page 420 / 1552
» On the Number of Distributive Lattices
Sort
View
PODS
2007
ACM
203views Database» more  PODS 2007»
16 years 7 months ago
Decision trees for entity identification: approximation algorithms and hardness results
We consider the problem of constructing decision trees for entity identification from a given relational table. The input is a table containing information about a set of entities...
Venkatesan T. Chakaravarthy, Vinayaka Pandit, Samb...
DEBS
2007
ACM
15 years 10 months ago
SpiderCast: a scalable interest-aware overlay for topic-based pub/sub communication
We introduce SpiderCast, a distributed protocol for constructing scalable churn-resistant overlay topologies for supporting decentralized topic-based pub/sub communication. Spider...
Gregory Chockler, Roie Melamed, Yoav Tock, Roman V...
CRYPTO
1987
Springer
87views Cryptology» more  CRYPTO 1987»
15 years 10 months ago
How to Make Replicated Data Secure
Many distributed systems manage some form of long-lived data, such as files or data bases. The performance and fault-tolerance of such systems may be enhanced if the repositories ...
Maurice Herlihy, J. D. Tygar
CCS
2008
ACM
15 years 8 months ago
A general model of probabilistic packet marking for IP traceback
In this paper, we model Probabilistic Packet Marking (PPM) schemes for IP traceback as an identification problem of a large number of markers. Each potential marker is associated ...
Liming Lu, Mun Choon Chan, Ee-Chien Chang
MICRO
2010
IEEE
146views Hardware» more  MICRO 2010»
15 years 4 months ago
The ZCache: Decoupling Ways and Associativity
The ever-increasing importance of main memory latency and bandwidth is pushing CMPs towards caches with higher capacity and associativity. Associativity is typically improved by in...
Daniel Sanchez, Christos Kozyrakis