Sciweavers

2913 search results - page 48 / 583
» How Much to Copy
Sort
View
SOSP
2007
ACM
14 years 4 months ago
Attested append-only memory: making adversaries stick to their word
Researchers have made great strides in improving the fault tolerance of both centralized and replicated systems against arbitrary (Byzantine) faults. However, there are hard limit...
Byung-Gon Chun, Petros Maniatis, Scott Shenker, Jo...
SDMW
2004
Springer
14 years 1 months ago
Using Delay to Defend Against Database Extraction
For many data providers, the “crown jewels” of their business are the data that they have organized. If someone could copy their entire database, it would be a competitive cata...
Magesh Jayapandian, Brian D. Noble, James W. Micke...
UAI
2003
13 years 9 months ago
Marginalizing Out Future Passengers in Group Elevator Control
Group elevator scheduling is an NP-hard sequential decision-making problem with unbounded state spaces and substantial uncertainty. Decision-theoretic reasoning plays a surprising...
Daniel Nikovski, Matthew Brand
EUROSYS
2009
ACM
14 years 4 months ago
Isolating web programs in modern browser architectures
Many of today’s web sites contain substantial amounts of client-side code, and consequently, they act more like programs than simple documents. This creates robustness and perfo...
Charles Reis, Steven D. Gribble
VLDB
2005
ACM
118views Database» more  VLDB 2005»
14 years 1 months ago
Selectivity Estimation for Fuzzy String Predicates in Large Data Sets
Many database applications have the emerging need to support fuzzy queries that ask for strings that are similar to a given string, such as “name similar to smith” and “tele...
Liang Jin, Chen Li