1450 search results - page 69 / 290 » On the Complexity of Hardness Amplification |
121
click to vote
PAMI
2012
13 years 7 days ago
2012
Abstract—Given the size and confidence of pairwise local orderings, angular embedding (AE) finds a global ordering with a nearglobal optimal eigensolution. As a quadratic crite...
113
click to vote
AAAI
2012
13 years 5 days ago
2012
The complexity of the winner determination problem has been studied for almost all common voting rules. A notable exception, possibly caused by some confusion regarding its exact ...
ESOP
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. Program inversion has many applications such as in the implementation of serialization/deserialization and in providing support for redo/undo, and has been studied by man...
ICALP
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. We give an fpt approximation algorithm for the directed vertex disjoint cycle problem. Given a directed graph G with n vertices and a positive integer k, the algorithm co...
ECRTS
2002
IEEE
15 years 2 months ago
2002
IEEE
We propose two server implementations for multiplexing aperiodic and recurrent (i.e., periodic, sporadic, or “rate-based”) real-time tasks in fair-scheduled multiprocessor sys...