2168 search results - page 156 / 434 » Randomized Algorithms and Complexity Theory |
135
click to vote
SARA
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. This article presents two new algorithms whose purpose is to maintain the Max-RPC domain filtering consistency during search with a minimal memory footprint and implemen...
123
Voted
COR
2008
15 years 3 months ago
2008
The typical inventory routing problem deals with the repeated distribution of a single product from a single facility with an unlimited supply to a set of customers that can all b...
182
click to vote
AAAI
2011
14 years 3 months ago
2011
Recently, a number of researchers have proposed spectral algorithms for learning models of dynamical systems—for example, Hidden Markov Models (HMMs), Partially Observable Marko...
115
click to vote
CORR
2008
Springer
15 years 3 months ago
2008
Springer
Compressive sensing (CS) is an alternative to Shannon/Nyquist sampling for acquisition of sparse or compressible signals that can be well approximated by just K N elements from a...
129
Voted
STOC
2006
ACM
15 years 9 months ago
2006
ACM
We show that for any constant ε > 0, there is no Ω(log1−ε M)approximation algorithm for the directed congestion minimization problem on networks of size M unless NP ⊆ Z...