A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Filters
A Fast Parameterized Algorithm for Co-Path Set
[article]
2016
arXiv
pre-print
Preserved Fulltext
Other Versions
Our main tool is a new O^*(4^tw(G)) algorithm for CO-PATH SET using the Cut&Count framework, where tw(G) denotes treewidth. ...
We give a linear-time fpt algorithm with complexity O^*(1.588^k) for deciding k-CO-PATH SET, significantly improving the previously best known O^*(2.17^k) of Feng, Zhou, and Wang (2015). ...
We thank two anonymous reviewers for providing a simplification of our previous branching algorithm and pointing out the result from [9] enabling us to branch on vertices with degree greater than 7. ...
arXiv:1603.04376v3
fatcat:3n72dys62fevdpdcrvvopsrqdu
A Fast Parameterized Algorithm for Co-Path Set *
unpublished
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Our main tool is a new O * (4 tw(G)) algorithm for Co-Path Set using the Cut&Count framework, where tw(G) denotes treewidth. ...
We give a linear-time, randomized fpt algorithm with complexity O * (1.588 k) for deciding k-Co-Path Set, significantly improving the previously best known O * (2.17 k) of Feng, Zhou, and Wang (2015). ...
We thank two anonymous reviewers for providing a simplification of our previous branching algorithm and pointing out the result from [9] enabling us to branch on vertices with degree greater than 7. ...
fatcat:xh2axfsdmfbqtdn4kcmsbhfzgu
Page 1416 of Mathematical Reviews Vol. , Issue 2004b
[page]
2004
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Follow- ing the proposed definition, a set of points froms a closed curve in discrete space if the set admits a parameterization, i.e. there exists a Hamiltonian cycle in the set. ...
Summary: “To reduce the amount of computation in a full search (FS) algorithm for fast motion estimation, we propose a new and fast FS motion estimation algorithm. ...
An overview of the AIRS radiative transfer model
2003
IEEE Transactions on Geoscience and Remote Sensing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The two main elements of the Atmospheric Infrared Sounder Radiative Transfer Algorithm (AIRS-RTA) are described in this paper: 1) the fast parameterization of the atmospheric transmittances that are used ...
The AIRS-RTA is a hybrid model in that it parameterizes most gases on a fixed grid of pressures, while the water optical depths are parameterized on a fixed grid of water amounts. ...
Johns (NRC-Ottawa, retired) for the laboratory spectra of CO . ...
doi:10.1109/tgrs.2002.808244
fatcat:5dd4ny5acffqxciazue6y3remq
Optimality and tight results in parameterized complexity (Dagstuhl Seminar 14451)
2015
Dagstuhl Reports
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Over the last two decades parameterized complexity has become one of the main tools for handling intractable problems. ...
The report contains the abstracts of the results presented at the seminar, as well as a collection of open problems stated at the seminar. ...
We develop a fast algorithm for permanents over said ring by modifying Valiant's 1979 algorithm for the permanent over Z 2 l . ...
doi:10.4230/dagrep.4.11.1
dblp:journals/dagstuhl-reports/KratschLMR14
fatcat:vwgmhttkgrf4pb34jpsb2rfvnm
Tomographic Reconstruction for Truncated Cone Beam Data Using Prior CT Information
[chapter]
2003
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
In this paper we present a method that compensates for truncation using prior information from computed tomography and provides accurate reconstruction in the mid-plane under certain conditions. ...
The second class of algorithms apply to a circular source path. For this geometry, the algorithm proposed by Feldkamp, Davis, and Kress (FDK) [3] is commonly used. ...
For instance, consider the task of reconstruction from a set of heavily truncated projections obtained over only 180 • (less than a short scan). ...
doi:10.1007/978-3-540-39903-2_17
fatcat:vgff3upoardbrhwi3vhhjbcv64
A New Approach to Time-Optimal Path Parameterization based on Reachability Analysis
[article]
2017
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
Time-Optimal Path Parameterization (TOPP) is a well-studied problem in robotics and has a wide range of applications. ...
The key insight is to recursively compute reachable and controllable sets at discretized positions on the path by solving small Linear Programs (LPs). ...
Section IV presents the core algorithm to compute the timeoptimal path parameterization. ...
arXiv:1707.07239v2
fatcat:hjo6stodavh3xj47z477nglcfe
MAPS
1998
Proceedings of the 25th annual conference on Computer graphics and interactive techniques - SIGGRAPH '98
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is application/pdf.
We show how to use the parameterization for fast, hierarchical subdivision connectivity remeshing with guaranteed error bounds. ...
Our algorithm uses hierarchical simplification to efficiently induce a parameterization of the original mesh over a base domain consisting of a small number of triangles. ...
Aaron Lee was also partially supported by a Wu Graduate Fellowship and a Summer Internship at Bell Laboratories, Lucent Technologies. ...
doi:10.1145/280814.280828
dblp:conf/siggraph/LeeSSCD98
fatcat:ec2ah6l6gjczzkgzopa7hk64em
New Races in Parameterized Algorithmics
[chapter]
2012
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
We discuss several of these aspects and particularly focus on the search for "stronger parameterizations" in developing fixed-parameter algorithms. ...
Once having classified an NP-hard problem fixed-parameter tractable with respect to a certain parameter, the race for the most efficient fixed-parameter algorithm starts. ...
We thank André Nichterlein, Manuel Sorge, and Mathias Weller for their comments which have improved this article. ...
doi:10.1007/978-3-642-32589-2_2
fatcat:gpfsek5febh5rikaagecihqclq
Constructing Subdivision Connectivity Mesh via PDE Parameterization
2010
International Journal of Virtual Reality
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Our algorithm begins from a coarse base mesh generated from the original mesh and then the original mesh is divided into a set of patches guided by the base mesh. ...
In this paper we present a novel algorithm for constructing subdivision connectivity mesh from dense original mesh. ...
ACKNOWLEDGMENT This project is supported by the Singapore National Research Foundation Interactive Digital Media R&D Program, under research Grant NRF2008IDM-IDM004-002 "Visual and Haptic Rendering in Co-Space ...
doi:10.20870/ijvr.2010.9.4.2786
fatcat:ypgpqxzxbfb5deiuzkphg22cia
Kernelization – Preprocessing with a Guarantee
[chapter]
2012
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
The framework of parameterized complexity turns out to be particularly suitable for a mathematical analysis of pre-processing heuristics. ...
A kernelization algorithm is a preprocessing algorithm which simplifies the instances given as input in polynomial time, and the extent of simplification desired is quantified with the help of the additional ...
Kernelization for FAST In this section we discuss a kernel for p-FAST. A tournament is a directed graph T such that for every pair of vertices v, u ∈ V (T ), either uv or vu is an arc of T . ...
doi:10.1007/978-3-642-30891-8_10
fatcat:ihw5qxdnffdybk4f2c4lhds3pe
Time-Optimal Path Following for Fixed-Wing Aircraft
2013
Journal of Guidance Control and Dynamics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
In this paper, a method is proposed for the minimum-time travel of a fixed-wing aircraft along a prescribed geometric path. ...
Two algorithms for the time-optimal parameterization are proposed. Numerical examples are presented to demonstrate the validity, numerical accuracy, and optimality of the proposed method. ...
The contributions of the paper can be summarized as follows: First, it is shown that the problem of the optimal time parameterization of a geometric path for a fixed-wing aircraft can be converted to a ...
doi:10.2514/1.57471
fatcat:ntbwxsdlnvacpj2ryt4bizd474
Development of Task-Space Nonholonomic Motion Planning Algorithm Based on Lie-Algebraic Method
2021
Applied Sciences
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
A complete, general-purpose Lie-algebraic algorithm is provided for a local motion planning of nonholonomic systems with or without output functions. ...
The auxiliary objective of the paper is to verify, through simulations, an impact of initial parameters on the efficiency of the planning algorithm, and to provide some hints on how to set the parameters ...
Comments on Algorithm 1: • A nonholonomic motion planning in a configuration space is achieved by setting the identity output function (2). • A selected parameterization (7) , Step 4, can vary from one ...
doi:10.3390/app112110245
fatcat:tq7hy3yfhvdiri7l3kn745gg2y
Scalable algorithms for designing CO2 capture and storage infrastructure
2021
Zenodo
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
However, if you think it does you can request a takedown by emailing help@openaccessbutton.org. ...
This version of the article has been accepted for publication, after peer review (when applicable) and is subject to Springer Nature's AM terms of use, but is not the Version of Record and does not reflect ...
Because of this complexity result, we pursue fast suboptimal algorithms for CID in Section 4. ...
doi:10.5281/zenodo.6603027
fatcat:5l2kcilpqfe6rgb42gpzhfrwum
Face recognition using weighted distance transform
2013
Proceedings of 2013 10th International Bhurban Conference on Applied Sciences & Technology (IBCAST)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
A wide range of commercial and law enforcement applications largely accounts for this developing trend. ...
In a 2D image the unique facial appearance normally consists of intensity curvatures which may be incorporated for recognizing human face. ...
The boundary value problem solved by fast marching method is a special case of level set methods. Level set methods are slower then fast marching method. ...
doi:10.1109/ibcast.2013.6512145
fatcat:cj2awy7t5jblxotoizh42a5nom
« Previous
Showing results 1 — 15 out of 25,538 results