848 search results - page 10 / 170 » Randomness and the linear degrees of computability |
104
click to vote
ICALP
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. We deal with two intimately related subjects: quasi-randomness and regular partitions. The purpose of the concept of quasi-randomness is to measure how much a given graph...
ISAAC
1997
Springer
15 years 1 months ago
1997
Springer
We present a randomized EREW PRAM algorithm to nd a minimum spanning forest in a weighted undirected graph. On an n-vertex graph the algorithm runs in o((logn)1+ ) expected time f...
78
Voted
CIE
2005
Springer
14 years 11 months ago
2005
Springer
Abstract. We present a domain theoretic framework for obtaining exact solutions of linear boundary value problems. Based on the domain of compact real intervals, we show how to app...
IROS
2009
IEEE
15 years 4 months ago
2009
IEEE
— Sampling-based motion planners are often used to solve very high-dimensional planning problems. Many recent algorithms use projections of the state space to estimate properties...
ICDCS
2007
IEEE
15 years 3 months ago
2007
IEEE
Both peer-to-peer and sensor networks have the fundamental characteristics of node churn and failures. Peers in P2P networks are highly dynamic, whereas sensors are not dependable...