Search results for "Degree"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
51	Hong-Zhong Huang, Ye Tao, Yu Liu 0006	Multidisciplinary collaborative optimization using fuzzy satisfaction degree and fuzzy sufficiency degree model.	Soft Comput.	2008	DBLP DOI BibTeX RDF	Collaborative optimization, Fuzzy satisfaction degree, Fuzzy sufficiency degree, Multidisciplinary design optimization
51	Lap Chi Lau, Mohit Singh	Additive approximation for bounded degree survivable network design.	STOC	2008	DBLP DOI BibTeX RDF	approximation algorithms, steiner tree, bounded degree, iterative rounding, survivable network design
47	David J. Pritchard, Denis A. Nicole	Cube Connected Mobius Ladders: An Inherently Deadlock-Free Fixed Degree Network.	IEEE Trans. Parallel Distributed Syst.	1993	DBLP DOI BibTeX RDF	deadlock-free fixed degree network, cube-connected Mobius ladders, deadlock-free routingstrategy, fixed node degree, fixed degree topology of size, transputernetworks, parallel algorithms, computational complexity, graph theory, topology, Cayley graph, multiprocessorinterconnection network, network diameter, multiprocessor interconnectionnetworks, interval routing
44	Andrea Francke, Michael Hoffmann 0001	The Euclidean degree-4 minimum spanning tree problem is NP-hard.	SCG	2009	DBLP DOI BibTeX RDF	degree-constricted graphs, degree-restricted graphs, np-complete, reduction, spanning trees, geometric optimization, geometric graphs, bounded-degree graphs
44	Tao Li, Xiao Ciyuan	Research of Group Decision Consensus Degree Based on Extended Intuitionistic Fuzzy Set.	ICFIE	2007	DBLP DOI BibTeX RDF	extended intuitionistic fuzzy sets, intuitionistic fuzzy distance, consensus degree, average consensus degree, relative consensus degree
44	Ming Li, De-San Yang	Application of Discrimination Degree for Attributes Reduction in Concept Lattice.	PAKDD	2007	DBLP DOI BibTeX RDF	Inclusion degree, Discrimination degree, Concept lattice, Attributes reduction
42	Yuk Hei Chan, Wai Shing Fung, Lap Chi Lau, Chun Kong Yung	Degree Bounded Network Design with Metric Costs.	FOCS	2008	DBLP DOI BibTeX RDF
42	Nikhil Bansal 0001, Rohit Khandekar, Viswanath Nagarajan	Additive guarantees for degree bounded directed network design.	STOC	2008	DBLP DOI BibTeX RDF	approximation algorithms, directed graphs, network design
40	Omid Amini, David Peleg, Stéphane Pérennes, Ignasi Sau, Saket Saurabh 0001	Degree-Constrained Subgraph Problems: Hardness and Approximation Results.	WAOA	2008	DBLP DOI BibTeX RDF	Degree-Constrained Subgraphs, Apx, Excluded Minor, Approximation Algorithms, Hardness of Approximation, PTAS
40	Mário M. Freire, Joel J. P. C. Rodrigues, Rui M. F. Coelho	The Role of Network Topologies in the Optical Core of IP-over-WDM Networks with Static Wavelength Routing.	Telecommun. Syst.	2003	DBLP DOI BibTeX RDF	optical Internet, routing, network topologies, optical networks
39	Joel J. P. C. Rodrigues, Mário M. Freire, Pascal Lorenz	Performance Implications of Meshing Degree for Optical Burst Switched Networks Using One-Way Resource Reservation Protocols.	Telecommun. Syst.	2005	DBLP DOI BibTeX RDF	optical internet, performance, optical burst switching, resource reservation protocols
39	Joel J. P. C. Rodrigues, Mário M. Freire, Pascal Lorenz	The Role of Meshing Degree in Optical Burst Switching Networks Using Signaling Protocols with One-Way Reservation Schemes.	ICN (1)	2005	DBLP DOI BibTeX RDF
36	Anthony J. Dunlop, Marian Boykan Pour-El	The Degree of Unsolvability of a Real Number.	CCA	2000	DBLP DOI BibTeX RDF
36	Thomas Fritz 0001, Jingwen Ou, Gail C. Murphy, Emerson R. Murphy-Hill	A degree-of-knowledge model to capture source code familiarity.	ICSE (1)	2010	DBLP DOI BibTeX RDF	degree-of-knowledge, onboarding, interaction, recommendation, expertise, authorship, degree-of-interest
36	Sanjeev Arora, Kevin L. Chang	Approximation Schemes for Degree-Restricted MST and Red-Blue Separation Problems.	Algorithmica	2004	DBLP DOI BibTeX RDF	Degree-Restricted Minimum Spanning Tree, Low degree, Approximation algorithm
35	Mohit Singh, Lap Chi Lau	Approximating minimum bounded degree spanning trees to within one of optimal.	STOC	2007	DBLP DOI BibTeX RDF	approximation algorithm, spanning trees, bounded degree, iterative rounding
35	Dana Moshkovitz, Ran Raz	Sub-constant error low degree test of almost-linear size.	STOC	2006	DBLP DOI BibTeX RDF	plane vs. point test, probabilistically checkable proofs, locally testable codes, low degree testing
35	Navaratnasothie Selvakkumaran, Phiroze N. Parakh, George Karypis	Perimeter-degree: a priori metric for directly measuring and homogenizing interconnection complexity in multilevel placement.	SLIP	2003	DBLP DOI BibTeX RDF	interconnection complexity, multilevel global placement, nonhomogeneity, perimeter-degree, congestion, routability
35	Jochen Könemann, R. Ravi 0001	Primal-dual meets local search: approximating MST's with nonuniform degree bounds.	STOC	2003	DBLP DOI BibTeX RDF	degree-bounded spanning trees, approximation algorithms, spanning trees, network algorithms, bicriteria approximation
35	Hongsuda Tangmunarunkit, Ramesh Govindan, Sugih Jamin, Scott Shenker, Walter Willinger	Network topology generators: degree-based vs. structural.	SIGCOMM	2002	DBLP DOI BibTeX RDF	degree-based generators, large-scale structure, structural generators, topology characterization, topology metrics, network topology, hierarchy, topology generators
34	Yushin Cho, William A. Pearlman	Quantifying the Coding Performance of Zerotrees of Wavelet Coefficients: Degree-k Zerotree.	IEEE Trans. Signal Process.	2007	DBLP DOI BibTeX RDF
32	Maria Jump, Kathryn S. McKinley	Dynamic shape analysis via degree metrics.	ISMM	2009	DBLP DOI BibTeX RDF	degree metrics, dynamic invariants, dynamic shape analysis
32	QianQian Hu, GuoJin Wang	A novel algorithm for explicit optimal multi-degree reduction of triangular surfaces.	Sci. China Ser. F Inf. Sci.	2008	DBLP DOI BibTeX RDF	triangular Bézier surface, multi-degree reduction, Jacobi polynomial, L 2 norm, computer aided design, data compression, Bernstein polynomial
32	Alexandra A. Soskova	A Jump Inversion Theorem for the Degree Spectra.	CiE	2007	DBLP DOI BibTeX RDF	enumeration degrees, degree spectra, Marker’s extensions, enumerations
32	Thang Nguyen Bui, Catherine M. Zrncic	An ant-based algorithm for finding degree-constrained minimum spanning tree.	GECCO	2006	DBLP DOI BibTeX RDF	degree constrained spanning tree, ant algorithm
32	Manimegalai M. Subramaniam	The emergence of IT degree programs: when did it happen?	SIGITE Conference	2005	DBLP DOI BibTeX RDF	IT degree programs, emergence of IT education, IT curricula
32	Enes Pasalic	Degree Optimized Resilient Boolean Functions from Maiorana-McFarland Class.	IMACC	2003	DBLP DOI BibTeX RDF	Boolean Function, Resiliency, Nonlinearity, Algebraic Degree
32	Yu Wang 0003, Xiang-Yang Li 0001	Localized construction of bounded degree and planar spanner for wireless ad hoc networks.	DIALM-POMC	2003	DBLP DOI BibTeX RDF	wireless ad hoc networks, topology control, localized algorithm, spanner, planar, bounded degree
32	Michael J. Docherty, Peter Sutton, Margot Brereton, Simon M. Kaplan, Allison Brown	The information environments program - a new design based IT degree.	ACSE	2000	DBLP DOI BibTeX RDF	design-based IT degree, information environments, studio-based learning, curriculum
32	Wolfgang Merkle, Frank Stephan 0001	On C-Degrees, H-Degrees and T-Degrees.	CCC	2007	DBLP DOI BibTeX RDF
31	Joel J. P. C. Rodrigues, Mário M. Freire, Pascal Lorenz	Performance Assessment of Optical Burst Switched Degree-Four Chordal Ring Networks.	ICT	2004	DBLP DOI BibTeX RDF
31	Hyunwoo Chun, Haewoon Kwak, Young-Ho Eom, Yong-Yeol Ahn, Sue B. Moon, Hawoong Jeong	Comparison of online social relations in volume vs interaction: a case study of cyworld.	Internet Measurement Conference	2008	DBLP DOI BibTeX RDF	cyworld, degree correlation, friend relationship, guestbook log, k-core, reciprocity, online social network, disparity, degree distribution, clustering coefficient, network motif
30	Shao Liu, Minghua Chen 0001, Sudipta Sengupta, Mung Chiang, Jin Li 0001, Philip A. Chou	P2P Streaming Capacity under Node Degree Bound.	ICDCS	2010	DBLP DOI BibTeX RDF	P2P Streaming Capacity, Node Degree Bound, Node Out-Degree Bound, P2P Streaming
30	Mihir K. Chakraborty, Pulak Samanta	Consistency-Degree Between Knowledges.	RSEISP	2007	DBLP DOI BibTeX RDF	elementary category, dependency degree, consistency degree, Rough Sets, knowledge
30	Omer Reingold, Salil P. Vadhan, Avi Wigderson	Entropy Waves, the Zig-Zag Graph Product, and New Constant-Degree Expanders and Extractors.	FOCS	2000	DBLP DOI BibTeX RDF	entropy waves, zig-zag graph product, constant-degree expanders, constant-degree extractors, constructive interference, explicit extractors, high min-entropy sources, eigenvalue bound, graph theory, probability, entropy, probability distributions, eigenvalues and eigenfunctions
30	Roman Smolensky	On Representations by Low-Degree Polynomials	FOCS	1993	DBLP DOI BibTeX RDF	many-output function, boolean cube, nonzeroes, Hilbert function, projective space, low-degree polynomials, low-degree polynomial
29	João M. Fernandes, Ricardo Jorge Machado 0001	A Two-Year Software Engineering M.Sc. Degree Designed Under the Bologna Declaration Principles.	ICSEA	2006	DBLP DOI BibTeX RDF	Bologna declaration, master degree, project-led engineering education, Software engineering
29	Franz-Josef Brandenburg	The Equivalence of Boundary and Confluent Graph Grammars on Graph Languages of Bounded Degree.	RTA	1991	DBLP DOI BibTeX RDF	boundary and confluent graph grammars, operator normal form, graph languages of bounded degree, graph grammars
29	Tamás Király, Lap Chi Lau, Mohit Singh	Degree Bounded Matroids and Submodular Flows.	IPCO	2008	DBLP DOI BibTeX RDF
29	Mário M. Freire, Rui M. F. Coelho, Joel J. P. C. Rodrigues	The Role of Nodal Degree in the Optical Core of IP-over-WDM Networks.	ISCC	2003	DBLP DOI BibTeX RDF
29	Rui M. F. Coelho, Joel J. P. C. Rodrigues, Mário M. Freire	Performance Analysis of Degree Four Topologies for the Optical Core of IP-over-WDM Networks.	ICOIN	2003	DBLP DOI BibTeX RDF
28	Lélia Blin, Maria Gradinariu Potop-Butucaru, Stephane Rovedakis	Self-stabilizing minimum-degree spanning tree within one from the optimal degree.	IPDPS	2009	DBLP DOI BibTeX RDF
27	Kun Liu 0001, Evimaria Terzi	Towards identity anonymization on graphs.	SIGMOD Conference	2008	DBLP DOI BibTeX RDF	degree sequence, dynamic programming, anonymity
27	Reuven Bar-Yehuda, Michael Beder, Yuval Cohen, Dror Rawitz	Resource Allocation in Bounded Degree Trees.	Algorithmica	2009	DBLP DOI BibTeX RDF	Bounded degree trees, Scheduling, Approximation algorithms, Bandwidth allocation, Storage allocation
27	Zhenting Hou, Xiangxing Kong, Dinghua Shi, Guanrong Chen, Qinggui Zhao	Degree-Distribution Stability of Growing Networks.	Complex (2)	2009	DBLP DOI BibTeX RDF	growing network Markov chains, BA model, scale-free, degree distribution
27	Shachar Lovett	Unconditional pseudorandom generators for low degree polynomials.	STOC	2008	DBLP DOI BibTeX RDF	fourier analysis, pseudorandom generators, low degree tests
27	Quansheng Dou, Zhijun Yu, Zhongzhi Shi, Erkeng Yu, Yongzhi Zheng	Cluster-Degree Analysis and Velocity Compensation Strategy of PSO.	ISICA	2008	DBLP DOI BibTeX RDF	cluster-degree, particle swarm optimization, convergence property
27	Tao Wan, Malgorzata Chrzanowska-Jeske	Prediction of interconnect net-degree distribution based on Rent's rule.	SLIP	2004	DBLP DOI BibTeX RDF	net-degree distribution, Rent's rule, interconnect prediction
27	Guillermo De Ita Luna	Polynomial Classes of Boolean Formulas for Computing the Degree of Belief.	IBERAMIA	2004	DBLP DOI BibTeX RDF	#SAT Problem, Updating Beliefs, Approximate Reasoning, Degree of Belief
27	Michael S. Floater, Tom Lyche	Asymptotic convergence of degree-raising.	Adv. Comput. Math.	2000	DBLP DOI BibTeX RDF	degree-raising, Voronovskaya estimates, 65B17, 65D05, 41A25, 41A10, Bernstein polynomials
27	Paola Alimonti, Tiziana Calamoneri	Improved Approximations of Independent Dominating Set in Bounded Degree Graphs.	WG	1996	DBLP DOI BibTeX RDF	Minimum Independent Dominating Set, Approximation Algorithms, Local Search, Greedy, Regular Graphs, Cubic Graphs, Bounded Degree Graphs
27	Joseph W. H. Liu	Modification of the Minimum-Degree Algorithm by Multiple Elimination.	ACM Trans. Math. Softw.	1985	DBLP DOI BibTeX RDF	minimum degree, sparse ordering, ordering, elimination
26	Willi Meier, Enes Pasalic, Claude Carlet	Algebraic Attacks and Decomposition of Boolean Functions.	EUROCRYPT	2004	DBLP DOI BibTeX RDF
26	Kai-di Liu, Jin Wang, Yan-jun Pang, Jin Liu, Jun-hu Ruan	The Mathematic Method of Membership Conversion from Degree of Coordinates to Degree of Points.	ESIAT (2)	2009	DBLP DOI BibTeX RDF	multi-indexes decision, membership degree conversion, distinguishable weight, valid values, membership function
26	Kamalika Chaudhuri, Satish Rao, Samantha J. Riesenfeld, Kunal Talwar	What Would Edmonds Do? Augmenting Paths and Witnesses for Degree-Bounded MSTs.	Algorithmica	2009	DBLP DOI BibTeX RDF	Approximation algorithms, Combinatorial optimization, Matching, Minimum spanning trees
26	Claus Diem	An Index Calculus Algorithm for Plane Curves of Small Degree.	ANTS	2006	DBLP DOI BibTeX RDF
26	James F. Lynch	Convergence law for random graphs with specified degree sequence.	ACM Trans. Comput. Log.	2005	DBLP DOI BibTeX RDF	random graphs, Finite model theory
26	Dimitris Achlioptas, Aaron Clauset, David Kempe 0001, Cristopher Moore	On the bias of traceroute sampling: or, power-law degree distributions in regular graphs.	STOC	2005	DBLP DOI BibTeX RDF	internet mapping, random graphs, power laws
26	James F. Lynch	Convergence Law for Random Graphs with Specified Degree Sequence.	LICS	2003	DBLP DOI BibTeX RDF
26	Gabriel Robins, Jeffrey S. Salowe	On the Maximum Degree of Minimum Spanning Trees.	SCG	1994	DBLP DOI BibTeX RDF
26	Congjun Rao, Jin Peng, Wenlue Chen	Novel Method for Fuzzy Hybrid Multiple Attribute Decision Making.	ICFIE	2007	DBLP DOI BibTeX RDF	Fuzzy hybrid multiple attribute decision making, Grey relational degree, Approach degree, Fuzzy number, Interval number
25	Martin Fürer, Balaji Raghavachari	Approximating the Minimum Degree Spanning Tree to Within One from the Optimal Degree.	SODA	1992	DBLP BibTeX RDF
25	Zhengping He, Hongtao Zhou, Wei Zeng 0009, Yushuo Chen, Qi Fei	Research on Coordination Model of Multiplexed System Based on DEA.	ISNN (1)	2009	DBLP DOI BibTeX RDF	Coordination Degree, Data Envelopment Analysis (DEA), Multiplexed System
25	Makoto Ichii, Makoto Matsushita, Katsuro Inoue	An Exploration of Power-Law in Use-Relation of Java Software Systems.	Australian Software Engineering Conference	2008	DBLP DOI BibTeX RDF	Software Component Graph, Power-law, Scale-free Network, Degree Distribution
25	Ching-Hsien Hsu, Shih-Chang Chen, Chao-Yang Lan	Scheduling contention-free irregular redistributions in parallelizing compilers.	J. Supercomput.	2007	DBLP DOI BibTeX RDF	Irregular redistribution, GEN_BLOCK, Parallelizing compiler, Communication scheduling, Degree-reduction
25	Frédéric Didier, Jean-Pierre Tillich	Computing the Algebraic Immunity Efficiently.	FSE	2006	DBLP DOI BibTeX RDF	Low degree multiple, Boolean functions, Stream ciphers, Algebraic attacks, Algebraic immunity, Annihilator
25	Liangbin Wang, Guojin Zhu	Developing an XML Schema of BWW Ontologies for Semantic Web.	ISPAN	2004	DBLP DOI BibTeX RDF	higher-degree relation, Semantic Web, ontological constructs, Web modeling
24	Myoungsu Cho, Bo Hyoung Kim, Dong Kyun Jeong, Yeong-Gil Shin, Jinwook Seo	Dynamic query interface for spatial proximity query with degree-of-interest varied by distance to query point.	CHI	2010	DBLP DOI BibTeX RDF	dynamic query interface, spatial proximity query, tab interface, visual information seeking, degree-of-interest
24	Roy Friedman, Alex Kogan	Brief announcement: deterministic dominating set construction in networks with bounded degree.	PODC	2010	DBLP DOI BibTeX RDF	dominating sets, bounded degree graphs, distributed approximation algorithms
24	Takuro Fukunaga, Hiroshi Nagamochi	Network Design with Edge-Connectivity and Degree Constraints.	Theory Comput. Syst.	2009	DBLP DOI BibTeX RDF	Degree constraint, (m,n)-VRP, Approximation algorithm, TSP, Vehicle routing problem, Edge-connectivity
24	Xiaojun Zhang, Zheng He	A More Strict Definition of Steady State Degree Distribution.	Complex (2)	2009	DBLP DOI BibTeX RDF	Steady state degree distribution, evolving network, stochastic process
24	Noriaki Kawamae, Hitoshi Sakano, Takeshi Yamada	Personalized recommendation based on the personal innovator degree.	RecSys	2009	DBLP DOI BibTeX RDF	personal innovator degree, purchase innovator, personalization, collaborative filtering, recommendation, serendipity
24	Aileen Zhang, Chu-Wee Lim, Khoongming Khoo, Lei Wei 0001, Josef Pieprzyk	Extensions of the Cube Attack Based on Low Degree Annihilators.	CANS	2009	DBLP DOI BibTeX RDF	Cube Attack, Low-Degree Annihilators, Algebraic Attack
24	Huynh Thi Thanh Binh, Truong Binh Nguyen	New Particle Swarm Optimization Algorithm for Solving Degree Constrained Minimum Spanning Tree Problem.	PRICAI	2008	DBLP DOI BibTeX RDF	degree constrained minimum spanning tree, genetic algorithm, particle swarm optimization, swarm intelligent
24	Gang Xu 0001, Guozhao Wang	Parametric Polynomial Minimal Surfaces of Degree Six with Isothermal Parameter.	GMP	2008	DBLP DOI BibTeX RDF	harmonic surfaces, isothermal parametric surface, parametric polynomial minimal surface of degree six, membrane structure, minimal surface
24	Fachao Li 0001, Chenxia Jin	Fuzzy Genetic Algorithm Based on Principal Operation and Inequity Degree.	ICIC (2)	2007	DBLP DOI BibTeX RDF	fuzzy inequity degree, principal index, BPO&ID-FGA, Markov chain, Fuzzy optimization, fuzzy genetic algorithm
24	Yang Wang	It is time for a computer application degree.	ACM SIGCSE Bull.	2006	DBLP DOI BibTeX RDF	degree programs, curriculum, computer science, computer applications
24	Yu Wang 0003, Xiang-Yang Li 0001	Localized Construction of Bounded Degree and Planar Spanner for Wireless Ad Hoc Networks.	Mob. Networks Appl.	2006	DBLP DOI BibTeX RDF	Wireless ad hoc networks, topology control, localized algorithm, spanner, planar, bounded degree
24	Prosenjit Bose, Joachim Gudmundsson, Michiel H. M. Smid	Constructing Plane Spanners of Bounded Degree and Low Weight.	Algorithmica	2005	DBLP DOI BibTeX RDF	Low weight graphs, Computational geometry, Planar graphs, Spanners, Bounded degree graphs
24	Sonia Pérez-Díaz, J. Rafael Sendra	Partial degree formulae for rational algebraic surfaces.	ISSAC	2005	DBLP DOI BibTeX RDF	partial degrees of an algebraic surface, rational map degree, rational surface parametrization, algebraic surface
24	Hossein Hajiabolhassan, Xuding Zhu	Sparse H-Colourable Graphs of Bounded Maximum Degree.	Graphs Comb.	2004	DBLP DOI BibTeX RDF	Uniquely H-colourable graphs, Bounded maximum degree, Girth
24	Lidan Shou, Zhiyong Huang, Kian-Lee Tan	The Hierarchical Degree-of-Visibility Tree.	IEEE Trans. Knowl. Data Eng.	2004	DBLP DOI BibTeX RDF	Degree of visibility, HDoV-tree, performance and visual fidelity, virtual environment, level-of-details
24	Lélia Blin, Franck Butelle	The First Approximated Distributed Algorithm for the Minimum Degree Spanning Tree Problem on General Graphs.	IPDPS	2003	DBLP DOI BibTeX RDF	Minimum degree spanning trees, Distributed algorithms, Spanning trees, Asynchronous algorithms, general graphs
24	Navaratnasothie Selvakkumaran, George Karypis	Multi.Objective Hypergraph Partitioning Algorithms for Cut and Maximum Subdomain Degree Minimization.	ICCAD	2003	DBLP DOI BibTeX RDF	Maximum Subdomain Degree, Partitioning, Placement, Congestion
24	Ryan O'Donnell, Rocco A. Servedio	New degree bounds for polynomial threshold functions.	STOC	2003	DBLP DOI BibTeX RDF	ptfs, learning, lower bounds, polynomials, duality, degree, formulas, polynomial threshold functions
24	Eli Ben-Sasson, Madhu Sudan 0001, Salil P. Vadhan, Avi Wigderson	Randomness-efficient low degree tests and short PCPs via epsilon-biased sets.	STOC	2003	DBLP DOI BibTeX RDF	property testing, probabilistically checkable proofs, locally testable codes, linearity testing, low degree testing
24	D. Dijkstra	Doubling the Degree of Precision Without Doubling the Grid When Solving a Differential Equation with a Pseudo-Spectral Collocation Method.	J. Sci. Comput.	2002	DBLP DOI BibTeX RDF	double collocation, double precision degree, pseudo-spectral collocation, differentiation matrices, Hermite interpolation
24	Li-Jen Mao, Sheau-Dong Lang	Parallel Algorithms for the Degree-Constrained Minimum Spanning Tree Problem Using Nearest-Neighbor Chains and the Heap-Traversal Technique.	ICPP Workshops	2002	DBLP DOI BibTeX RDF	Parallel approximate algorithm, degree-constrained minimum spanning tree, nearest neighbor chain, heap traversal
24	I. Ben Salah, Pascal Maroni	The connection between self-associated two-dimensional vector functionals and third degree forms.	Adv. Comput. Math.	2000	DBLP DOI BibTeX RDF	Stieltjes functions, third degree forms, Laguerre-Hahn polynomials, 2-orthogonal polynomials, integral representations, 42C05, 33C45
24	Manfred Göbel	Rewriting Techniques and Degree Bounds for Higher Order Symmetric Polynomials.	Appl. Algebra Eng. Commun. Comput.	1999	DBLP DOI BibTeX RDF	Higher order symmetry, Degree bounds, Rewriting techniques, Generators, Symmetric polynomials
24	Li-Jen Mao, Narsingh Deo, Sheau-Dong Lang	A Parallel Algorithm for the Degree-Constrained Minimum Spanning Tree Problem Using Nearest-Neighbor Chains.	ISPAN	1999	DBLP DOI BibTeX RDF	Parallel approximate algorithm, degree-constrained MST, reciprocal nearest neighbors, minimum spanning tree
24	Satoshi Kimura, Masahiko Yachida	Facial Expression Recognition and Its Degree Estimatio.	CVPR	1997	DBLP DOI BibTeX RDF	Degree of facial expression, Variation from expressionless face, Potential Net Model, K-L expansion, Facial expression recognition, Emotion Space
24	Premkumar Vadapalli, Pradip K. Srimani	A New Family of Cayley Graph Interconnection Networks of Constant Degree Four.	IEEE Trans. Parallel Distributed Syst.	1996	DBLP DOI BibTeX RDF	constant degree, simple routing, fault tolerance, Interconnection network, generators, Cayley graph, optimal routing
24	Jiang Liu 0002, Guohua Wu	Joining to High Degrees.	CiE	2008	DBLP DOI BibTeX RDF
24	Joel J. P. C. Rodrigues, Mário M. Freire, Pascal Lorenz	One-Way Resource Reservation Protocols for IP Over Optical Burst Switched Mesh Networks.	Systems Communications	2005	DBLP DOI BibTeX RDF
24	Hettihe P. Dharmasena, Ramachandran Vaidyanathan	Lower Bounds on the Loading of Multiple Bus Networks for Binary Tree Algorithms.	IEEE Trans. Computers	2004	DBLP DOI BibTeX RDF	Multiple bus networks, binary tree algorithms, bus loading, interconnection networks, lower bounds
23	Jin Fan, David J. Hill 0001	Enhancement of Synchronizability of the Kuramoto Model with Assortative Degree-Frequency Mixing.	Complex (2)	2009	DBLP DOI BibTeX RDF	Kuramoto model, assortative, synchronization, correlation
23	Jianhong Ke, Xiaoshuang Chen	Degree Distribution of a Two-Component Growing Network.	Complex (2)	2009	DBLP DOI BibTeX RDF	growing network, rate equation approach, connectivity, scale-free
23	Ido Ben-Eliezer, Rani Hod, Shachar Lovett	Random Low Degree Polynomials are Hard to Approximate.	APPROX-RANDOM	2009	DBLP DOI BibTeX RDF
23	S. Barry Cooper, Angsheng Li	On Lachlan's major sub-degree problem.	Arch. Math. Log.	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) Primary 03D25, Secondary 03D35, 03D30