Sciweavers

2110 search results - page 76 / 422
» What is the complexity of a distributed computing system
Sort
View
IDA
2011
Springer
14 years 11 months ago
Ubiquitous Knowledge Discovery
Ubiquitous Knowledge Discovery is a new research area at the intersection of machine learning and data mining with mobile and distributed systems. In this paper the main character...
João Gama, Michael May
142
Voted
CONCUR
1999
Springer
15 years 8 months ago
Validating Firewalls in Mobile Ambients
Abstract. The ambient calculus is a calculus of computation that allows active processes (mobile ambients) to move between sites. A firewall is said to be protective whenever it d...
Flemming Nielson, Hanne Riis Nielson, René ...
NSDI
2008
15 years 6 months ago
DieCast: Testing Distributed Systems with an Accurate Scale Model
Large-scale network services can consist of tens of thousands of machines running thousands of unique software configurations spread across hundreds of physical networks. Testing ...
Diwaker Gupta, Kashi Venkatesh Vishwanath, Amin Va...
BMCBI
2005
131views more  BMCBI 2005»
15 years 4 months ago
Critical evaluation of the JDO API for the persistence and portability requirements of complex biological databases
Background: Complex biological database systems have become key computational tools used daily by scientists and researchers. Many of these systems must be capable of executing on...
Marko Srdanovic, Ulf Schenk, Michael Schwieger, Fa...
STOC
1989
ACM
117views Algorithms» more  STOC 1989»
15 years 8 months ago
On the Theory of Average Case Complexity
This paper takes the next step in developing the theory of average case complexity initiated by Leonid A Levin. Previous works Levin 84, Gurevich 87, Venkatesan and Levin 88] have...
Shai Ben-David, Benny Chor, Oded Goldreich, Michae...