535 search results - page 69 / 107 » Insertion and Expansion Operations for |
147
click to vote
HICSS
2000
IEEE
15 years 10 months ago
2000
IEEE
Chief information officers (CIOs) have the difficult job of running a function that uses a lot of resources but offers little measurable evidence of its value. Line managers are i...
140
click to vote
ICPP
1993
IEEE
15 years 10 months ago
1993
IEEE
:. In designing application-specific bit-level architectures and in programming existing bit-level processor arrays, it is necessary to expand a word-level algorithm into its bit-...
165
click to vote
FSTTCS
1995
Springer
15 years 9 months ago
1995
Springer
Karp and Zhang developed a general randomized parallel algorithm for solving branch and bound problems. They showed that with high probability their algorithm attained optimal spe...
143
click to vote
IMAGING
2001
15 years 7 months ago
2001
The physical properties of color are usually described by their spectra, eigenvector expansions or low-dimensional descriptors such as RGB or CIE-Lab. In the first part of the pap...
128
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
Frames have established themselves as a means to derive redundant, yet stable decompositions of a signal for analysis or transmission, while also promoting sparse expansions. Howe...