Search results for "degree"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
17	Xiang-Yang Li 0001, Wen-Zhan Song 0001, Yu Wang 0003	Efficient Topology Control for Ad-Hoc Wireless Networks with Non-Uniform Transmission Ranges.	Wirel. Networks	2005	DBLP DOI BibTeX RDF	non-uniform transmission ranges, degree-bounded structure, wireless ad hoc networks, topology control, power consumption
17	Michael Hoffmann 0001, Csaba D. Tóth	Pointed and colored binary encompassing trees.	SCG	2005	DBLP DOI BibTeX RDF	spanning tree, line segments, bounded degree, pseudo-triangulation
17	Zhi-Ping Fan, Xia Chen	Consensus Measures and Adjusting Inconsistency of Linguistic Preference Relations in Group Decision Making.	FSKD (1)	2005	DBLP DOI BibTeX RDF	Group decision making (GDM), Linguistic preference relation, Consensus degree, Feedback mechanism
17	Wen-Zhan Song 0001, Yu Wang 0003, Xiang-Yang Li 0001	Localized algorithms for energy efficient topology in wireless ad hoc networks.	MobiHoc	2004	DBLP DOI BibTeX RDF	wireless ad hoc networks, topology control, spanner, planar, bounded degree
17	Peter Bürgisser, Felipe Cucker	Counting complexity classes for numeric computations II: algebraic and semialgebraic sets.	STOC	2004	DBLP DOI BibTeX RDF	counting complexity classes, geometric degree, semialgebraic sets, completeness, Betti numbers, Euler characteristic
17	Satoru Watanabe, Satoshi Okawa	An Extended Star Graph: A Proposal of a New Network Topology and Its Fundamental Properties.	ISPA	2003	DBLP DOI BibTeX RDF	degree four Cayley graphs, hy- percubes, routing algorithm, diameter, Cayley graphs, star graphs
17	Youngdai Ko, Deukjo Hong, Seokhie Hong, Sangjin Lee 0002, Jongin Lim 0001	Linear Cryptanalysis of SPECTR-H64 with Higher Order Differential Property.	MMM-ACNS	2003	DBLP DOI BibTeX RDF	Controlled Permutation, Higher order differential, Linear equation, Algebraic degree, SPECTR-H64
17	Kishan Chand Gupta, Palash Sarkar 0001	Improved Construction of Nonlinear Resilient S-Boxes.	ASIACRYPT	2002	DBLP DOI BibTeX RDF	stream cipher, Resiliency, nonlinearity, S-box, algebraic degree, Griesmer bound
17	Bimal K. Roy	A Brief Outline of Research on Correlation Immune Functions.	ACISP	2002	DBLP DOI BibTeX RDF	Boolean Function, Stream Cipher, Symmetry, Nonlinearity, Enumeration, Autocorrelation, Balancedness, Correlation Immunity, Algebraic Degree, Multiple Output Function
17	Tetsuya Izu, Tsuyoshi Takagi	Efficient Computations of the Tate Pairingfor the Large MOV Degrees.	ICISC	2002	DBLP DOI BibTeX RDF	Jacobian coordinate, MOV degree, Elliptic curve cryptosystem, Tate pairing, efficient computation
17	Pierre Fraigniaud	Approximation Algorithms for Minimum-Time Broadcast under the Vertex-Disjoint Paths Mode.	ESA	2001	DBLP DOI BibTeX RDF	Minimum Degree Spanning Tree, Approximation Algorithms, Multicasting, Broadcasting, Gossiping, Graph and Network Algorithms
17	Yuriy V. Tarannikov	On Resilient Boolean Functions with Maximal Possible Nonlinearity.	INDOCRYPT	2000	DBLP DOI BibTeX RDF	nonlinear combining function, Siegenthaler's Inequality, Boolean function, Stream cipher, resiliency, nonlinearity, hardware implementation, pseudorandom generator, correlation-immunity, algebraic degree
17	Palash Sarkar 0001, Subhamoy Maitra	Nonlinearity Bounds and Constructions of Resilient Boolean Functions.	CRYPTO	2000	DBLP DOI BibTeX RDF	combinatorial cryptography, boolean functions, stream ciphers, resiliency, nonlinearity, balancedness, correlation immunity, algebraic degree
17	Bharat K. Bhargava	Concurrency Control in Database Systems.	IEEE Trans. Knowl. Data Eng.	1999	DBLP DOI BibTeX RDF	Degree of concurrency, optimistic, classes of serializability, flexible transactions, performance, adaptability, time-stamp
17	Debabrata Dey, Veda C. Storey, Terence M. Barron	Improving Database Design Through the Analysis of Relationships.	ACM Trans. Database Syst.	1999	DBLP DOI BibTeX RDF	min-max cardinality, relationship degree, weak relationship, conceptual model, integrity constraint, ER model
17	Subhamoy Maitra, Palash Sarkar 0001	Highly Nonlinear Resilient Functions Optimizing Siegenthaler's Inequality.	CRYPTO	1999	DBLP DOI BibTeX RDF	Boolean Function, Stream Cipher, Nonlinearity, Balancedness, Correlation Immunity, Algebraic Degree
17	Toshinori Takabatake, Keiichi Kaneko, Hideo Ito	Generalized Hierarchical Completely-Connected Networks.	ISPAN	1999	DBLP DOI BibTeX RDF	completely-connected network, constant node degree, interconnection network, block, hierarchical network, generalized network
17	Teresa Krick, Juan Sabia, Pablo Solernó	On Intrinsic Bounds in the Nullstellensatz.	Appl. Algebra Eng. Commun. Comput.	1997	DBLP DOI BibTeX RDF	complete intersection polynomial ideals, effective Nullstellensatz, geometric degree, trace theory
17	Klaus Wiltschi, Tony Lindeberg, Axel Pinz	Classification of carbide distributions using scale selection and directional distributions.	ICIP (3)	1997	DBLP DOI BibTeX RDF	carbide distributions, directional distributions, automatic method, steel quality, scale-space operations, microscopic specimen images, automatic scale selection, type information, second-moment descriptors, morphological verification scheme, carbide agglomeration, spatial connectivity, classification, feature extraction, feature extraction, degree, scale selection, pattern classifier
17	Sugath Warnakulasuriya, Timothy Mark Pinkston	Characterization of Deadlocks in Interconnection Networks.	IPPS	1997	DBLP DOI BibTeX RDF	deadlocks characterisation, true deadlock detection, bidirectionality, routing adaptivity, node degree, deadlock formation, routing flexibility blocked messages, resource dependencies, simulator, interconnection networks, multiprocessor interconnection networks, virtual channels, buffer size, design parameters, deadlock-free routing algorithms
17	Toshibumi Seki, Tetsuo Hasegawa, Yasukuni Okataku, Shinsuke Tamura	A fault-tolerant architecture based on autonomous replicated objects.	HICSS (2)	1995	DBLP DOI BibTeX RDF	autonomous replicated objects, program module replication, local knowledge, replication degree, system level modules, total ordering broadcast protocol, execution efficiency, reliability, communication, protocols, object-oriented programming, fault tolerant computing, distributed processing, computer architecture, location, objects, software fault tolerance, fault-tolerant architecture
17	Michael E. Wolf, Monica S. Lam	A Loop Transformation Theory and an Algorithm to Maximize Parallelism.	IEEE Trans. Parallel Distributed Syst.	1991	DBLP DOI BibTeX RDF	loop transformation theory, general loops, dependence vectors, lexicographically positive, compound transformations, coarsest fully permutable loop nests, fully permutable nests, parallel algorithm, parallel algorithms, parallel programming, heuristics, program compilers, precedence constraints, legality, code transformation, fine-grain parallelism, canonical form, wavefront, coarse grain parallelism, loop iterations, maximum degree
17	John T. Gorgone, John F. Schrage	A design for the education of computer programmers at the associate level within a baccalaureate level institution.	ACM Annual Conference (2)	1978	DBLP DOI BibTeX RDF	Application programmers curriculum, Associate degree, Computer programmers curriculum, Two-year programs, Curriculum design
16	Marco Zuniga, Chen Avin, Bhaskar Krishnamachari	Using Heterogeneity to Enhance Random Walk-based Queries.	J. Signal Process. Syst.	2009	DBLP DOI BibTeX RDF	Electrical resistance, Wireless sensor networks, Markov chains, Querying, Random walk
16	Anand Bhalgat, Ramesh Hariharan	Fast edge orientation for unweighted graphs.	SODA	2009	DBLP DOI BibTeX RDF
16	Chris C. N. Chu, Yiu-Chung Wong	FLUTE: Fast Lookup Table Based Rectilinear Steiner Minimal Tree Algorithm for VLSI Design.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	2008	DBLP DOI BibTeX RDF
16	Iyad A. Kanj, Ljubomir Perkovic, Ge Xia	Computing Lightweight Spanners Locally.	DISC	2008	DBLP DOI BibTeX RDF
16	Xiumei Hao, Yingling Du	S-Knowledge Mining and Its Attribute Transfer Dependence.	FSKD (2)	2008	DBLP DOI BibTeX RDF
16	Yong-Yeol Ahn, Seungyeop Han, Haewoon Kwak, Sue B. Moon, Hawoong Jeong	Analysis of topological characteristics of huge online social networking services.	WWW	2007	DBLP DOI BibTeX RDF	social network, sampling
16	Frank Neumann 0001, Marco Laumanns	Speeding up Approximation Algorithms for NP-Hard Spanning Forest Problems by Multi-objective Optimization.	LATIN	2006	DBLP DOI BibTeX RDF
16	Gürkan Bebek, Petra Berenbrink, Colin Cooper, Tom Friedetzky, Joseph H. Nadeau, Süleyman Cenk Sahinalp	Improved Duplication Models for Proteome Network Evolution.	Systems Biology and Regulatory Genomics	2005	DBLP DOI BibTeX RDF
16	Jeremy Yermiyahou Kaminski, Amnon Shashua	Multiple View Geometry of General Algebraic Curves.	Int. J. Comput. Vis.	2004	DBLP DOI BibTeX RDF	Kruppa''s equations, 3D reconstruction, structure from motion, epipolar geometry, algebraic curves, multiple-view geometry
16	Juan I. Nieto-Hipólito, José M. Barceló	Inside BGP Tables: Inferring Autonomous System's Interconnectivity.	ECUMN	2004	DBLP DOI BibTeX RDF
16	Sam Chung, Yun Sik Lee	Modeling Web Applications Using Java and XML Related Technologies.	HICSS	2003	DBLP DOI BibTeX RDF
16	Erich L. Kaltofen	Polynomial factorization: a success story.	ISSAC	2003	DBLP DOI BibTeX RDF	black box polynomial, randomized algorithm, polynomial factorization, lattice basis reduction, symbolic/numeric hybrid method, straight line program
16	Kishan Chand Gupta, Subhamoy Maitra	Primitive Polynomials over GF(2) - A Cryptologic Approach.	ICICS	2001	DBLP DOI BibTeX RDF	Cyclotomic Cosets, Stream Cipher, Galois field, Primitive Polynomials
15	Jiawang Nie, Kristian Ranestad, Bernd Sturmfels	The algebraic degree of semidefinite programming.	Math. Program.	2010	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 14Q15, 14N05, 14N10, 90C22, 90C46, 90C60
15	Robert Franke, Ignaz Rutter, Dorothea Wagner	Computing Large Matchings in Planar Graphs with Fixed Minimum Degree.	ISAAC	2009	DBLP DOI BibTeX RDF
15	Takuro Fukunaga, Hiroshi Nagamochi	Network Design with Weighted Degree Constraints.	WALCOM	2009	DBLP DOI BibTeX RDF
15	Nelly Litvak, Werner R. W. Scheinhardt, Yana Volkovich, Bert Zwart	Characterization of Tail Dependence for In-Degree and PageRank.	WAW	2009	DBLP DOI BibTeX RDF	Power law graphs, Multivariate extremes, PageRank, Regular variation
15	Anthony Hunter, Weiru Liu	Knowledge Base Stratification and Merging Based on Degree of Support.	ECSQARU	2009	DBLP DOI BibTeX RDF
15	Peter Damaschke	Bounded-Degree Techniques Accelerate Some Parameterized Graph Algorithms.	IWPEC	2009	DBLP DOI BibTeX RDF
15	Daniel Lokshtanov, Venkatesh Raman 0001, Saket Saurabh 0001, Somnath Sikdar	On the Directed Degree-Preserving Spanning Tree Problem.	IWPEC	2009	DBLP DOI BibTeX RDF
15	Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto	The Travelling Salesman Problem in Bounded Degree Graphs.	ICALP (1)	2008	DBLP DOI BibTeX RDF
15	Satyen Kale, C. Seshadhri 0001	An Expansion Tester for Bounded Degree Graphs.	ICALP (1)	2008	DBLP DOI BibTeX RDF
15	Reinier Bröker, Denis Xavier Charles, Kristin E. Lauter	Evaluating Large Degree Isogenies and Applications to Pairing Based Cryptography.	Pairing	2008	DBLP DOI BibTeX RDF
15	Weizhan Zhang, Qinghua Zheng, Yang Li, Yi Che	LDCOM: a Layered degree-constrained overlay multicast for interactive media.	ISCC	2008	DBLP DOI BibTeX RDF
15	Yun-Xia Shi, Li-Li Wei	A Method of Combination Forecasting Based on Inclusion Degree.	CSSE (5)	2008	DBLP DOI BibTeX RDF
15	Nicla Bernasconi, Konstantinos Panagiotou, Angelika Steger	On the Degree Sequences of Random Outerplanar and Series-Parallel Graphs.	APPROX-RANDOM	2008	DBLP DOI BibTeX RDF
15	Omid Amini, Ignasi Sau, Saket Saurabh 0001	Parameterized Complexity of the Smallest Degree-Constrained Subgraph Problem.	IWPEC	2008	DBLP DOI BibTeX RDF
15	Artur Czumaj, Christian Sohler	Testing Expansion in Bounded-Degree Graphs.	FOCS	2007	DBLP DOI BibTeX RDF
15	Emilio De Santis, Fabrizio Grandoni 0001, Alessandro Panconesi	Fast Low Degree Connectivity of Ad-Hoc Networks Via Percolation.	ESA	2007	DBLP DOI BibTeX RDF
15	Nancy R. Mead, Thomas B. Hilburn, James McDonald, Michael Ryan, Daniel Shoemaker 0001	On the Feasibility of Specialization within Software Engineering Degree Programs.	CSEE&T	2007	DBLP DOI BibTeX RDF
15	Liuling Dai, Bing Huang, Dongxiao Yang	A Connection Degree-Based Rough Set Model and its Application to Knowledge Reduction.	SNPD (3)	2007	DBLP DOI BibTeX RDF
15	Rusins Freivalds, Liva Garkaje	Boolean Functions of Low Polynomial Degree for Quantum Query Complexity Theory.	ISMVL	2007	DBLP DOI BibTeX RDF
15	Masaaki Shirase, Yuto Kawahara, Tsuyoshi Takagi, Eiji Okamoto	Universal etaT Pairing Algorithm over Arbitrary Extension Degree.	WISA	2007	DBLP DOI BibTeX RDF	Duursma-Lee algorithm, Tate pairing, efficient implementation, ? T pairing
15	He Luo, Shanlin Yang, Chao Fu, Xiaojian Hu	An Evidence Combination Rule Based on the Support Degree of Focal Element.	FSKD (2)	2007	DBLP DOI BibTeX RDF
15	Patrick Donovan, F. Bruce Shepherd, Adrian Vetta, Gordon T. Wilfong	Degree-constrained network flows.	STOC	2007	DBLP DOI BibTeX RDF	congestion, network flow
15	David Freeman 0001	Constructing Pairing-Friendly Elliptic Curves with Embedding Degree 10.	ANTS	2006	DBLP DOI BibTeX RDF
15	Reuven Bar-Yehuda, Michael Beder, Yuval Cohen, Dror Rawitz	Resource Allocation in Bounded Degree Trees.	ESA	2006	DBLP DOI BibTeX RDF
15	Santo Fortunato, Marián Boguñá, Alessandro Flammini, Filippo Menczer	Approximating PageRank from In-Degree.	WAW	2006	DBLP DOI BibTeX RDF
15	Nelly Litvak, Werner R. W. Scheinhardt, Yana Volkovich	Probabilistic Relation between In-Degree and PageRank.	WAW	2006	DBLP DOI BibTeX RDF	General Terms Theory, Algorithms, Verification, Experimentation
15	Noriyuki Okumura, Takayoshi Araki, Hirokazu Watabe, Tsukasa Kawaoka	Dynamic Calculation Method of Degree of Association Between Concepts.	KES (1)	2006	DBLP DOI BibTeX RDF
15	Fabrizio Frati, Giuseppe Di Battista	Three-Dimensional Drawings of Bounded Degree Trees.	GD	2006	DBLP DOI BibTeX RDF
15	E. Sagianos, Nicos Karcanias	The Generic McMillan Degree: A New Method Using Integer Matrices.	International Conference on Computational Science (1)	2006	DBLP DOI BibTeX RDF
15	Daniel Stronger, Peter Stone	Polynomial Regression with Automated Degree: A Function Approximator for Autonomous Agents.	ICTAI	2006	DBLP DOI BibTeX RDF
15	Sharon Marko, Dana Ron	Distance Approximation in Bounded-Degree and General Sparse Graphs.	APPROX-RANDOM	2006	DBLP DOI BibTeX RDF
15	Omar Flores-Sánchez, Vicente Vidal, Víctor M. García 0001, Pedro Flores-Sánchez	Sequential and Parallel Resolution of the Two-Group Transient Neutron Diffusion Equation Using Second-Degree Iterative Methods.	VECPAR	2006	DBLP DOI BibTeX RDF
15	Catherine S. Greenhill, Andrzej Rucinski 0001, Nicholas C. Wormald	Random Hypergraph Processes with Degree Restrictions.	Graphs Comb.	2004	DBLP DOI BibTeX RDF
15	Ahmad Chadi Aljundi, Jean-Luc Dekeyser	The Effect of the Degree of Multistage Interconnection Networks on their Performance: The Case of Delta and Over-Sized Delta Networks.	PDP	2004	DBLP DOI BibTeX RDF
15	Yin Wang, Xianlong Hong, Tong Jing, Yang Yang 0040, Xiaodong Hu 0001, Guiying Yan	An Efficient Low-Degree RMST Algorithm for VLSI/ULSI Physical Design.	PATMOS	2004	DBLP DOI BibTeX RDF
15	Bruno Carton, Valentin Mesaros	Improving the Scalability of Logarithmic-Degree DHT-Based Peer-to-Peer Networks.	Euro-Par	2004	DBLP DOI BibTeX RDF
15	Nicholas Krouglicof, Luisa Alonso, William D. Keat	Development of a mechanically coupled, six degree-of-freedom load platform for biomechanics and sports medicine.	SMC (5)	2004	DBLP DOI BibTeX RDF
15	Bo An 0001, Lianggui Tang, Shuangqing Li, Daijie Cheng	A Negotiation Strategy based on Uncompromising Degree.	IAT	2004	DBLP DOI BibTeX RDF
15	Xue Dejun, Maosong Sun	Eliminating High-Degree Biased Character Bigrams for Dimensionality Reduction in Chinese Text Categorization.	ECIR	2004	DBLP DOI BibTeX RDF
15	Chang-Woo Park, Young-Wan Cho, Junhyuk Choi, Ha-Gyeong Sung	Rough Set Based Fuzzy Modeling by Occupancy Degree and Optimal Partition of Projection.	Rough Sets and Current Trends in Computing	2004	DBLP DOI BibTeX RDF
15	Shoji Hirano, Shusaku Tsumoto	On the Degree of Independence of a Contingency Matrix.	Rough Sets and Current Trends in Computing	2004	DBLP DOI BibTeX RDF
15	Markus Lohrey	Automatic Structures of Bounded Degree.	LPAR	2003	DBLP DOI BibTeX RDF
15	Rolly Intan, Masao Mukaidono	Generating Fuzzy Thesaurus by Degree of Similarity in Fuzzy Covering.	ISMIS	2003	DBLP DOI BibTeX RDF
15	Andris Ambainis	Polynomial Degree vs. Quantum Query Complexity.	FOCS	2003	DBLP DOI BibTeX RDF
15	Youssef Iraqi, Raouf Boutaba	The Degree of Participation Concept in Ad Hoc Networks.	ISCC	2003	DBLP DOI BibTeX RDF
15	Dongsheng Li 0001, Xinxin Fang, Yijie Wang 0001, Xicheng Lu, Kai Lu, Nong Xiao	A Scalable Peer-to-Peer Network with Constant Degree.	APPT	2003	DBLP DOI BibTeX RDF
15	Jochen Könemann, R. Ravi 0001	Quasi-polynomial Time Approximation Algorithm for Low-Degree Minimum-Cost Steiner Trees.	FSTTCS	2003	DBLP DOI BibTeX RDF
15	Oded Goldreich 0001, Dana Ron	Property Testing in Bounded Degree Graphs.	Algorithmica	2002	DBLP DOI BibTeX RDF	Approximation algorithms, Randomized algorithms, Graph algorithms, Property testing
15	Rolly Intan, Masao Mukaidono	Degree of Similarity in Fuzzy Partition.	AFSS	2002	DBLP DOI BibTeX RDF
15	Guantao Chen, Bing Wei 0001, Xuerong Zhang	Degree-Light-Free Graphs and Hamiltonian Cycles.	Graphs Comb.	2001	DBLP DOI BibTeX RDF
15	Dimitrios M. Thilikos, Maria J. Serna, Hans L. Bodlaender	A Polynomial Time Algorithm for the Cutwidth of Bounded Degree Graphs with Small Treewidth.	ESA	2001	DBLP DOI BibTeX RDF
15	Igor V. Zotov, Vitaliy S. Titov	An O[n3/ z3] Reduction Procedure for Determining the Maximum Degree of Parallelism in Parallel Applications.	PaCT	2001	DBLP DOI BibTeX RDF
15	Radha Krishnan, Balaji Raghavachari	The Directed Minimum-Degree Spanning Tree Problem.	FSTTCS	2001	DBLP DOI BibTeX RDF
15	J. Rafael Sendra, Franz Winkler 0001	Computation of the degree of rational maps between curves.	ISSAC	2001	DBLP DOI BibTeX RDF
15	Haim Kaplan, Ron Shamir	Bounded Degree Interval Sandwich Problems.	Algorithmica	1999	DBLP DOI BibTeX RDF	Parametrized complexity, Computational biology, Interval graphs, Design and analysis of algorithms
15	Isaac Balbin	Is your degree quality endorsed?	ITiCSE	1999	DBLP DOI BibTeX RDF	Computer Science Education, quality
15	Hettihe P. Dharmasena, Ramachandran Vaidyanathan	Lower Bounds on the Loading of Degree-2 Multiple Bus Networks for Binary-Tree Algorithms.	IPPS/SPDP	1999	DBLP DOI BibTeX RDF
15	Chi-Hsiang Yeh, Emmanouel A. Varvarigos	Macro-Star Networks: Efficient Low-Degree Alternatives to Star Graphs.	IEEE Trans. Parallel Distributed Syst.	1998	DBLP DOI BibTeX RDF	algorithm emulation, multinode broadcast, routing, Interconnection networks, parallel architectures, Cayley graphs, star graphs, total exchange
15	Gruia Calinescu, Cristina G. Fernandes, Bruce A. Reed	Multicuts in Unweighted Graphs with Bounded Degree and Bounded Tree-Width.	IPCO	1998	DBLP DOI BibTeX RDF
15	L. R. Neal, Alastair Irons	Integrating professionalism into undergraduate degree courses in computing (panel).	ITiCSE	1998	DBLP DOI BibTeX RDF	collaborative learning, ethics, professional issues
15	Leonid Libkin, Limsoon Wong	Unary Quantifiers, Transitive Closure, and Relations of Large Degree.	STACS	1998	DBLP DOI BibTeX RDF
15	Bin Du, Jun Gu, Wei Wang, Danny H. K. Tsang	Multispace Search for Minimizing the Maximum Nodal Degree.	ICCCN	1997	DBLP DOI BibTeX RDF
15	Alexander E. Andreev, Andrea Clementi, Pierluigi Crescenzi, Elias Dahlhaus, Sergio De Agostino, José D. P. Rolim	The Parallel Complexity of Approximating the High Degree Subgraph Problem.	ISAAC	1995	DBLP DOI BibTeX RDF
15	Osamu Maruyama, Satoru Miyano	Graph Inference from a Walk for TRees of Bounded Degree 3 is NP-Complete.	MFCS	1995	DBLP DOI BibTeX RDF