Search results for "width"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
33	Andreas Brandstädt, Joost Engelfriet, Hoàng-Oanh Le, Vadim V. Lozin	Clique-Width for 4-Vertex Forbidden Subgraphs.	Theory Comput. Syst.	2006	DBLP DOI BibTeX RDF
33	Ferdous Ahmed Sohel, Laurence S. Dooley, Gour C. Karmakar	Variable Width Admissible Control Point Band for Vertex Based Operational-Rate-Distortion Optimal Shape Coding Algorithms.	ICIP	2006	DBLP DOI BibTeX RDF
33	Stefan Wörz, Karl Rohr	Limits on Estimating the Width of Thin Vessels in 3D Medical Images.	Bildverarbeitung für die Medizin	2006	DBLP DOI BibTeX RDF
33	Osman S. Unsal, Oguz Ergin, Xavier Vera, Antonio González 0001	Empowering a helper cluster through data-width aware instruction selection policies.	IPDPS	2006	DBLP DOI BibTeX RDF
33	Stefan Wörz, Karl Rohr	Limits on Estimating the Width of Thin Tubular Structures in 3D Images.	MICCAI (1)	2006	DBLP DOI BibTeX RDF
33	Andreas Brandstädt, Joost Engelfriet, Hoàng-Oanh Le, Vadim V. Lozin	Clique-Width for Four-Vertex Forbidden Subgraphs.	FCT	2005	DBLP DOI BibTeX RDF
33	Hung-Ch Lee, Kuo-Tai Chang, Ke-Horng Chen, Wen Tsao Chen	Power Saving of a Dynamic Width Controller for a Monolithic Current-Mode CMOS DC-DC Converter.	IWSOC	2005	DBLP DOI BibTeX RDF
33	Emre Özer 0001, Andy Nisbet, David Gregg	Stochastic Bit-Width Approximation Using Extreme Value Theory for Customizable Processors.	CC	2004	DBLP DOI BibTeX RDF
33	Hideo Okawara	Precise Pulse Width Measurement in Write Pre-compensation Test.	ITC	2004	DBLP DOI BibTeX RDF
33	Frank Gurski, Egon Wanke	Vertex Disjoint Paths on Clique-Width Bounded Graphs.	LATIN	2004	DBLP DOI BibTeX RDF
33	Jason Cong, David Zhigang Pan	Wire width planning for interconnect performance optimization.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	2002	DBLP DOI BibTeX RDF
33	Costas Busch, Maurice Herlihy	Sorting and Counting Networks of Arbitrary Width and Small Depth.	Theory Comput. Syst.	2002	DBLP DOI BibTeX RDF
33	Gabriel H. Loh	Exploiting data-width locality to increase superscalar execution bandwidth.	MICRO	2002	DBLP DOI BibTeX RDF
33	David R. Wood	Queue Layouts, Tree-Width, and Three-Dimensional Graph Drawing.	FSTTCS	2002	DBLP DOI BibTeX RDF
33	Sergei L. Bezrukov, Robert Elsässer, Burkhard Monien, Robert Preis, Jean-Pierre Tillich	New Spectral Lower Bounds on the Bisection Width of Graphs.	WG	2000	DBLP DOI BibTeX RDF
33	David S. Kung 0001, Ruchir Puri	Optimal P/N width ratio selection for standard cell libraries.	ICCAD	1999	DBLP DOI BibTeX RDF
33	Fenghao Mu, Christer Svensson	High speed multistage CMOS clock buffers with pulse width control loop.	ISCAS (2)	1999	DBLP DOI BibTeX RDF
32	Faustina Hwang, Simeon Keates, Patrick Langdon, P. John Clarkson	Movement time for motion-impaired users assisted by force-feedback: effects of movement amplitude, target width, and gravity well width.	Univers. Access Inf. Soc.	2005	DBLP DOI BibTeX RDF	Motion-impaired, Haptic, Force-feedback, Fitts Law
32	Wolfgang Espelage, Frank Gurski, Egon Wanke	Deciding Clique-Width for Graphs of Bounded Tree-Width.	WADS	2001	DBLP DOI BibTeX RDF
32	Frank Gurski, Egon Wanke	The NLC-width and clique-width for powers of graphs of bounded tree-width.	Discret. Appl. Math.	2009	DBLP DOI BibTeX RDF
31	Ravi Jain, Andy Koronios	Cluster Validating Techniques in the Presence of Duplicates.	Computational Intelligence Paradigms	2008	DBLP DOI BibTeX RDF	Silhouette width, Calinski & Harbasz index, Baker & Hubert indices, Clustering algorithms
31	Andreas Jakoby, Till Tantau	Logspace Algorithms for Computing Shortest and Longest Paths in Series-Parallel Graphs.	FSTTCS	2007	DBLP DOI BibTeX RDF	logspace algorithms, distance problem, longest path problem, bounded tree-width, K 4-minor-free graphs, Series-parallel graphs
31	Petr Hlinený, Detlef Seese	On Decidability of MSO Theories of Representable Matroids.	IWPEC	2004	DBLP DOI BibTeX RDF	MSO theory, decidability, matroid, branch-width
31	Jörg Flum, Markus Frick, Martin Grohe	Query evaluation via tree-decompositions.	J. ACM	2002	DBLP DOI BibTeX RDF	Acyclic conjunctive queries, combined complexity, hypergraphs, monadic second-order logic, tree-width
31	Markus Frick, Martin Grohe	Deciding first-order properties of locally tree-decomposable structures.	J. ACM	2001	DBLP DOI BibTeX RDF	model-checking, locality, planar graphs, First-order logic, query evaluation, parameterized complexity, tree-width
31	Peter Friedel, Jörg Bergmann, Stephan Seidl, Wolfgang E. Nagel	An Hierarchical MPI Communication Model for the Parallelized Solution of Multiple Integrals.	HPCN	2001	DBLP DOI BibTeX RDF	Parallel numerical solution, multiple integrals, step-width adaption, army communication model
30	Yves Guiard	The problem of consistency in the design of Fitts' law experiments: consider either target distance and width or movement form and scale.	CHI	2009	DBLP DOI BibTeX RDF	movement amplitude, movement difficulty, movement form, movement scale, movement shape, target distance, target tolerance, target width, methodology, theory, Fitts' law, experimental design
30	Rongxiang Yuan, Xiufen Zou, Chunlin Xu	A parallel evolutionary algorithm for optimal pulse-width modulation technique in power systems.	GEC Summit	2009	DBLP DOI BibTeX RDF	harmonic compensation, pulse-width modulation (pwm), switching angle, parallel algorithm, evolutionary computation
30	Mackenzie R. Scott, Rajeevan Amirtharajah	Pulse width modulation for reduced peak power full-swing on-chip interconnect.	ISLPED	2009	DBLP DOI BibTeX RDF	low power interconnect, peak power, pulse width modulation
30	János Barát	Directed Path-width and Monotonicity in Digraph Searching.	Graphs Comb.	2006	DBLP DOI BibTeX RDF	Search games, Path-width, Cops-and-robber games, Directed graph, Monotonicity
30	Zhixiang Chen 0001, Bin Fu, Yong Tang 0001, Binhai Zhu	A PTAS for a disc covering problem using width-bounded separators.	J. Comb. Optim.	2006	DBLP DOI BibTeX RDF	Width-bounded separator, Disc covering, Approximation algorithms, Randomized algorithms
30	Jaroslav Nesetril, Patrice Ossona de Mendez	Linear time low tree-width partitions and algorithmic consequences.	STOC	2006	DBLP DOI BibTeX RDF	bounded expansion, fraternal augmentation, coloration, first order logic, subgraph isomorphism, tree-width, graph minor
30	Pranava K. Jha	A Counterexample to Tang and Padubidri's Claim about the Bisection Width of a Diagonal Mesh.	IEEE Trans. Computers	2003	DBLP DOI BibTeX RDF	Diagonal mesh, bisection width
30	Michael S. Roddy	Fixed Points and Products: Width 3.	Order	2002	DBLP DOI BibTeX RDF	finite width, fixed point property, product, retract
30	Daniel Kobler, Udi Rotics	Polynomial algorithms for partitioning problems on graphs with fixed clique-width (extended abstract).	SODA	2001	DBLP BibTeX RDF	coloring, dominating set, polynomial algorithms, edge-coloring, clique-width, edge-dominating set
30	Toshinori Sato, Itsujiro Arita	Table size reduction for data value predictors by exploiting narrow width values.	ICS	2000	DBLP DOI BibTeX RDF	narrow width operands, instruction level parallelism, hardware implementation, value prediction, data speculation
30	Lizy Kurian John	VaWiRAM: a variable width random access memory module.	VLSI Design	1996	DBLP DOI BibTeX RDF	VaWiRAM, variable width random access memory, flexible memory systems, configuration pins, pass gates, reconfigurability, reconfigurable architectures, memory architecture, programmable logic, random-access storage, integrated circuit interconnections, programmable logic devices, programmable interconnect
30	Nilanjan Mukherjee 0001, Janusz Rajski, Jerzy Tyszer	On testable multipliers for fixed-width data path architectures.	ICCAD	1995	DBLP DOI BibTeX RDF	Fixed-Width Architectures, Built-in Self -Test, High-level Synthesis, Design for Testability
29	Oren Ben-Zwi, Danny Hermelin, Daniel Lokshtanov, Ilan Newman	An exact almost optimal algorithm for target set selection in social networks.	EC	2009	DBLP DOI BibTeX RDF	bounded tree-width algorithm, bounded tree-width lower-bound, target set selection, social networks, viral marketing
29	Sheayun Lee, Jaejin Lee, Chang Yun Park, Sang Lyul Min	Selective code transformation for dual instruction set processors.	ACM Trans. Embed. Comput. Syst.	2007	DBLP DOI BibTeX RDF	Dual instruction set processors, mixed-width instruction set architecture, reduced bid-width instruction set architecture
28	Xianzhang Feng, Junwei Cheng, Aimin Liu, Cai Liu, Junhui Li	Study on Head Regional of Hot Forming for Wide-Thick Plate.	WKDD	2009	DBLP DOI BibTeX RDF
28	Meena Mahajan, B. V. Raghavendra Rao	Small-Space Analogues of Valiant's Classes.	FCT	2009	DBLP DOI BibTeX RDF
28	Stephan Kreutzer	On the Parameterised Intractability of Monadic Second-Order Logic.	CSL	2009	DBLP DOI BibTeX RDF
28	Fan Wang, Vishwani D. Agrawal	Soft Error Rates with Inertial and Logical Masking.	VLSI Design	2009	DBLP DOI BibTeX RDF
28	Michael Lampis, Georgia Kaouri, Valia Mitsou	On the Algorithmic Effectiveness of Digraph Decompositions and Complexity Measures.	ISAAC	2008	DBLP DOI BibTeX RDF	Digraph decompositions, Treewidth, Parameterized Complexity
28	Alauddin Bhuiyan, Baikunth Nath, Joselíto J. Chua, Kotagiri Ramamohanarao	Vessel Cross-Sectional Diameter Measurement on Color Retinal Image.	BIOSTEC (Selected Papers)	2008	DBLP DOI BibTeX RDF	Vessel Cross-section, Adaptive Region Growing Technique, Gabor Energy Filter Bank, Texture Classification, Fuzzy C-Means Clustering, Gradient Operator
28	Shuangyu Ruan, Kazuteru Namba, Hideo Ito	Soft Error Hardened FF Capable of Detecting Wide Error Pulse.	DFT	2008	DBLP DOI BibTeX RDF
28	Roberta L. Klatzky, Susan J. Lederman	The perceived roughness of resistive virtual textures: I. rendering by a force-feedback mouse.	ACM Trans. Appl. Percept.	2006	DBLP DOI BibTeX RDF	virtual reality, haptics, Texture perception
28	Martin Grohe, Dániel Marx	Constraint solving via fractional edge covers.	SODA	2006	DBLP DOI BibTeX RDF
28	Sergey Bereg, David G. Kirkpatrick	Curvature-bounded traversals of narrow corridors.	SCG	2005	DBLP DOI BibTeX RDF	curvarure-bounded traversals, computational geometry, motion planning
28	Sachi Mizobuchi, Mark H. Chignell, David Newton	Mobile text entry: relationship between walking speed and text input task difficulty.	Mobile HCI	2005	DBLP DOI BibTeX RDF	mobile handheld devices, software QWERTY keyboard, text entry, workload, pen input, walking
28	Eli Ben-Sasson, Avi Wigderson	Short proofs are narrow - resolution made simple.	J. ACM	2001	DBLP DOI BibTeX RDF
28	Michael T. Hallett, Jens Lagergren	New algorithms for the duplication-loss model.	RECOMB	2000	DBLP DOI BibTeX RDF
28	András Sebö	An Introduction to Empty Lattice Simplices.	IPCO	1999	DBLP DOI BibTeX RDF
28	Avaneendra Gupta, John P. Hayes	Near-Optimum Hierarchical Layout Synthesis of Two-Dimensional CMOS Cells.	VLSI Design	1999	DBLP DOI BibTeX RDF
28	Chandra Chekuri, Anand Rajaraman	Conjunctive Query Containment Revisited.	ICDT	1997	DBLP DOI BibTeX RDF
28	Jens Lagergren, Stefan Arnborg	Finding Minimal Forbidden Minors Using a Finite Congruence.	ICALP	1991	DBLP DOI BibTeX RDF
27	Maw-Shang Chang, Ling-Ju Hung, Ton Kloks, Sheng-Lung Peng	Block-Graph Width.	TAMC	2009	DBLP DOI BibTeX RDF
27	Albert Atserias, Johannes Klaus Fichte, Marc Thurley	Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution.	SAT	2009	DBLP DOI BibTeX RDF
27	Ling-Ju Hung, Ton Kloks, Chuan-Min Lee	Trivially-Perfect Width.	IWOCA	2009	DBLP DOI BibTeX RDF
27	Petr Skoda 0001	Computability of Width of Submodular Partition Functions.	IWOCA	2009	DBLP DOI BibTeX RDF
27	Dana Ron, Gilad Tsur	Testing Computability by Width Two OBDDs.	APPROX-RANDOM	2009	DBLP DOI BibTeX RDF
27	Tao Wang, Irene Cheng 0001	Generation of Unit-Width Curve Skeletons Based on Valence Driven Spatial Median (VDSM).	ISVC (1)	2008	DBLP DOI BibTeX RDF
27	Yong Zhao, Wenxue Hong, Yonghong Xu, Jianxin Cui	ECG Beats Classification Based on Ensemble Feature Composed of Independent Components and QRS Complex Width.	CSSE (1)	2008	DBLP DOI BibTeX RDF
27	Jiun-Ping Wang, Shiann-Rong Kuang	Area-Efficient Signed Fixed-Width Multipliers with Low-Error Compensation Circuit.	SiPS	2007	DBLP DOI BibTeX RDF
27	Haolu Xie, Xin Wang 0031, Albert Z. Wang, Bo Qin, Hongyi Chen, Yumei Zhou, Bin Zhao 0002	A Varying Pulse Width Second Order Derivative Gaussian Pulse Generator for UWB Transceivers in CMOS.	ISCAS	2007	DBLP DOI BibTeX RDF
27	Viet Cuong Dinh, Seong Soo Chun, Seungwook Cha, Hanjin Ryu, Sanghoon Sull	An Efficient Method for Text Detection in Video Based on Stroke Width Similarity.	ACCV (1)	2007	DBLP DOI BibTeX RDF
27	Caaliph Andriamisaina, Bertrand Le Gal, Emmanuel Casseau	Bit-Width Optimizations for High-Level Synthesis of Digital Signal Processing Systems.	SiPS	2006	DBLP DOI BibTeX RDF
27	Yen-Chin Liao, Hsie-Chia Chang, Chih-Wei Liu	Carry Estimation for Two's Complement Fixed-Width Multipliers.	SiPS	2006	DBLP DOI BibTeX RDF
27	Cui Huailin, Feng Xi an, Li Zhishun	A Study of Weighted Signal Subspace Spatial Spectrum Estimation in Constant Beam Width Beam Space.	ICICIC (1)	2006	DBLP DOI BibTeX RDF
27	Tetsuya Iizuka, Makoto Ikeda, Kunihiro Asada	Exact minimum-width multi-row transistor placement for dual and non-dual CMOS cells.	ISCAS	2006	DBLP DOI BibTeX RDF
27	Hong-An Huang, Yen-Chin Liao, Hsie-Chia Chang	A self-compensation fixed-width booth multiplier and its 128-point FFT applications.	ISCAS	2006	DBLP DOI BibTeX RDF
27	Vincent Scesa, Patrick Henaff, Fathi Ben Ouezdou, Faycal Namoun	Time Window Width Influence on Dynamic BPTT(h) Learning Algorithm Performances: Experimental Study.	ICANN (1)	2006	DBLP DOI BibTeX RDF
27	Jing Kong, Xiangshi Ren	Comparison of Effiective Target Width Calculation Methods for Pointing Task.	CIT	2005	DBLP DOI BibTeX RDF
27	Min-An Song, Lan-Da Van, Chih-Chyau Yang, Shih-Chieh Chiu, Sy-Yen Kuo	A framework for the design of error-aware power-efficient fixed-width Booth multipliers.	ISCAS (1)	2005	DBLP DOI BibTeX RDF
27	Tetsuya Iizuka, Makoto Ikeda, Kunihiro Asada	High speed layout synthesis for minimum-width CMOS logic cells via Boolean satisfiability.	ASP-DAC	2004	DBLP DOI BibTeX RDF
27	Satoshi Naito, Yoshifumi Kitamura, Fumio Kishino	Steering Law in an Environment of Spatially Coupled Style with Matters of Pointer Size and Trajectory Width.	APCHI	2004	DBLP DOI BibTeX RDF
27	Mandeep Bamal, Evelyn Grossar, Michele Stucchi, Karen Maex	Interconnect width selection for deep submicron designs using the table lookup method.	SLIP	2004	DBLP DOI BibTeX RDF	interconnect sizing, power-delay trade-off, wire sizing
27	Bernd Burgstaller, Johann Blieberger, Bernhard Scholz	On the Tree Width of Ada Programs.	Ada-Europe	2004	DBLP DOI BibTeX RDF
27	Martin Grohe	Local Tree-Width, Excluded Minors, and Approximation Algorithms.	Comb.	2003	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 05C83, 05C85, 68W25
27	Jan Obdrzálek	Fast Mu-Calculus Model Checking when Tree-Width Is Bounded.	CAV	2003	DBLP DOI BibTeX RDF
27	Shaikh S. Ahmed, Dragica Vasileska	Modeling of Narrow-Width SOI Devices: The Role of Quantum Mechanical Narrow Channel Effects on Device Performance.	LSSC	2003	DBLP DOI BibTeX RDF
27	L. Sunil Chandran, Telikepalli Kavitha, C. R. Subramanian 0001	Isoperimetric Inequalities and the Width Parameters of Graphs.	COCOON	2003	DBLP DOI BibTeX RDF
27	Vida Dujmovic, Pat Morin, David R. Wood	Path-Width and Three-Dimensional Straight-Line Grid Drawings of Graphs.	GD	2002	DBLP DOI BibTeX RDF
27	Christof Löding	Ground Tree Rewriting Graphs of Bounded Tree Width.	STACS	2002	DBLP DOI BibTeX RDF
27	David Cachera, Tanguy Risset	Advances in Bit Width Selection Methodology.	ASAP	2002	DBLP DOI BibTeX RDF
27	Fumio Kawazoe, Kazuo Toraichi, Paul Wing Hing Kwan, Koichi Wada 0002	A Method on Tracking Unit Pixel Width Line Segments for Function Approximation-Based Image Coding.	IEEE Pacific Rim Conference on Multimedia	2002	DBLP DOI BibTeX RDF
27	Guoli Ding, Bogdan Oporowski, Daniel P. Sanders, Dirk Vertigan	Partitioning Graphs of Bounded Tree-Width.	Comb.	1998	DBLP DOI BibTeX RDF	AMS Subject Classification (1991) Classes: 05C15, 05C05, 05C55
27	Bruno Courcelle, Johann A. Makowsky, Udi Rotics	Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Width.	WG	1998	DBLP DOI BibTeX RDF
27	Denis Lapoire	Recognizability Equals Monadic Second-Order Definability for Sets of Graphs of Bounded Tree-Width.	STACS	1998	DBLP DOI BibTeX RDF
27	David A. Mix Barrington, Chi-Jen Lu, Peter Bro Miltersen, Sven Skyum	Searching Constant Width Mazes Captures the AC0 Hierarchy.	STACS	1998	DBLP DOI BibTeX RDF
27	Avaneendra Gupta, John P. Hayes	Width minimization of two-dimensional CMOS cells using integer programming.	ICCAD	1996	DBLP DOI BibTeX RDF	leaf cell synthesis, two-dimensional layout, diffusion sharing, transistor chains, CMOS networks, Layout optimization, module generation
27	Venkat Thanvantri, Sartaj Sahni	Folding a stack of equal width components.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	1995	DBLP DOI BibTeX RDF
27	Brian S. Cherkauer, Eby G. Friedman	Channel width tapering of serially connected MOSFET's with emphasis on power dissipation.	IEEE Trans. Very Large Scale Integr. Syst.	1994	DBLP DOI BibTeX RDF
27	Venkat Thanvantri, Sartaj K. Sahni	Folding a stack of equal width components.	ICCAD	1994	DBLP DOI BibTeX RDF
27	C. Leonard Berman	Circuit width, register allocation, and ordered binary decision diagrams.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	1991	DBLP DOI BibTeX RDF
27	Christoph Meinel	Omega-Branching Programs of Bounded Width.	CSL	1989	DBLP DOI BibTeX RDF
25	Sufen Dong, Guifa Teng, Dan Wang, Yan Hu, Fang Wang, Shuhui Chang	Research on the Transformation of Display Format for Web Information.	CCTA	2007	DBLP DOI BibTeX RDF	format transformation, width adjustment, relayout, thumbnail
25	Honghui Hu, Naijie Gu, Jing Cao	A Note on Recursive Cube of Rings Network.	IEEE Trans. Parallel Distributed Syst.	2005	DBLP DOI BibTeX RDF	Recursive Cube of Rings (RCR), disconnected graph, network diameter, bisection width
25	Geir Agnarsson, Magnús M. Halldórsson	Strong Colorings of Hypergraphs.	WAOA	2004	DBLP DOI BibTeX RDF	strong coloring, composition width, approximation, hypergraph