10916 search results - page 155 / 2184 » On Constructive Connectives and Systems |
156
click to vote
WDAG
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. We have a new proof of the lower bound that k-set agreement requires f/k + 1 rounds in a synchronous, message-passing model with f crash failures. The proof involves cons...
162
click to vote
ICPADS
2005
IEEE
16 years 4 days ago
2005
IEEE
Virtual infrastructures or backbones in wireless sensor networks reduce the communication overhead and energy consumption. In this paper, we present BackBone Routing (BBR), a nove...
189
click to vote
PAMI
2006
15 years 6 months ago
2006
We provide evidence that non-linear dimensionality reduction, clustering and data set parameterization can be solved within one and the same framework. The main idea is to define ...
210
click to vote
TJS
2002
15 years 6 months ago
2002
Abstract-The current trend in constructing high-performance computing systems is to connect a large number of machines via a fast interconnect or a large-scale network such as the ...
221
click to vote
DIALM
2003
ACM
15 years 11 months ago
2003
ACM
We propose a novel localized algorithm that constructs a bounded degree and planar spanner for wireless ad hoc networks modeled by unit disk graph (UDG). Every node only has to kn...