نتایج جستجو برای: fpt

تعداد نتایج: 1015  

Journal: :Brazilian journal of otorhinolaryngology 2008
Patrícia Danieli Campos Kátia de Freitas Alvarenga Natália Barreto Frederigue Leandra Tabanez do Nascimento Koichi Sameshima Orozimbo Alves Costa Filho Maria Cecília Bevilacqua

UNLABELLED Processing acoustic clues from the sounds of speech depends on the proper perception of the frequency and duration of stimuli as a sequence of events. AIM To assess the capacity for temporal organization in users of multichannel CI. METHOD 14 normal hearing individuals formed the control group, matching in age and gender other 14 users of multichannel CI, who made up the study gr...

2014
Martin Kronegger Sebastian Ordyniak Andreas Pfandler

Backdoors measure the distance to tractable fragments and have become an important tool to find fixed-parameter tractable (fpt) algorithms. Despite their success, backdoors have not been used for planning, a central problem in AI that has a high computational complexity. In this work, we introduce two notions of backdoors building upon the causal graph. We analyze the complexity of finding a sm...

2010
Haitao Jiang Binhai Zhu Daming Zhu Hong Zhu

Minimum Common String Partition (MCSP) has drawn much attention due to its application in genome rearrangement. In this paper, we investigate three variants of MCSP: MCSP , which requires that there are at most c elements in the alphabet; d-MCSP, which requires the occurrence of each element to be bounded by d; and x-balanced MCSP, which requires the length of blocks being in range (n/k − x, n/...

Journal: :SIAM J. Comput. 1999
Haim Kaplan Ron Shamir Robert E. Tarjan

We study the parameterized complexity of three NP hard graph completion problems The MINIMUM FILL IN problem is to decide if a graph can be triangulated by adding at most k edges We develop an O k mn f k algorithm for this problem on a graph with n vertices and m edges In particular this implies that the problem is xed parameter tractable FPT The PROPER INTERVAL GRAPH COMPLETION problem motivat...

Journal: :Journal of chemical information and modeling 2006
Fanny Bonachéra Benjamin Parent Frédérique Barbosa Nicolas Froloff Dragos Horvath

This paper introduces a novel molecular description--topological (2D) fuzzy pharmacophore triplets, 2D-FPT--using the number of interposed bonds as the measure of separation between the atoms representing pharmacophore types (hydrophobic, aromatic, hydrogen-bond donor and acceptor, cation, and anion). 2D-FPT features three key improvements with respect to the state-of-the-art pharmacophore fing...

Journal: :Revista Brasileira de Geografia Física 2021

Pedotransfer Functions (FPT) are mathematical models that estimate difficult-to-measure soil properties through more accessible variables, generating optimization of time and financial resources. In this study, six Functions, based on the equation Van Genuchten, analyzed for prediction volumetric moisture Brazilian soils, with data from global database Soil Data Task. Applied pressures 0, 0.01,...

Journal: :Molecules 2015
Yeqing Chen Hongli Yu Hao Wu Yaozong Pan Kuilong Wang Yangping Jin Chengchao Zhang

The Traditional Chinese Medicine herbs Pollen Typhae and Pollen Typhae Carbonisatus have been used as a hemostatic medicine promoting blood clotting for thousands of years. In this study, a reliable, highly sensitive method based on LC-MS/MS has been developed for differentiation of the heating products of total flavonoids in Pollen Typhae (FPT-N). Twenty three peaks were detected and 18 peaks ...

2012
Xiao Tan Duncan S. Wong

Weakened Random Oracle Models (WROMs) are variants of the Random Oracle Model (ROM) under some weakened collision resistance assumptions. Cryptographic schemes proven secure in WROMs can ensure security even when the underlying random oracles are susceptible to certain extent of collision attacks, second pre-image attacks, or first pre-image attacks. In this paper, we show that a WROM variant c...

Journal: :CoRR 2017
Bernhard Bliem Stefan Woltran

A set S of vertices of a graph is a defensive alliance if, for each element of S, the majority of its neighbors is in S. The problem of finding a defensive alliance of minimum size in a given graph is NP-hard and there are polynomial-time algorithms if certain parameters are bounded by a fixed constant. In particular, fixed-parameter tractability results have been obtained for some structural p...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید