Michael Hersche, Mustafa Zeqiri, et al.
NeSy 2023
Paper
Parallel Linear Programming in Fixed Dimension Almost Surely in Constant Time
Abstract
For any fixed dimension d, thelinear programming problem with ninequality constraints can be solved on a probabilistic CRCW PRAM withO1994processors almost surely in constant time. The algorithm always findsthe correct solution. Withnd/log2dprocessors, the probability that the algorithm will not finish withinO(d2log2dtime tends to zero exponentially withn. © 1994, ACM. All rights reserved.
Related
Hironori Takeuchi, Tetsuya Nasukawa, et al.
Transactions of the Japanese Society for Artificial Intelligence
Workshop paper
Extracting Verb Sense Hierarchies from FrameNet
Ran Iwamoto, Kyoko Ohara
ICLC 2023
Guo-Jun Qi, Charu Aggarwal, et al.
IEEE TPAMI