1168 search results - page 166 / 234 » Optimization strategies for complex queries |
EJC
2010
14 years 10 months ago
2010
Abstract. We prove that the combinatorial distance between any two reduced expressions of a given permutation of {1, ..., n} in terms of transpositions lies in O(n4), a sharp bound...
102
click to vote
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
We propose a low complexity analog joint source channel coding Multiple Description (MD) scheme for transmitting the symbols of a Gaussian source across a pair of independent AWGN...
IC
2003
14 years 11 months ago
2003
Integrating complex enterprise systems is challenging and reliability and performance of the integrated systems can be problematic when using typical solutions of distributed tran...
CIE
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. A classic result known as the speed-up theorem in machineindependent complexity theory shows that there exist some computable functions that do not have best programs for...
SSDBM
2000
IEEE
15 years 2 months ago
2000
IEEE
In implementations of non-standard database systems, large objects are often embedded within an aggregate of different types, i.e. a tuple. For a given size and access probabilit...