3 resultados para Mosaic
em Cambridge University Engineering Department Publications Database
Filtro por publicador
- Acceda, el repositorio institucional de la Universidad de Las Palmas de Gran Canaria. España (1)
- Adam Mickiewicz University Repository (4)
- AMS Tesi di Dottorato - Alm@DL - Università di Bologna (14)
- AMS Tesi di Laurea - Alm@DL - Università di Bologna (1)
- Aquatic Commons (10)
- ArchiMeD - Elektronische Publikationen der Universität Mainz - Alemanha (8)
- Archimer: Archive de l'Institut francais de recherche pour l'exploitation de la mer (2)
- Archive of European Integration (1)
- Aston University Research Archive (4)
- Avian Conservation and Ecology - Eletronic Cientific Hournal - Écologie et conservation des oiseaux: (2)
- Biblioteca de Teses e Dissertações da USP (1)
- Biblioteca Digital | Sistema Integrado de Documentación | UNCuyo - UNCUYO. UNIVERSIDAD NACIONAL DE CUYO. (2)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (18)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP) (14)
- Biblioteca Digital de Teses e Dissertações Eletrônicas da UERJ (8)
- Bibloteca do Senado Federal do Brasil (1)
- Bioline International (1)
- BORIS: Bern Open Repository and Information System - Berna - Suiça (27)
- Boston University Digital Common (4)
- Brock University, Canada (8)
- Bucknell University Digital Commons - Pensilvania - USA (2)
- Bulgarian Digital Mathematics Library at IMI-BAS (1)
- CaltechTHESIS (3)
- Cambridge University Engineering Department Publications Database (3)
- CentAUR: Central Archive University of Reading - UK (21)
- Center for Jewish History Digital Collections (1)
- Chinese Academy of Sciences Institutional Repositories Grid Portal (25)
- Comissão Econômica para a América Latina e o Caribe (CEPAL) (1)
- Cor-Ciencia - Acuerdo de Bibliotecas Universitarias de Córdoba (ABUC), Argentina (1)
- Corvinus Research Archive - The institutional repository for the Corvinus University of Budapest (1)
- Department of Computer Science E-Repository - King's College London, Strand, London (1)
- DI-fusion - The institutional repository of Université Libre de Bruxelles (5)
- Digital Commons - Michigan Tech (1)
- Digital Commons @ DU | University of Denver Research (1)
- Digital Commons at Florida International University (13)
- DigitalCommons - The University of Maine Research (2)
- DigitalCommons@The Texas Medical Center (4)
- DigitalCommons@University of Nebraska - Lincoln (2)
- Digitale Sammlungen - Goethe-Universität Frankfurt am Main (1)
- DRUM (Digital Repository at the University of Maryland) (6)
- Duke University (2)
- eResearch Archive - Queensland Department of Agriculture; Fisheries and Forestry (13)
- Glasgow Theses Service (2)
- Greenwich Academic Literature Archive - UK (1)
- Helda - Digital Repository of University of Helsinki (7)
- Illinois Digital Environment for Access to Learning and Scholarship Repository (1)
- Indian Institute of Science - Bangalore - Índia (27)
- Infoteca EMBRAPA (3)
- Instituto Politécnico de Bragança (1)
- Instituto Politécnico de Santarém (1)
- Massachusetts Institute of Technology (1)
- Memoria Académica - FaHCE, UNLP - Argentina (3)
- Ministerio de Cultura, Spain (2)
- National Center for Biotechnology Information - NCBI (90)
- Nottingham eTheses (1)
- Portal de Revistas Científicas Complutenses - Espanha (5)
- Publishing Network for Geoscientific & Environmental Data (28)
- QSpace: Queen's University - Canada (1)
- QUB Research Portal - Research Directory and Institutional Repository for Queen's University Belfast (19)
- Queensland University of Technology - ePrints Archive (48)
- RDBU - Repositório Digital da Biblioteca da Unisinos (2)
- ReCiL - Repositório Científico Lusófona - Grupo Lusófona, Portugal (1)
- Repositorio Académico de la Universidad Nacional de Costa Rica (2)
- Repositório Alice (Acesso Livre à Informação Científica da Embrapa / Repository Open Access to Scientific Information from Embrapa) (9)
- Repositório Científico da Universidade de Évora - Portugal (1)
- Repositório Científico do Instituto Politécnico de Santarém - Portugal (1)
- Repositório digital da Fundação Getúlio Vargas - FGV (2)
- Repositório Institucional da Universidade de Aveiro - Portugal (3)
- Repositório Institucional da Universidade de Brasília (1)
- Repositório Institucional da Universidade Federal do Rio Grande - FURG (3)
- Repositório Institucional da Universidade Tecnológica Federal do Paraná (RIUT) (1)
- Repositorio Institucional de la Universidad de Málaga (1)
- Repositorio Institucional de la Universidad Nacional Agraria (2)
- Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho" (172)
- Research Open Access Repository of the University of East London. (2)
- RUN (Repositório da Universidade Nova de Lisboa) - FCT (Faculdade de Cienecias e Technologia), Universidade Nova de Lisboa (UNL), Portugal (1)
- SAPIENTIA - Universidade do Algarve - Portugal (2)
- Scientific Open-access Literature Archive and Repository (1)
- Universidad de Alicante (7)
- Universidad del Rosario, Colombia (8)
- Universidad Politécnica de Madrid (19)
- Universidade Complutense de Madrid (1)
- Universidade de Lisboa - Repositório Aberto (1)
- Universidade Federal do Pará (6)
- Universidade Federal do Rio Grande do Norte (UFRN) (9)
- Universidade Metodista de São Paulo (3)
- Universita di Parma (2)
- Universitat de Girona, Spain (14)
- Universitätsbibliothek Kassel, Universität Kassel, Germany (1)
- Université de Lausanne, Switzerland (1)
- Université de Montréal (2)
- Université de Montréal, Canada (11)
- University of Connecticut - USA (1)
- University of Michigan (27)
- University of Queensland eSpace - Australia (21)
- University of Southampton, United Kingdom (1)
- USA Library of Congress (1)
Resumo:
We describe simple yet scalable and distributed algorithms for solving the maximum flow problem and its minimum cost flow variant, motivated by problems of interest in objects similarity visualization. We formulate the fundamental problem as a convex-concave saddle point problem. We then show that this problem can be efficiently solved by a first order method or by exploiting faster quasi-Newton steps. Our proposed approach costs at most O(|ε|) per iteration for a graph with |ε| edges. Further, the number of required iterations can be shown to be independent of number of edges for the first order approximation method. We present experimental results in two applications: mosaic generation and color similarity based image layouting. © 2010 IEEE.