4315 search results - page 102 / 863 » Sorting in linear time |
STOC
2001
ACM
14 years 9 months ago
2001
ACM
We show how to bound the mixing time and log-Sobolev constants of Markov chains by bounding the edge-isoperimetry of their underlying graphs. To do this we use two recent techniqu...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
We provide the first linear-space data structure with provable sublinear query time for exact point-topoint shortest path queries in planar graphs. We prove that for any planar gr...
JCT
2000
13 years 8 months ago
2000
We give a strongly polynomial-time algorithm minimizing a submodular function f given by a value-giving oracle. The algorithm does not use the ellipsoid method or any other linear ...
SIAMMA
2010
13 years 3 months ago
2010
This paper concerns the reconstruction of the absorption and scattering parameters in a time-dependent linear transport equation from full knowledge of the albedo operator at the ...
CONCUR
1998
Springer
14 years 1 months ago
1998
Springer
Abstract. We summarize and reorganize some of the last decade's research on real-time extensions of temporal logic. Our main focus is on tableau constructions for model checki...