Sciweavers

409 search results - page 30 / 82
» Considering Time in Designing Large-Scale Systems for Scient...
Sort
View
ICDCN
2011
Springer
14 years 3 months ago
Load Balanced Scalable Byzantine Agreement through Quorum Building, with Full Information
We address the problem of designing distributed algorithms for large scale networks that are robust to Byzantine faults. We consider a message passing, full information model: the ...
Valerie King, Steven Lonargan, Jared Saia, Amitabh...
SPAA
2005
ACM
15 years 5 months ago
Dynamic page migration with stochastic requests
The page migration problem is one of subproblems of data management in networks. It occurs in a distributed network of processors sharing one indivisible memory page of size D. Du...
Marcin Bienkowski
ICPR
2008
IEEE
16 years 22 days ago
Solving quadratically constrained geometrical problems using lagrangian duality
In this paper we consider the problem of solving different pose and registration problems under rotational constraints. Traditionally, methods such as the iterative closest point ...
Carl Olsson, Anders Eriksson
ICDS
2009
IEEE
15 years 6 months ago
Security and User Guidelines for the Design of the Future Networked Systems
—Emergence of new networking technologies and paradigms provides users multitude of ways to communicate with each others and exchange information irrespective of time and place. ...
Seppo Heikkinen, Sari Kinnari, Kari Heikkinen
EDBT
2010
ACM
152views Database» more  EDBT 2010»
15 years 2 months ago
Feedback-based annotation, selection and refinement of schema mappings for dataspaces
The specification of schema mappings has proved to be time and resource consuming, and has been recognized as a critical bottleneck to the large scale deployment of data integrati...
Khalid Belhajjame, Norman W. Paton, Suzanne M. Emb...