4744 search results - page 248 / 949 » Connected Computing |
120
click to vote
WIOPT
2006
IEEE
15 years 9 months ago
2006
IEEE
— We introduce and discuss a novel link model that incorporates both uncertainty in the fading coefficients and the node distances for ad hoc networks with randomly placed nodes...
143
click to vote
CIE
2005
Springer
15 years 9 months ago
2005
Springer
We define a variant of the standard Kripke semantics for intuitionistic logic, motivated by the connection between constructive logic and the Medvedev lattice. We show that while...
119
click to vote
EURODAC
1995
IEEE
15 years 7 months ago
1995
IEEE
The presented fault model uniquely describes all structural changes in the transistor net list that can be caused by spot defects, including faults that connect more than two nets...
117
click to vote
DM
2007
15 years 3 months ago
2007
We present an algorithm that determines the prime factors of connected graphs with respect to the Cartesian product in linear time and space. This improves a result of Aurenhammee...
123
click to vote
ICIP
2009
IEEE
15 years 1 months ago
2009
IEEE
This article introduces a fast algorithm for Connected Component Labeling of binary images called Light Speed Labeling. It is segment-based and a line-relative labeling that was e...