2374 search results - page 36 / 475 » Fast Distributed Algorithms for Computing Separable Function... |
ICS
2010
Tsinghua U.
15 years 7 months ago
2010
Tsinghua U.
We consider Fisher and Arrow-Debreu markets under additively-separable, piecewise-linear, concave utility functions, and obtain the following results: ? For both market models, if...
87
Voted
PPDP
2009
Springer
15 years 4 months ago
2009
Springer
We propose a novel approach to encapsulate non-deterministic computations in functional logic programs. Our approach is based on set functions that return the set of all the resul...
92
Voted
ICVS
2009
Springer
15 years 4 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...
ISAAC
2007
Springer
15 years 3 months ago
2007
Springer
In this paper, we consider the problem of partitioning a small data sample drawn from a mixture of k product distributions. We are interested in the case that individual features a...
ICALP
2009
Springer
15 years 10 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...