Página principal > Resultados de la búsqueda: Complexity reduction
  Consejos para la búsqueda
Búsqueda avanzada
Buscar colecciones:
Ordenar por: Mostrar resultados: Formato de visualización:
Resultados globales: 3 registros encontrados en 0.01 segundos.
Artículos, Encontrados 3 registros
Artículos Encontrados 3 registros  
1.
16 p, 1.0 MB A reduced domain pool based on DCT for a fast fractal image encoding / Douda, Sofia (Faculté des Sciences et Techniques (Settat, Marroc)) ; Bagri, Abdallah (Faculté des Sciences et Techniques (Settat, Marroc)) ; Abdelhakim El Imrani, Amer (LCS, Faculté des Sciences (Rabat, Marroc))
Fractal image compression is time consuming due to the search of the matching between range and domain blocks. In order to improve this compression method, we propose firstly, in this paper, a fast method for reducing the computational complexity of fractal encoding by reducing the size of the domain pool. [...]
2011 - 10.5565/rev/elcvia.389
ELCVIA : Electronic Letters on Computer Vision and Image Analysis, Vol. 10, Núm. 1 (December 2011) , p. 11-23  
Registro completo - Creative Commons
2.
11 p, 294.2 KB A Fast Fractal Image Compression Method Based Entropy / Hassaballah, M. (South Valley University (Qena, Egipte). Mathematics Department) ; Makky, M. M. (South Valley University (Qena, Egipte). Mathematics Department) ; Mahdy, Youssef B. (Assuit University, (Assuit, Egipte). Faculty of Computers & Information)
Fractal image compression gives some desirable properties like resolution independence, fast decoding, and very competitive rate-distortion curves. But still suffers from a (sometimes very) high encoding time, depending on the approach being used. [...]
2005 - 10.5565/rev/elcvia.82
ELCVIA : Electronic Letters on Computer Vision and Image Analysis, V. 5 n. 1 (2005) p. 30-40  
Registro completo - Creative Commons
3.
13 p, 551.2 KB On the worst case complexity of potential reduction algorithms for linear programming / Bertsimas, Dimitris ; Xiaodong, Luo
There are several classes of interior point algorithms that solve linear programming problems in O(V~nL) iterations. Among them, several potential reduction algorithms combine both theoretical (O(V~nL) iterations) and practical efficiency as they allow the flexibility of line searches in the potential function, and thus can lead to practical implementations. [...]
1997
Mathematical Programming, vol. 77 n. 3 (1997) p. 321-333  
 Acceso restringido a la UAB
Registro completo -

¿Le interesa recibir alertas sobre nuevos resultados de esta búsqueda?
Defina una alerta personal vía correo electrónico o subscríbase al canal RSS.
Depósito Digital de Documentos de la UAB :: Buscar :: Enviar :: Personalizar :: Ayuda
Powered by Invenio v1.1.6
Mantenido por ddd.bib@uab.cat  :: Metadatos sujetos a:
Colaboramos