768 search results - page 74 / 154 » Asymptotic Cellular Complexity |
CORR
2010
Springer
14 years 10 months ago
2010
Springer
During the last decade, incremental sampling-based motion planning algorithms, such as the Rapidly-exploring Random Trees (RRTs), have been shown to work well in practice and to po...
ALMOB
2006
14 years 10 months ago
2006
The technique of Finite Markov Chain Imbedding (FMCI) is a classical approach to complex combinatorial problems related to sequences. In order to get efficient algorithms, it is k...
ECCC
2006
14 years 9 months ago
2006
We show that for any > 0, a maximum-weight triangle in an undirected graph with n vertices and real weights assigned to vertices can be found in time O(n + n2+), where is the ...
CORR
2007
Springer
14 years 9 months ago
2007
Springer
The problem of recovering the sparsity pattern of a fixed but unknown vector β∗ ∈ Rp based on a set of n noisy observations arises in a variety of settings, including subset...
103
click to vote
JSAC
2006
14 years 9 months ago
2006
Abstract--Efficient near-optimal energy allocation for multimedia data transmission using multicarrier modulation is investigated. The optimal method typically relies on an iterati...