52,018 Hits in 4.1 sec

QCMC: Quasi-conformal Parameterizations for Multiply-connected domains [article]

Kin Tat Ho, Lok Ming Lui
2014 arXiv   pre-print
In this paper, we propose an iterative algorithm to simultaneously search for the conformal module and the optimal quasi-conformal parameterization.  ...  This paper presents a method to compute the quasi-conformal parameterization (QCMC) for a multiply-connected 2D domain or surface.  ...  In this paper, we propose an iterative algorithm to simultaeneously look for the conformal module and the optimal quasi-conformal map.  ... 
arXiv:1403.6614v1 fatcat:xyqbazrhl5gidfav52heat4rye

Polynomial Kernels for Hitting Forbidden Minors under Structural Parameterizations

Bart M. P. Jansen, Astrid Pieterse, Michael Wagner
2018 European Symposium on Algorithms  
We prove that for each set F of connected graphs and constant η, the F-Deletion problem parameterized by the size of a treedepth-η modulator has a polynomial kernel.  ...  It also generalizes earlier preprocessing results for F-Deletion parameterized by a vertex cover, which is a treedepth-one modulator.  ...  We therefore study the following problem for a fixed set F of connected graphs and constant η ≥ 1. F-Deletion parameterized by treedepth-η modulator Parameter: |X|.  ... 
doi:10.4230/lipics.esa.2018.48 dblp:conf/esa/JansenP18 fatcat:af55jmsen5hwpevlhjcb477i6u

A Distributed Workflow Management System with Case Study of Real-life Scientific Applications on Grids

Qishi Wu, Mengxia Zhu, Yi Gu, Patrick Brown, Xukang Lu, Wuyin Lin, Yangang Liu
2012 Journal of Grid Computing  
Next-generation scientific applications feature complex workflows comprised of many computing modules with intricate inter-module dependencies. Supporting such scientific workflows  ...  Note that these algorithms may produce the same optimal mapping results in small-scale problem cases.  ...  of rigorously designed mapping algorithms for end-to-end workflow performance optimization.  ... 
doi:10.1007/s10723-012-9222-7 fatcat:shx2jpjtybbxvfhd6mv4m3izme

Boosted Backpropagation Learning for Training Deep Modular Networks

Alexander Grubb, J. Andrew Bagnell
2010 International Conference on Machine Learning  
Combining these two methods of optimization gives a simple algorithm for training heterogeneous networks of functional modules using simple gradient propagation mechanics and established learning algorithms  ...  Divide-and-conquer is key to building sophisticated learning machines: hard problems are solved by composing a network of modules that solve simpler problems (LeCun et al., 1998; Rohde, 2002; Bradley,  ...  Acknowledgments We would like to thank Daniel Munoz and Abraham Othman for their valuable feedback and David Bradley for his help with experimental work.  ... 
dblp:conf/icml/GrubbB10 fatcat:ibuyhtu5gjeohmb6ge26jrdl5y

FAANet: feature-aligned attention network for real-time multiple object tracking in UAV videos

Zhenqi Liang, Jingshi Wang, Gang Xiao, Liu Zeng
2022 Chinese Optics Letters (COL)  
It mainly consists of a channel and spatial attention module and a feature-aligned aggregation module.  ...  We also improve the real-time performance using the joint-detection-embedding paradigm and structural re-parameterization technique.  ...  The network will learn to generate the offsets of two feature maps for alignment.  ... 
doi:10.3788/col202220.081101 fatcat:2elkon2kb5b35jn5nhvqqlzrzq

DRIVE: An Interpretive Simulation and Visualization Environment for Dynamically Reconfigurable Systems [chapter]

Kiran Bondalapati, Viktor K. Prasanna
1999 Lecture Notes in Computer Science  
We propose a novel interpretive simulation and visualization environment which alleviates these problems.  ...  Interpretive simulation measures the performance of an application by executing an abstract application model on an abstract parameterized system architecture model.  ...  The algorithmic techniques for mapping are not the focus of this paper. Some algorithms for mapping based on the HySAM model are described in our prior work 3, 4 .  ... 
doi:10.1007/978-3-540-48302-1_4 fatcat:a77pl7lns5h6zoeef3v73dulv4

Parameterized Algorithms for Clustering PPI Networks [article]

Sriganesh Srihari, Hon Wai Leong
2015 arXiv   pre-print
We propose novel graph theoretic models for these problems and devise practical parameterized algorithms.  ...  for these problems.  ...  Parameterized algorithms We dedicate this section to propose parameterized algorithms for all the theoretical problems introduced till now.  ... 
arXiv:1505.00925v1 fatcat:76aylgun6jh55cr4fxuabhpk3a

Fusion of vision, 3D gyro and GPS for camera dynamic registration

Z. Hu, U. Keiichi, H. Lu, F. Lamosa
2004 Proceedings of the 17th International Conference on Pattern Recognition, 2004. ICPR 2004.  
The fusion approach is based on our PMM (parameterized model matching) algorithm, in which the road shape model is derived from the digital map referring to GPS absolute road position, and matches with  ...  Traditional vision based or inertial sensor based solutions are mostly designed for well-structured environment, which is however unavailable for most outdoor uncontrolled applications.  ...  There are several factors that have to be considered for solving the Registration problem for VICNAS.  ... 
doi:10.1109/icpr.2004.1334539 dblp:conf/icpr/HuKLL04 fatcat:qqj33g5azzhftlkkqhpusiigxq

Modular active curiosity-driven discovery of tool use

Sebastien Forestier, Pierre-Yves Oudeyer
2016 2016 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)  
In particular, we consider goal babbling architectures that were designed to explore and learn solutions to fields of sensorimotor problems, i.e. to acquire inverse models mapping a space of parameterized  ...  sensorimotor problems/effects to a corresponding space of parameterized motor primitives.  ...  This dual parameterization is useful for several reasons.  ... 
doi:10.1109/iros.2016.7759584 dblp:conf/iros/ForestierO16 fatcat:bvbbra73rfconof6lktkwnydxy

3D Face Parsing via Surface Parameterization and 2D Semantic Segmentation Network [article]

Wenyuan Sun, Ping Zhou, Yangang Wang, Zongpu Yu, Jing Jin, Guangquan Zhou
2022 arXiv   pre-print
The topological disk-like 2D face image containing spatial and textural information is transformed from the sampled 3D face data through the face parameterization algorithm, and a specific 2D network called  ...  The 2D semantic result is then inversely re-mapped to 3D face data, which finally achieves the 3D face parsing.  ...  Except for the network structures, some ingenious algorithms are also presented for practical problems, such as ROI Tanh-wrapping proposed in [12] .  ... 
arXiv:2206.09221v1 fatcat:gklhd3cqyzey3da6hzad7aunma

A Rewriting Logic Framework for Soft Constraints

Martin Wirsing, Grit Denker, Carolyn Talcott, Andy Poggio, Linda Briesemeister
2007 Electronical Notes in Theoretical Computer Science  
We model the problem of "optimal" parameter assignments for software-defined radios as a soft constraint solving problem, prove the correctness of the constraint solving algorithm, implement the solution  ...  Soft constraints extend classical constraints to deal with non-functional requirements, overconstrained problems and preferences.  ...  Acknowledgment Thanks to the anonymous referees for their helpful suggestions and remarks.  ... 
doi:10.1016/j.entcs.2007.06.015 fatcat:7l54yv6cszenfa2joc2j3mhspe

Measuring what matters: A hybrid approach to dynamic programming with treewidth

Eduard Eiben, Robert Ganian, Thekla Hamm, O-joung Kwon
2021 Journal of computer and system sciences (Print)  
, there are also important problems which are FPT parameterized by treewidth but W[1]-hard (and hence probably not FPT) parameterized by rank-width.  ...  (not previously known) fixed-parameter algorithms parameterized by modulators to graph classes of bounded rank-width. 1 Parameter α dominates parameter β if for each graph class with bounded β, α is also  ...  a fixed-parameter algorithm for the respective problem when parameterized by a modulator to constant rank-width.  ... 
doi:10.1016/j.jcss.2021.04.005 fatcat:hocvwj3iezdclat5ermxqjtlsq

Data-compression for Parametrized Counting Problems on Sparse graphs [article]

Eun Jung Kim, Maria Serna, Dimitrios M. Thilikos
2018 arXiv   pre-print
In this paper, we prove that every vertex-certified counting problems on graphs that is MSOL-expressible and treewidth modulable, when parameterized by k, admits a polynomial-size compactor on H-topological-minor-free  ...  This implies the existence of an FPT-algorithm of running time O(n^2k^2)+2^O(k).  ...  Concerning Theorem 1, we stress that the treewidth-modulability condition can be derived by other meta-algorithmic conditions.  ... 
arXiv:1809.08160v2 fatcat:dwejq5ok25dv5hto3moiejvjva

Data-Compression for Parametrized Counting Problems on Sparse Graphs

Eun Jung Kim, Maria Serna, Dimitrios M. Thilikos, Michael Wagner
2018 International Symposium on Algorithms and Computation  
In this paper, we prove that every vertex-certified counting problems on graphs that is MSOL-expressible and treewidth modulable, when parameterized by k, admits a polynomial-size compactor on H-topological-minor-free  ...  This implies the existence of an FPT-algorithm of running time O(n 2 k 2 ) + 2 O(k) .  ...  Introduction A large part of research on parameterized algorithms has been focused on algorithmic techniques for parametrizations of decision problems.  ... 
doi:10.4230/lipics.isaac.2018.20 dblp:conf/isaac/0002ST18 fatcat:xytw4ioxsbelxko3iv4tmutely

A Flexible Framework for Fast Multi-objective Design Space Exploration of Embedded Systems [chapter]

Gianluca Palermo, Cristina Silvano, Vittorio Zaccaria
2003 Lecture Notes in Computer Science  
In this paper, we address the problem of the efficient exploration of the architectural design space for parameterized microprocessor-based systems.  ...  The analysis of the proposed framework has been carried out for a parameterized superscalar architecture executing a selected set of benchmarks.  ...  Once selected, each point is mapped into a specific instance of the target architecture by the "Architecture Mapping" module.  ... 
doi:10.1007/978-3-540-39762-5_31 fatcat:iik7dcfx7var5hocugg6ocoec4
« Previous Showing results 1 — 15 out of 52,018 results