Sciweavers

4642 search results - page 899 / 929
» Distributed algorithm and reversible network
Sort
View
ESA
2010
Springer
207views Algorithms» more  ESA 2010»
13 years 9 months ago
Budgeted Red-Blue Median and Its Generalizations
In a Content Distribution Network application, we have a set of servers and a set of clients to be connected to the servers. Often there are a few server types and a hard budget co...
MohammadTaghi Hajiaghayi, Rohit Khandekar, Guy Kor...
PAMI
2011
13 years 2 months ago
Greedy Learning of Binary Latent Trees
—Inferring latent structures from observations helps to model and possibly also understand underlying data generating processes. A rich class of latent structures are the latent ...
Stefan Harmeling, Christopher K. I. Williams
EDBT
2011
ACM
225views Database» more  EDBT 2011»
12 years 11 months ago
SeMiTri: a framework for semantic annotation of heterogeneous trajectories
GPS devices allow recording the movement track of the moving object they are attached to. This data typically consists of a stream of spatio-temporal (x,y,t) points. For applicati...
Zhixian Yan, Dipanjan Chakraborty, Christine Paren...
EUROSYS
2008
ACM
14 years 5 months ago
DepSpace: a byzantine fault-tolerant coordination service
The tuple space coordination model is one of the most interesting coordination models for open distributed systems due to its space and time decoupling and its synchronization pow...
Alysson Neves Bessani, Eduardo Adílio Pelin...
SOSP
2005
ACM
14 years 4 months ago
BAR fault tolerance for cooperative services
This paper describes a general approach to constructing cooperative services that span multiple administrative domains. In such environments, protocols must tolerate both Byzantin...
Amitanand S. Aiyer, Lorenzo Alvisi, Allen Clement,...