6365 search results - page 71 / 1273 » Fast Local Computation Algorithms |
162
click to vote
SPAA
1996
ACM
15 years 6 months ago
1996
ACM
Several recent papers have proposed or analyzed optimal algorithms to route all-to-all personalizedcommunication (AAPC) over communication networks such as meshes, hypercubes and ...
128
click to vote
ICALP
2009
Springer
16 years 2 months ago
2009
Springer
We present a randomized subexponential time, polynomial space parameterized algorithm for the k-Weighted Feedback Arc Set in Tournaments (k-FAST) problem. We also show that our alg...
JSC
2006
15 years 2 months ago
2006
For a polynomial ring R = k[x1, ..., xn], we present a method to compute the characteristic cycle of the localization Rf for any nonzero polynomial f R that avoids a direct comput...
136
Voted
ICVS
2009
Springer
15 years 9 months ago
2009
Springer
The faithful detection of the motion and of the distance of the objects in the visual scene is a desirable feature of any artificial vision system designed to operate in unknown e...
150
Voted
IEEEHPCS
2010
15 years 9 days ago
2010
The performance (in term of error rate) of biometric systems can be improved by combining them. Multiple fusion techniques can be applied from classical logical operations to more...