848 search results - page 10 / 170 » Randomness and the linear degrees of computability |
183
Voted
ICALP
2007
Springer
15 years 12 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...
155
Voted
ISAAC
1997
Springer
15 years 10 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...
147
click to vote
CIE
2005
Springer
15 years 7 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...
157
click to vote
IROS
2009
IEEE
16 years 14 days 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...
162
Voted
ICDCS
2007
IEEE
16 years 4 days 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...