4377 search results - page 527 / 876 » Mass problems and randomness |
154
click to vote
ISAAC
2007
Springer
16 years 29 days ago
2007
Springer
Abstract. Let C be a polygonal cycle on n vertices in the plane. A randomized algorithm is presented which computes in O(n log3 n) expected time, the edge of C whose removal result...
191
click to vote
ISSAC
2007
Springer
16 years 28 days ago
2007
Springer
We describe some major recent progress in exact and symbolic linear algebra. These advances concern the improvement of complexity estimates for fundamental problems such as linear...
164
click to vote
SAT
2007
Springer
16 years 28 days ago
2007
Springer
Abstract. We consider the problem of computing tractable approximations to CNF formulas, extending the approach of Selman and Kautz to compute the Horn-LUB to involve renaming of v...
143
click to vote
SLS
2007
Springer
16 years 27 days ago
2007
Springer
We consider a possible scenario of experimental analysis on heuristics for optimization: identifying the contribution of local search components when algorithms are evaluated on th...
195
click to vote
3DPVT
2006
IEEE
16 years 26 days ago
2006
IEEE
We present an algorithm for generating panoramic images of complex scenes from a multi-sensor camera. We further present a programmable graphics hardware implementation to process...