Sciweavers

9997 search results - page 256 / 2000
» The case for crowd computing
Sort
View
STOC
1994
ACM
134views Algorithms» more  STOC 1994»
15 years 10 months ago
A coding theorem for distributed computation
Shannon's Coding Theorem shows that in order to reliably transmit a message of T bits over a noisy communication channel, only a constant slowdown factor is necessary in the ...
Sridhar Rajagopalan, Leonard J. Schulman
COMPGEOM
2001
ACM
15 years 10 months ago
Computing a 3-dimensional cell in an arrangement of quadrics: exactly and actually!
We present two approaches to the problem of calculating a cell in a 3-dimensional arrangement of quadrics. The first approach solves the problem using rational arithmetic. It work...
Nicola Geismann, Michael Hemmer, Elmar Schöme...
IJNSEC
2008
88views more  IJNSEC 2008»
15 years 6 months ago
Security Requirements for RFID Computing Systems
Many security and privacy protocols for RFID systems have been proposed [8, 13, 19, 20]. In most cases these protocols are evaluated in terms of security based on some model. Ofte...
Xiaolan Zhang 0003, Brian King
VLDB
1992
ACM
93views Database» more  VLDB 1992»
15 years 10 months ago
A Method for Change Computation in Deductive Databases
Change computation is an essential component in several capabilities of a deductive database,such as integrity constraints checking, materialized view maintenanceandcondition moni...
Toni Urpí, Antoni Olivé
IMF
2007
15 years 8 months ago
A Common Process Model for Incident Response and Computer Forensics
: Incident Response and Computer Forensics are two areas with similar goals but distinct process models. While in both cases the goal is to investigate computer security incidents ...
Felix C. Freiling, Bastian Schwittay