2370 search results - page 109 / 474 » The Characterization of Data-Accumulating Algorithms |
ICPP
1999
IEEE
15 years 2 months ago
1999
IEEE
The vector-clock size necessary to characterize causality in a distributed computation is bounded by the dimension of the partial order induced by that computation. In an arbitrar...
SODA
2004
ACM
14 years 11 months ago
2004
ACM
We solve an open problem posed by Eppstein in 1995 [14, 15] and re-enforced by Grohe [16, 17] concerning locally bounded treewidth in minor-closed families of graphs. A graph has ...
113
click to vote
3DOR
2008
14 years 11 months ago
2008
We present an automatic face recognition approach, which relies on the analysis of the three-dimensional facial surface. The proposed approach consists of two basic steps, namely ...
CORR
2008
Springer
14 years 10 months ago
2008
Springer
Abstract--This paper considers the noncooperative maximization of mutual information in the vector Gaussian interference channel in a fully distributed fashion via game theory. Thi...
INFORMATICALT
2006
14 years 10 months ago
2006
Abstract. The asynchronous techniques that exist within the programming with distributed constraints are characterized by the occurrence of the nogood values during the search for ...