Search results for "FCT"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
160	Christian Eisentraut, David Spieler	Fault, Compensation and Termination in WS-BPEL 2.0 - A Comparative Analysis.	WS-FM	2008	DBLP DOI BibTeX RDF
94	P. John Paul, P. N. Girija	A Novel VLSI Architecture for Image Compression.	ISM	2006	DBLP DOI BibTeX RDF	FHT, FCT, FST, Hybrid Transform, VLSI, FFT
80	Yufei Tao 0001, Jeffrey Xu Yu	Finding frequent co-occurring terms in relational keyword search.	EDBT	2009	DBLP DOI BibTeX RDF
68	Ferenc Gécseg (eds.)	Fundamentals of Computation Theory, FCT'81, Proceedings of the 1981 International FCT-Conference, Szeged, Hungary, August 24-28, 1981	FCT	1981	DBLP DOI BibTeX RDF
68	Dirk Janssens, Grzegorz Rozenberg	Generating Graph Languages Using Hypergraph Grammars.	FCT	1981	DBLP DOI BibTeX RDF
68	Hans Kleine Büning	Classes of Functions over Binary Trees.	FCT	1981	DBLP DOI BibTeX RDF
68	Jirí Adámek	Observability and Nerode Equivalence in Concrete C5ategories.	FCT	1981	DBLP DOI BibTeX RDF
68	Magnus Steinby	Some Algebraic Aspects of Recognizability and Rationality.	FCT	1981	DBLP DOI BibTeX RDF
68	Juha Kortelainen	Some Properties of Language Families Generated by Commutative Languages.	FCT	1981	DBLP DOI BibTeX RDF
68	Jürgen Dassow	Equality Languages and Language Families.	FCT	1981	DBLP DOI BibTeX RDF
68	Heinz Kaphengst	What is Computable for Abstract Data Types?	FCT	1981	DBLP DOI BibTeX RDF
68	H. C. M. Kleijn, Grzegorz Rozenberg	On the Role of Selectors in Selective Substitution Grammars.	FCT	1981	DBLP DOI BibTeX RDF
68	Hagen Huwig	A Definition of the P=NP-Problem in Categories.	FCT	1981	DBLP DOI BibTeX RDF
68	Detlef Seese	Elimination of Second-Order Quantifiers for Well-Founded Trees in Stationary Logic and Finitely Determinate Structures.	FCT	1981	DBLP DOI BibTeX RDF
68	István Németi	Dynamic Algebras of Programs.	FCT	1981	DBLP DOI BibTeX RDF
68	Hans-Dieter Ehrich	Specifying Algebraic Data Types by Domain Equations.	FCT	1981	DBLP DOI BibTeX RDF
68	Anton Nijholt	The Equivalence Problem for LL- and LR-Regular Grammars.	FCT	1981	DBLP DOI BibTeX RDF
68	Wolfgang Merzenich	Co-Algebras as Machines for the Interpretations of Flow Diagrams.	FCT	1981	DBLP DOI BibTeX RDF
68	Piotr W. Prószynski	Remarks on the Notion of Concurrency Relation in the Case of Systems.	FCT	1981	DBLP DOI BibTeX RDF
68	Burkhard Monien	On the LBA Problem.	FCT	1981	DBLP DOI BibTeX RDF
68	Miklós Bartha	An Algebraic Defenition of Attributed Transformations.	FCT	1981	DBLP DOI BibTeX RDF
68	Robert P. Daley	On the Error Correcting Power of Pluralism in Inductive Inference.	FCT	1981	DBLP DOI BibTeX RDF
68	Zoltán Ésik	An Axiomatization of Regular Forests in the Language of Algebraic Theories with Iteration.	FCT	1981	DBLP DOI BibTeX RDF
68	Giorgio Ausiello, Alberto Marchetti-Spaccamela, Marco Protasi	Probabilistic Analysis of the Performance of Greedy Strategies over Different Classes of Combinatorial Problems.	FCT	1981	DBLP DOI BibTeX RDF
68	Christoph Meinel	About the by Codings of Environments Induced Posets [az, <=] and [Lz, <=].	FCT	1981	DBLP DOI BibTeX RDF
68	Frank Hoffmann	One Pebble Does Not Suffice to Search Plane Labyrinths.	FCT	1981	DBLP DOI BibTeX RDF
68	Pavel Goralcik, A. Goralciková, Václav Koubek, Vojtech Rödl	Fast Recognition of Rings and Lattices.	FCT	1981	DBLP DOI BibTeX RDF
68	Ivan Hal Sudborough	Pebbling and Bandwith.	FCT	1981	DBLP DOI BibTeX RDF
68	Hajnal Andréka, István Németi	Some Universal Algebraic and Model Theoretic Results in Computer Science.	FCT	1981	DBLP DOI BibTeX RDF
68	Ales Pultr	On the Size of Conjunctive Representations of n-ary Relations.	FCT	1981	DBLP DOI BibTeX RDF
68	Jirí Vinárek	Extensions of Symmetric Hom-Functors to the Kleisli Category.	FCT	1981	DBLP DOI BibTeX RDF
68	János Demetrovics, Gyula O. H. Katona	Extremal Combinatorial Problems in Relational Data Base.	FCT	1981	DBLP DOI BibTeX RDF
68	Jerzy W. Jaromczyk	Lower Bounds for Problems Defined by Polynomial Inequalities.	FCT	1981	DBLP DOI BibTeX RDF
68	Grzegorz Rozenberg	On Subwords of Formal Languages.	FCT	1981	DBLP DOI BibTeX RDF
68	László Babai	Moderately Exponential Bound for Graph Isomorphism.	FCT	1981	DBLP DOI BibTeX RDF
68	Juhani Karhumäki	On Strongly Cube-Free Omega-Words Generated by Binary Morphisms.	FCT	1981	DBLP DOI BibTeX RDF
68	Bernard Leguy	Reducing Algebraic Tree Grammars.	FCT	1981	DBLP DOI BibTeX RDF
68	Jan Grabowski	An Algorithm to Identify Slices, with Applications to Vector Replacement Systems.	FCT	1981	DBLP DOI BibTeX RDF
68	Stephan Waack	Tape Complexity of Word Problems.	FCT	1981	DBLP DOI BibTeX RDF
68	György Turán	On Cellular Graph-Automata and Second-Order Definable Graph-Properties.	FCT	1981	DBLP DOI BibTeX RDF
68	B. Csákány	Homogenity and Completeness.	FCT	1981	DBLP DOI BibTeX RDF
68	Peter Burmeister	Quasi-Equational Logic for Partial Algebras.	FCT	1981	DBLP DOI BibTeX RDF
68	Friedhelm Meyer auf der Heide, Hans-Anton Rollik	Random Access Machines and Straight-Line Programs.	FCT	1981	DBLP DOI BibTeX RDF
68	Axel Poigné	Context-Free Languages of Infinite Words As Least Fixpoints.	FCT	1981	DBLP DOI BibTeX RDF
68	Joffroy Beauquier	A New Operation Between Languages.	FCT	1981	DBLP DOI BibTeX RDF
68	Franz-Josef Brandenburg	Analogies of PAL and COPY.	FCT	1981	DBLP DOI BibTeX RDF
68	Bernhard Korte, László Lovász 0001	Mathematical Structures Underlying Greedy Algorithms.	FCT	1981	DBLP DOI BibTeX RDF
68	Jeannine Leguy	Rational Cone and Substitution.	FCT	1981	DBLP DOI BibTeX RDF
68	Andrzej Wlodzimierz Mostowski	The Complexity of Automata and Subtheories of Monadic Second Order Arithmetics.	FCT	1981	DBLP DOI BibTeX RDF
68	Ludek Kucera, Vera Trnková	Isomorphism Completeness for Some Algebraic Structures.	FCT	1981	DBLP DOI BibTeX RDF
68	Egon Börger	Logical Description of Computation Processes.	FCT	1981	DBLP DOI BibTeX RDF
68	Ildikó Sain	First Order Dynamic Logic with Decidable Proofs and Workable Model Theory.	FCT	1981	DBLP DOI BibTeX RDF
68	Matti Linna	On the Regularity Problem of SF-Languages Generated by Minimal Linear Grammars.	FCT	1981	DBLP DOI BibTeX RDF
68	Peter H. Starke	Processes in Petri Nets.	FCT	1981	DBLP DOI BibTeX RDF
62	Eric Angel, Evripidis Bampis, Laurent Gourvès, Jérôme Monnot	(Non)-Approximability for the Multi-criteria TSP(1, 2).	FCT	2005	DBLP DOI BibTeX RDF
60	Michael Breuß, Joachim Weickert	Highly Accurate PDE-Based Morphology for General Structuring Elements.	SSVM	2009	DBLP DOI BibTeX RDF
60	Guangyu Huang, Cher Ming Tan	Reverse Breakdown Voltage Measurement for Power P+NN+ Rectifier.	J. Electron. Test.	2008	DBLP DOI BibTeX RDF	Forced voltage test, Forced current test, PIV test, Minimum required test time, Destruction during test
59	Hong Yan 0001	Detection of Curved Text Path Based on the Fuzzy Curve-Tracing (FCT) Algorithm.	ICDAR	2001	DBLP DOI BibTeX RDF	Processing of artistic documents, Extraction of text lines, Fuzzy c-means (FCM) clustering algorithm, Fuzzy curve-tracing (FCT) algorithm, Character recognition, Document image analysis
53	André Mateus 0001, Omar Tahri, Pedro Miraldo	Active Structure-from-Motion for 3D Straight LinesBehaviors* This work was partially supported by the Portuguese FCT grants PD/Bd/135015/2017 (through the NETSys Doctoral Program) & SFRH/BPD/111495/2015, and ISRILARSyS Strategic Funding by the FCT project PEst-OE/EEI/LA0009/2013.	IROS	2018	DBLP DOI BibTeX RDF
46	Hong Yan 0001	Convergence condition and efficient implementation of the fuzzy curve-tracing (FCT) algorithm.	IEEE Trans. Syst. Man Cybern. Part B	2004	DBLP DOI BibTeX RDF
42	Henning Fernau, Klaus Jansen (eds.)	Fundamentals of Computation Theory - 24th International Symposium, FCT 2023, Trier, Germany, September 18-21, 2023, Proceedings	FCT	2023	DBLP DOI BibTeX RDF
42	Sewon Park 0001	Verified Exact Real Computation with Nondeterministic Functions and Limits.	FCT	2023	DBLP DOI BibTeX RDF
42	Emmanuel Sam, Benjamin Bergougnoux, Petr A. Golovach, Nello Blaser	Kernelization for Finding Lineal Topologies (Depth-First Spanning Trees) with Many or Few Leaves.	FCT	2023	DBLP DOI BibTeX RDF
42	Pamela Fleischmann, Jonas Höfer, Annika Huch, Dirk Nowotka	α-β-Factorization and the Binary Case of Simon's Congruence.	FCT	2023	DBLP DOI BibTeX RDF
42	Kodai Tanaka, Takaaki Mizuki	Two UNO Decks Efficiently Perform Zero-Knowledge Proof for Sudoku.	FCT	2023	DBLP DOI BibTeX RDF
42	Van Bang Le, Christian Rosenke	Computing Optimal Leaf Roots of Chordal Cographs in Linear Time.	FCT	2023	DBLP DOI BibTeX RDF
42	Jan Matyás Kristan, Jakub Svoboda	Shortest Dominating Set Reconfiguration Under Token Sliding.	FCT	2023	DBLP DOI BibTeX RDF
42	Yuya Higashikawa, Naoki Katoh, Guohui Lin, Eiji Miyano, Suguru Tamaki, Junichi Teruyama, Binhai Zhu	On Computing a Center Persistence Diagram.	FCT	2023	DBLP DOI BibTeX RDF
42	Nick Brettell, Jelle J. Oostveen, Sukanya Pandey, Daniël Paulusma, Erik Jan van Leeuwen	Computing Subset Vertex Covers in H-Free Graphs.	FCT	2023	DBLP DOI BibTeX RDF
42	Johanna Björklund	The Impact of State Merging on Predictive Accuracy in Probabilistic Tree Automata: Dietze's Conjecture Revisited.	FCT	2023	DBLP DOI BibTeX RDF
42	Antonio Al Serhali, Joachim Niehren	Subhedge Projection for Stepwise Hedge Automata.	FCT	2023	DBLP DOI BibTeX RDF
42	Nathalie Aubrun, Nicolas Bitar	Domino Snake Problems on Groups.	FCT	2023	DBLP DOI BibTeX RDF
42	Jeff Kinne, Akbar Rafiey, Arash Rafiey, Mohammad Sorkhpar	Vertex Ordering with Precedence Constraints.	FCT	2023	DBLP DOI BibTeX RDF
42	Samy Abbes	Convergence of Distributions on Paths.	FCT	2023	DBLP DOI BibTeX RDF
42	Zohair Raza Hassan, Edith Hemaspaandra, Stanislaw P. Radziszowski	The Complexity of (Pk, Pℓ )-Arrowing.	FCT	2023	DBLP DOI BibTeX RDF
42	William S. Evans, David G. Kirkpatrick	Minimizing Query Frequency to Bound Congestion Potential for Moving Entities at a Fixed Target Time.	FCT	2023	DBLP DOI BibTeX RDF
42	Daniela Bubboloni, Costanza Catalano, Andrea Marino 0001, Ana Silva 0001	On Computing Optimal Temporal Branchings.	FCT	2023	DBLP DOI BibTeX RDF
42	Carlos Alegría, Justin Dallant, Pablo Pérez-Lantero, Carlos Seara	The Rectilinear Convex Hull of Line Segments.	FCT	2023	DBLP DOI BibTeX RDF
42	Ajinkya Gaikwad, Soumen Maity	Parameterized Complexity of the Th+1-Free Edge Deletion Problem.	FCT	2023	DBLP DOI BibTeX RDF
42	Feston Kastrati, Wendy J. Myrvold, Lucas D. Panjer, Aaron Williams	Cordial Forests.	FCT	2023	DBLP DOI BibTeX RDF
42	Fabian Frei, David Wehner	Bounds for c-Ideal Hashing.	FCT	2023	DBLP DOI BibTeX RDF
42	Joshua A. Grochow, Michael Levet	On the Parallel Complexity of Group Isomorphism via Weisfeiler-Leman.	FCT	2023	DBLP DOI BibTeX RDF
42	Johannes Rauch, Dieter Rautenbach, Uéverton S. Souza	Exact and Parameterized Algorithms for the Independent Cutset Problem.	FCT	2023	DBLP DOI BibTeX RDF
42	Dipayan Chakraborty, R. B. Sandeep	Contracting Edges to Destroy a Pattern: A Complexity Study.	FCT	2023	DBLP DOI BibTeX RDF
42	Lamar Chidiac, Santiago Guzmán-Pro, Winfried Hochstättler, Anthony Youssef	An Efficient Computation of the Rank Function of a Positroid.	FCT	2023	DBLP DOI BibTeX RDF
42	Tomoyuki Yamakami	Power of Counting by Nonuniform Families of Polynomial-Size Finite Automata.	FCT	2023	DBLP DOI BibTeX RDF
42	Martin Berglund, Henrik Björklund, Johanna Björklund	Parsing Unranked Tree Languages, Folded Once.	FCT	2023	DBLP DOI BibTeX RDF
42	Zack Fitzsimmons, Edith Hemaspaandra	Complexity of Conformant Election Manipulation.	FCT	2023	DBLP DOI BibTeX RDF
42	Chris Köcher, Dietrich Kuske	Forwards- and Backwards-Reachability for Cooperating Multi-pushdown Systems.	FCT	2023	DBLP DOI BibTeX RDF
42	Dibyayan Chakraborty, Florent Foucaud, Anni Hakanen	Distance-Based Covering Problems for Graphs of Given Cyclomatic Number.	FCT	2023	DBLP DOI BibTeX RDF
42	Philip Kaelbling, Dakotah Lambert, Jeffrey Heinz	Robust Identification in the Limit from Incomplete Positive Data.	FCT	2023	DBLP DOI BibTeX RDF
42	Evripidis Bampis, Aris Pagourtzis (eds.)	Fundamentals of Computation Theory - 23rd International Symposium, FCT 2021, Athens, Greece, September 12-15, 2021, Proceedings	FCT	2021	DBLP DOI BibTeX RDF
42	Marc Neveling, Jörg Rothe, Robin Weishaupt	The Possible Winner Problem with Uncertain Weights Revisited.	FCT	2021	DBLP DOI BibTeX RDF
42	Piotr Borowiecki, Dariusz Dereniowski, Dorota Osula	The Complexity of Bicriteria Tree-Depth.	FCT	2021	DBLP DOI BibTeX RDF
42	Nicolas Bousquet, Alice Joffard	TS-Reconfiguration of Dominating Sets in Circle and Circular-Arc Graphs.	FCT	2021	DBLP DOI BibTeX RDF
42	Sanjana Dey, Anil Maheshwari, Subhas C. Nandy	Minimum Consistent Subset Problem for Trees.	FCT	2021	DBLP DOI BibTeX RDF
42	Alessio Conte, Roberto Grossi, Grigorios Loukides, Nadia Pisanti, Solon P. Pissis, Giulia Punzi	Beyond the BEST Theorem: Fast Assessment of Eulerian Trails.	FCT	2021	DBLP DOI BibTeX RDF
42	Jin-Yi Cai, Austen Z. Fan, Yin Liu	Bipartite 3-Regular Counting Problems with Mixed Signs.	FCT	2021	DBLP DOI BibTeX RDF
42	Kyrill Winkler, Ulrich Schmid 0001, Thomas Nowak	Valency-Based Consensus Under Message Adversaries Without Limit-Closure.	FCT	2021	DBLP DOI BibTeX RDF
42	Ashwin Jacob, Diptapriyo Majumdar, Venkatesh Raman 0001	Faster FPT Algorithms for Deletion to Pairs of Graph Classes.	FCT	2021	DBLP DOI BibTeX RDF