Sciweavers

495 search results - page 15 / 99
» Data exchange: computing cores in polynomial time
Sort
View
COLCOM
2005
IEEE
14 years 10 days ago
Providing both scale and security through a single core probabilistic protocol
Distributed systems are typically designed for scale and performance first, which makes it difficult to add security later without affecting the original properties. This paper ...
Ramsés Morales, Indranil Gupta
ICDCS
2009
IEEE
14 years 1 months ago
On Optimal Concurrency Control for Optimistic Replication
Concurrency control is a core component in optimistic replication systems. To detect concurrent updates, the system associates each replicated object with metadata, such as, versi...
Weihan Wang, Cristiana Amza
ESA
2004
Springer
120views Algorithms» more  ESA 2004»
14 years 3 days ago
Solving Geometric Covering Problems by Data Reduction
We consider a scenario where stops are to be placed along an already existing public transportation network in order to improve its attractiveness for the customers. The core probl...
Steffen Mecke, Dorothea Wagner
BMCBI
2010
189views more  BMCBI 2010»
13 years 6 months ago
Efficient parallel and out of core algorithms for constructing large bi-directed de Bruijn graphs
Background: Assembling genomic sequences from a set of overlapping reads is one of the most fundamental problems in computational biology. Algorithms addressing the assembly probl...
Vamsi Kundeti, Sanguthevar Rajasekaran, Hieu Dinh,...
AUSAI
2006
Springer
13 years 10 months ago
Voting Massive Collections of Bayesian Network Classifiers for Data Streams
Abstract. We present a new method for voting exponential (in the number of attributes) size sets of Bayesian classifiers in polynomial time with polynomial memory requirements. Tra...
Remco R. Bouckaert