Search results for "width"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
22	Krishnan Padmanabhan	On the tradeoff between node degree and communication channel width in shuffle-exchange networks.	SPDP	1991	DBLP DOI BibTeX RDF
22	John D. Hobby	Rasterizing curves of constant width.	J. ACM	1989	DBLP DOI BibTeX RDF
22	Charles H. Ng	A "gridless" Variable-Width Channel Router for Marco Cell Design.	DAC	1987	DBLP DOI BibTeX RDF
22	Naomi Rotenberg, Ascher Opler	Variable width stacks.	Commun. ACM	1963	DBLP DOI BibTeX RDF
21	Mamadou Moustapha Kanté, Eun Jung Kim 0002, O-joung Kwon, Sang-il Oum	Obstructions for matroids of path-width at most k and graphs of linear rank-width at most k.	J. Comb. Theory, Ser. B	2023	DBLP DOI BibTeX RDF
21	Tori Shimizu, Kenjiro Tadakuma, Masahiro Watanabe, Kazuki Abe, Masashi Konyo, Satoshi Tadokoro	Permanent-Magnetically Amplified Robotic Gripper With Less Clamping Width Influence on Compensation Realized by a Stepless Width Adjustment Mechanism.	IEEE Robotics Autom. Lett.	2023	DBLP DOI BibTeX RDF
21	Andrea Munaro, Shizhou Yang	On algorithmic applications of sim-width and mim-width of (H1,H2)-free graphs.	Theor. Comput. Sci.	2023	DBLP DOI BibTeX RDF
21	Benjamin Bergougnoux, Jakub Gajarský, Grzegorz Guspiel, Petr Hlinený, Filip Pokrývka, Marek Sokolowski 0001	Sparse Graphs of Twin-width 2 Have Bounded Tree-width.	CoRR	2023	DBLP DOI BibTeX RDF
21	Yeonsu Chang, O-joung Kwon, Myounghwan Lee	A new width parameter of graphs based on edge cuts: $α$-edge-crossing width.	CoRR	2023	DBLP DOI BibTeX RDF
21	Benjamin Bergougnoux, Tuukka Korhonen, Igor Razgon	New Width Parameters for Independent Set: One-sided-mim-width and Neighbor-depth.	CoRR	2023	DBLP DOI BibTeX RDF
21	Benjamin Bergougnoux, Jakub Gajarský, Grzegorz Guspiel, Petr Hlinený, Filip Pokrývka, Marek Sokolowski 0001	Sparse Graphs of Twin-Width 2 Have Bounded Tree-Width.	ISAAC	2023	DBLP DOI BibTeX RDF
21	Yeonsu Chang, O-joung Kwon, Myounghwan Lee	A New Width Parameter of Graphs Based on Edge Cuts: α-Edge-Crossing Width.	WG	2023	DBLP DOI BibTeX RDF
21	Benjamin Bergougnoux, Tuukka Korhonen, Igor Razgon	New Width Parameters for Independent Set: One-Sided-Mim-Width and Neighbor-Depth.	WG	2023	DBLP DOI BibTeX RDF
21	Mateus de Oliveira Oliveira, Farhad Vadiee	From Width-Based Model Checking to Width-Based Automated Theorem Proving.	AAAI	2023	DBLP DOI BibTeX RDF
21	Elena Di Lavore, Pawel Sobocinski 0001	Monoidal Width: Capturing Rank Width.	ACT	2022	DBLP DOI BibTeX RDF
21	Mateus de Oliveira Oliveira, Farhad Vadiee	From Width-Based Model Checking to Width-Based Automated Theorem Proving.	CoRR	2022	DBLP DOI BibTeX RDF
21	Andrea Munaro, Shizhou Yang	On algorithmic applications of sim-width and mim-width of (H1, H2)-free graphs.	CoRR	2022	DBLP DOI BibTeX RDF
21	Mamadou Moustapha Kanté, Eun Jung Kim 0002, O-joung Kwon, Sang-il Oum	Obstructions for Matroids of Path-Width at most k and Graphs of Linear Rank-Width at most k.	STACS	2022	DBLP DOI BibTeX RDF
21	Jakub Balabán, Petr Hlinený	Twin-Width is Linear in the Poset Width.	CoRR	2021	DBLP BibTeX RDF
21	Ting-Wu Chin, Diana Marculescu, Ari S. Morcos	Width Transfer: On the (In)variance of Width Optimization.	CoRR	2021	DBLP BibTeX RDF
21	Ting-Wu Chin, Diana Marculescu, Ari S. Morcos	Width Transfer: On the (In)variance of Width Optimization.	CVPR Workshops	2021	DBLP BibTeX RDF
21	Jakub Balabán, Petr Hlinený	Twin-Width Is Linear in the Poset Width.	IPEC	2021	DBLP DOI BibTeX RDF
21	Benjamin Merlin Bumpus, Kitty Meeks, William Pettersson	Directed branch-width: A directed analogue of tree-width.	CoRR	2020	DBLP BibTeX RDF
21	Michal Wrona	Relational Width of First-Order Expansions of Homogeneous Graphs with Bounded Strict Width.	CoRR	2020	DBLP BibTeX RDF
21	Michal Wrona	On The Relational Width of First-Order Expansions of Finitely Bounded Homogeneous Binary Cores with Bounded Strict Width.	CoRR	2020	DBLP BibTeX RDF
21	Bogdan Alecu, Mamadou Moustapha Kanté, Vadim V. Lozin, Viktor Zamaraev	Between clique-width and linear clique-width of bipartite graphs.	Discret. Math.	2020	DBLP DOI BibTeX RDF
21	Michal Wrona	On The Relational Width of First-Order Expansions of Finitely Bounded Homogeneous Binary Cores with Bounded Strict Width.	LICS	2020	DBLP DOI BibTeX RDF
21	Michal Wrona	Relational Width of First-Order Expansions of Homogeneous Graphs with Bounded Strict Width.	STACS	2020	DBLP DOI BibTeX RDF
21	Frank Gurski, Carolin Rehs	Forbidden Directed Minors, Directed Path-Width and Directed Tree-Width of Tree-Like Digraphs.	SOFSEM	2019	DBLP DOI BibTeX RDF
21	Frank Gurski, Carolin Rehs	Computing directed path-width and directed tree-width of recursively defined digraphs.	CoRR	2018	DBLP BibTeX RDF
21	Francesco Scarcello	From Hypertree Width to Submodular Width and Data-dependent Structural Decompositions.	SEBD	2018	DBLP BibTeX RDF
21	Frank Gurski, Carolin Rehs	Directed Path-Width and Directed Tree-Width of Directed Co-graphs.	COCOON	2018	DBLP DOI BibTeX RDF
21	Bernhard Bliem, Sebastian Ordyniak, Stefan Woltran	Clique-Width and Directed Width Measures for Answer-Set Programming.	CoRR	2016	DBLP BibTeX RDF
21	Bernhard Bliem, Sebastian Ordyniak, Stefan Woltran	Clique-Width and Directed Width Measures for Answer-Set Programming.	ECAI	2016	DBLP DOI BibTeX RDF
21	Isolde Adler, Mamadou Moustapha Kanté	Linear rank-width and linear clique-width of trees.	Theor. Comput. Sci.	2015	DBLP DOI BibTeX RDF
21	Kamil Khadiev	Width Hierarchy for k-OBDD of Small Width.	Electron. Colloquium Comput. Complex.	2015	DBLP BibTeX RDF
21	Leonid I. Tsytovich, Olesya G. Brylina	Pulse-width and pulse-frequency-width sweeping converters for potential separation of DC circuits.	Autom. Control. Comput. Sci.	2015	DBLP DOI BibTeX RDF
21	Kamil Khadiev	Width Hierarchy for k-OBDD of Small Width.	CoRR	2015	DBLP BibTeX RDF
21	Ryo Harada, Yukio Mitsuyama, Masanori Hashimoto, Takao Onoye	SET Pulse-Width Measurement Suppressing Pulse-Width Modulation and Within-Die Process Variation Effects.	IEICE Trans. Fundam. Electron. Commun. Comput. Sci.	2014	DBLP DOI BibTeX RDF
21	Martin Fürer	A Natural Generalization of Bounded Tree-Width and Bounded Clique-Width.	CoRR	2014	DBLP BibTeX RDF
21	Slawomir Lasota 0001	Bounded width = strict width 2, for coset templates.	CoRR	2014	DBLP BibTeX RDF
21	O-joung Kwon, Sang-il Oum	Graphs of small rank-width are pivot-minors of graphs of small tree-width.	Discret. Appl. Math.	2014	DBLP DOI BibTeX RDF
21	Martin Fürer	A Natural Generalization of Bounded Tree-Width and Bounded Clique-Width.	LATIN	2014	DBLP DOI BibTeX RDF
21	Aiswarya Cyriac	Verification of communicating recursive programs via split-width. (Vérification de programmes récursifs et communicants via split-width).		2014	RDF
21	Daniel Meister 0001, Udi Rotics	Minimal forbidden induced subgraphs of graphs of bounded clique-width and bounded linear clique-width.	CoRR	2013	DBLP BibTeX RDF
21	Tomohiko Yano, Toru Nakura, Kunihiro Asada	Low pass filter-less pulse width controlled PLL with zero phase offset using pulse width accumulator.	ICECS	2013	DBLP DOI BibTeX RDF
21	Isolde Adler, Mamadou Moustapha Kanté	Linear Rank-Width and Linear Clique-Width of Trees.	WG	2013	DBLP DOI BibTeX RDF
21	MohammadAli Safari	Hyper-T-width and hyper-D-width: Stable connectivity measures for hypergraphs.	Theor. Comput. Sci.	2012	DBLP DOI BibTeX RDF
21	O-joung Kwon, Sang-il Oum	Graphs of Small Rank-width are Pivot-minors of Graphs of Small Tree-width	CoRR	2012	DBLP BibTeX RDF
21	Hajime Tanaka 0001	Vertex Subsets with Minimal Width and Dual Width in Q-Polynomial Distance-Regular Graphs.	Electron. J. Comb.	2011	DBLP DOI BibTeX RDF
21	Pinar Heggernes, Daniel Meister 0001, Udi Rotics	Computing the Clique-Width of Large Path Powers in Linear Time via a New Characterisation of Clique-Width.	CSR	2011	DBLP DOI BibTeX RDF
21	Eli Ben-Sasson, Jan Johannsen	Lower Bounds for Width-Restricted Clause Learning on Formulas of Small Width.	IJCAI	2011	DBLP DOI BibTeX RDF
21	Fedor V. Fomin, Sang-il Oum, Dimitrios M. Thilikos	Rank-width and tree-width of H-minor-free graphs.	Eur. J. Comb.	2010	DBLP DOI BibTeX RDF
21	Eli Ben-Sasson, Jan Johannsen	Lower bounds for width-restricted clause learning on small width formulas.	Electron. Colloquium Comput. Complex.	2010	DBLP BibTeX RDF
21	Eli Ben-Sasson, Jan Johannsen	Lower Bounds for Width-Restricted Clause Learning on Small Width Formulas.	SAT	2010	DBLP DOI BibTeX RDF
21	Mafijul Md. Islam, Per Stenström	Characterization and exploitation of narrow-width loads: the narrow-width cache approach.	CASES	2010	DBLP DOI BibTeX RDF
21	Daniel Král	Decomposition width - a new width parameter for matroids	CoRR	2009	DBLP BibTeX RDF
21	Hans Adler, Isolde Adler	A note on clique-width and tree-width for structures	CoRR	2008	DBLP BibTeX RDF
21	Eldar Fischer, Johann A. Makowsky, Elena V. Ravve	Counting truth assignments of formulas of bounded tree-width or clique-width.	Discret. Appl. Math.	2008	DBLP DOI BibTeX RDF
21	Petr Hlinený, Sang-il Oum, Detlef Seese, Georg Gottlob	Width Parameters Beyond Tree-width and their Applications.	Comput. J.	2008	DBLP DOI BibTeX RDF
21	Sang-il Oum	Rank-width is less than or equal to branch-width.	J. Graph Theory	2008	DBLP DOI BibTeX RDF
21	Karol Suchan, Ioan Todinca	On powers of graphs of bounded NLC-width (clique-width).	Discret. Appl. Math.	2007	DBLP DOI BibTeX RDF
21	Frank Gurski	Characterizations for co-graphs defined by restricted NLC-width or clique-width operations.	Discret. Math.	2006	DBLP DOI BibTeX RDF
21	Hajime Tanaka 0001	Classification of subsets with minimal width and dual width in Grassmann, bilinear forms and dual polar graphs.	J. Comb. Theory, Ser. A	2006	DBLP DOI BibTeX RDF
21	Sang-il Oum, Paul D. Seymour	Approximating clique-width and branch-width.	J. Comb. Theory, Ser. B	2006	DBLP DOI BibTeX RDF
21	Alex Brodsky	An impossibility gap between width-4 and width-5 permutation branching programs.	Inf. Process. Lett.	2005	DBLP DOI BibTeX RDF
21	Frank Gurski, Egon Wanke	On the relationship between NLC-width and linear NLC-width.	Theor. Comput. Sci.	2005	DBLP DOI BibTeX RDF
21	Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider	Proving NP-hardness for clique-width II: non-approximability of clique-width	Electron. Colloquium Comput. Complex.	2005	DBLP BibTeX RDF
21	Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider	Proving NP-hardness for clique-width I: non-approximability of sequential clique-width	Electron. Colloquium Comput. Complex.	2005	DBLP BibTeX RDF
21	Georg Gottlob, Reinhard Pichler	Hypergraphs in Model Checking: Acyclicity and Hypertree-Width versus Clique-Width.	SIAM J. Comput.	2004	DBLP DOI BibTeX RDF
21	Wolfgang Espelage, Frank Gurski, Egon Wanke	Deciding Clique-Width for Graphs of Bounded Tree-Width.	J. Graph Algorithms Appl.	2003	DBLP DOI BibTeX RDF
21	Andries E. Brouwer, Chris D. Godsil, Jack H. Koolen, William J. Martin	Width and dual width of subsets in polynomial association schemes.	J. Comb. Theory, Ser. A	2003	DBLP DOI BibTeX RDF
21	Timothy M. Chan	Approximating the Diameter, Width, Smallest Enclosing Cylinder, and Minimum-Width Annulus.	Int. J. Comput. Geom. Appl.	2002	DBLP DOI BibTeX RDF
21	Timothy M. Chan	Approximating the diameter, width, smallest enclosing cylinder, and minimum-width annulus.	SCG	2000	DBLP DOI BibTeX RDF
21	Jinjiang Yuan	Path-width and tree-width of the join of graphs.	Ars Comb.	1996	DBLP BibTeX RDF
21	Daniel Bienstock	Graph Searching, Path-Width, Tree-Width and Related Problems (A Survey).	Reliability Of Computer And Communication Networks	1989	DBLP DOI BibTeX RDF
21	Tomás Recio, Luis Miguel Pardo	Rabin's width of a complete proof and the width of a semialgebraic set.	EUROCAL	1987	DBLP DOI BibTeX RDF
20	Somnath Paul, Swarup Bhunia	VAIL: variation-aware issue logic and performance binning for processor yield and profit improvement.	ISLPED	2010	DBLP DOI BibTeX RDF	narrow-width operand, superscalar processor, within-die variation
20	Adam B. Kinsman, Nicola Nicolici	Robust design methods for hardware accelerators for iterative algorithms in scientific computing.	DAC	2010	DBLP DOI BibTeX RDF	bit-width allocation, satisfiability-modulo theory
20	Martin Fürer	Efficient Computation of the Characteristic Polynomial of a Tree and Related Tasks.	ESA	2009	DBLP DOI BibTeX RDF	counting matchings, counting independent sets, bounded tree-width, efficient algorithms, characteristic polynomial
20	Paramvir Bahl, Ranveer Chandra, Thomas Moscibroda, Rohan Murty, Matt Welsh	White space networking with wi-fi like connectivity.	SIGCOMM	2009	DBLP DOI BibTeX RDF	channel width, white spaces, cognitive radios, wi-fi, dynamic spectrum access
20	Xianfeng Shen, Wenrong Huang, Chao Xu, Xingjun Wang	Bi-directional Prediction between Weld Penetration and Processing Parameters in Electron Beam Welding Using Artificial Neural Networks.	ISNN (3)	2009	DBLP DOI BibTeX RDF	Bi-directional prediction, Electron beam welding, Penetration width, Processing parameters, BP neural network, Penetration depth
20	Saurabh Garg 0001, Karali Patra, Surjya K. Pal, Debabrata Chakraborty	Effect of different basis functions on a radial basis function network in prediction of drill flank wear from motor current signals.	Soft Comput.	2008	DBLP DOI BibTeX RDF	Basis width, Flank wear, Radial basis function network, Basis function, Drilling
20	Andreas Brandstädt, Christian Hundt 0001	Ptolemaic Graphs and Interval Graphs Are Leaf Powers.	LATIN	2008	DBLP DOI BibTeX RDF	and Classification Leaf powers, leaf roots, strongly chordal graphs, ptolemaic graphs, graph class inclusions, (unit) interval graphs, clique-width, graph powers
20	M. Zafar Ullah Khan, M. Mubashir Hussain, Dil Muhammad Akbar Hussain	Design and Implementation of a Selective Harmonic Elimination SPWM Strategy-Based Inverter.	IMTIC	2008	DBLP DOI BibTeX RDF	Sinusoidal Pulse Width Modulation (SPWM), Selective Harmonic Elimination SPWM (SHE SPWM), Total Harmonic Distortion (THD), Natural Sampling SPWM, Regular Sampled Asymmetric SPWM, Modified Asymmetric Regular Sampled SPWM, Regular Sampled Symmetric SPWM, PIC Microcontroller, Gate Drive Amplifier (GDA), MATLAB
20	Xianhua Liu 0001, Jiyu Zhang, Xu Cheng 0001	Efficient code size reduction without performance loss.	SAC	2007	DBLP DOI BibTeX RDF	dual-width instruction set, mixed code generation, embedded system, code size reduction
20	Xianhua Liu 0001, Jiyu Zhang, Xu Cheng 0001	NISD: A Framework for Automatic Narrow Instruction Set Design.	ICESS	2007	DBLP DOI BibTeX RDF	dual-width instruction set, narrow instruction set design, automatic instruction set design
20	Huibo Lou, Chengxiong Mao, Jiming Lu, Dan Wang 0008, Luonan Chen	Double Three-Level Inverter Based Variable Frequency Drive with Minimal Total Harmonic Distortion Using Particle Swarm Optimization.	ICIC (1)	2007	DBLP DOI BibTeX RDF	three-level inverter, total harmonic distortion, particle swarm optimization, pulse width modulation
20	Krisztina Szalisznyó	Role of hyperpolarization-activated conductances in the lateral superior olive: A modeling study.	J. Comput. Neurosci.	2006	DBLP DOI BibTeX RDF	hyperpolarization activated currents, LSO, interaural sound intensity difference, rate code, dynamic width, type I neuron, type II neuron
20	Camille Vuillaume, Katsuyuki Okeya	Flexible Exponentiation with Resistance to Side Channel Attacks.	ACNS	2006	DBLP DOI BibTeX RDF	fractional width, RSA, side channel attacks, simple power analysis
20	Marvin Tom, David Leong, Guy G. Lemieux	Un/DoPack: re-clustering of large system-on-chip designs with interconnect variation for low-cost FPGAs.	ICCAD	2006	DBLP DOI BibTeX RDF	channel width constraints, clustering, field-programmable gate arrays (FPGA), packing
20	Eric L. Faulring, J. Edward Colgate, Michael A. Peshkin	Control and Performance of the Rotational-to-Linear Cobotic Transmission.	HAPTICS	2006	DBLP DOI BibTeX RDF	cobots, z-width, rotational-to-linear transmission, haptics
20	Behrooz Parhami, Mikhail A. Rakov	Perfect Difference Networks and Related Interconnection Structures for Parallel and Distributed Systems.	IEEE Trans. Parallel Distributed Syst.	2005	DBLP DOI BibTeX RDF	hyperstar, low-diameter network, two-hop connectivity, interconnection network, Bipartite graph, diameter, degree, chordal ring, regular network, bisection width
20	Sergey Kulikov, I. Scott MacKenzie, Wolfgang Stürzlinger	Measuring the effective parameters of steering motions.	CHI Extended Abstracts	2005	DBLP DOI BibTeX RDF	effective width, Fitts' law, error rate, steering law
20	Fedor V. Fomin, Dimitrios M. Thilikos	Fast Parameterized Algorithms for Graphs on Surfaces: Linear Kernel and Exponential Speed-Up.	ICALP	2004	DBLP DOI BibTeX RDF	embedded graphs, subexponential algorithms, Dominating set, parameterized algorithms, branch-width
20	Mizuhito Ogawa, Zhenjiang Hu, Isao Sasano	Iterative-free program analysis.	ICFP	2003	DBLP DOI BibTeX RDF	SP term, dynamic programming, program analysis, register allocation, control flow graph, tree width, catamorphism
20	Katsuyuki Okeya, Tsuyoshi Takagi	A More Flexible Countermeasure against Side Channel Attacks Using Window Method.	CHES	2003	DBLP DOI BibTeX RDF	Width-w NAF, Fractional window, Pre-computation Table, Smart Card, Side Channel Attacks, Elliptic Curve Cryptosystem, Memory Constraint
20	Jens Lienig, Goeran Jerke, Thorsten Adler	Electromigration Avoidance in Analog Circuits: Two Methodologies for Current-Driven Routing.	ASP-DAC/VLSI Design	2002	DBLP DOI BibTeX RDF	wire width, wire planning, current-driven routing, Design methodology, electromigration, detailed routing, current density, analog circuit design
20	David Linnan Li, Shahriar Shahriari	Games of Chains and Cutsets in the Boolean Lattice II.	Order	2001	DBLP DOI BibTeX RDF	Boolean lattice, games on the Boolean lattice, independent chains, maximal chain, width, cutset
20	Zahra Sadat Ebadi, André Ivanov	Design of an Optimal Test Access Architecture Using a Genetic Algorithm.	Asian Test Symposium	2001	DBLP DOI BibTeX RDF	Optimal testing time, test data width, Genetic Algorithm, Test Access Mechanism (TAM), SOC testing, Embedded core testing