2924 search results - page 108 / 585 » Lower Bounds in Distributed Computing |
108
click to vote
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...
86
Voted
COCO
2009
Springer
15 years 7 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...
94
Voted
SIGCOMM
2010
ACM
15 years 25 days 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...
110
Voted
MOBIHOC
2006
ACM
16 years 6 days 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...
119
Voted
GD
2000
Springer
15 years 4 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...