36887 search results - page 73 / 7378 » Are We All In the Same |
TALG
2008
13 years 9 months ago
2008
We present simple, fully dynamic and kinetic data structures, which are variants of a dynamic two-dimensional range tree, for maintaining the closest pair and all nearest neighbors...
PODC
1999
ACM
14 years 1 months ago
1999
ACM
We provide characterizations of the relations that can be computed with arbitrary knowledge on networks where all processors use the same algorithm and start from the same state (...
DM
2007
13 years 9 months ago
2007
We prove that the acyclic chromatic index a (G) 6 for all graphs with girth at least 9. We extend the same method to obtain a bound of 4.52 with the girth requirement g 220. We al...
WDAG
2005
Springer
14 years 2 months ago
2005
Springer
Atomic Broadcast, used for example in state machine replication, requires three communication steps. Optimistic Atomic Broadcast requires only two steps if all processes receive m...
MVA
1998
13 years 10 months ago
1998
common features in all learning objects only. The In this paper, we propose two methods of clustering learning images to generate prototypes automatically for object recognition. O...