213 search results - page 39 / 43 » The randomized complexity of initial value problems |
COMPGEOM
2011
ACM
12 years 11 months ago
2011
ACM
Given a continuous function f : X → IR on a topological space X, its level set f−1 (a) changes continuously as the real value a changes. Consequently, the connected components...
TCC
2009
Springer
14 years 8 months ago
2009
Springer
Abstract. Goldreich (ECCC 2000) proposed a candidate one-way function construction which is parameterized by the choice of a small predicate (over d = O(1) variables) and of a bipa...
CVPR
2004
IEEE
14 years 9 months ago
2004
IEEE
Model-based clustering of motion trajectories can be posed as the problem of learning an underlying mixture density function whose components correspond to motion classes with dif...
ATAL
2009
Springer
14 years 2 months ago
2009
Springer
Game-theoretic solution concepts, such as Nash equilibrium, are playing an ever increasing role in the study of systems of autonomous computational agents. A common criticism of N...
COMSWARE
2007
IEEE
14 years 1 months ago
2007
IEEE
In this paper we are concerned with finding the maximum throughput that a mobile ad hoc network can support. Even when nodes are stationary, the problem of determining the capaci...