2924 search results - page 108 / 585 » Lower Bounds in Distributed Computing |
124
Voted
Publication
This study investigates fast detection of the left ventricle (LV) endo- and epicardium boundaries in a cardiac magnetic resonance (MR) sequence following the optimization of two or...
102
Voted
COCO
2009
Springer
15 years 9 months ago
2009
Springer
—In 1982, Kannan showed that ΣP 2 does not have nk -sized circuits for any k. Do smaller classes also admit such circuit lower bounds? Despite several improvements of Kannan’s...
114
click to vote
SIGCOMM
2010
ACM
15 years 2 months ago
2010
ACM
We introduce and motivate crowd computing, which combines mobile devices and social interactions to achieve large-scale distributed computation. An opportunistic network of mobile...
134
click to vote
MOBIHOC
2006
ACM
16 years 2 months ago
2006
ACM
Localization is an important and extensively studied problem in ad-hoc wireless sensor networks. Given the connectivity graph of the sensor nodes, along with additional local info...
136
click to vote
GD
2000
Springer
15 years 6 months ago
2000
Springer
An orthogonal drawing of a graph is an embedding of the graph in the rectangular grid, with vertices represented by axis-aligned boxes, and edges represented by paths in the grid w...