Search results for "degree"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
23	Xiaoming Wang 0002, Xiliang Liu, Dmitri Loguinov	Modeling the Evolution of Degree Correlation in Scale-Free Topology Generators.	INFOCOM	2008	DBLP DOI BibTeX RDF
23	Prosenjit Bose, Michiel H. M. Smid, Daming Xu	Diamond Triangulations Contain Spanners of Bounded Degree.	ISAAC	2006	DBLP DOI BibTeX RDF
23	Kamalika Chaudhuri, Satish Rao, Samantha J. Riesenfeld, Kunal Talwar	A Push-Relabel Algorithm for Approximating Degree Bounded MSTs.	ICALP (1)	2006	DBLP DOI BibTeX RDF
23	Chao Shui, Huaimin Wang, Peng Zhou, Yan Jia 0001	Cactus: A New Constant-Degree and Fault Tolerate P2P Overlay.	PRIMA	2006	DBLP DOI BibTeX RDF
23	Yun-qiang Li	The Deceptive Degree of the Objective Function.	FOGA	2005	DBLP DOI BibTeX RDF
23	Kamalika Chaudhuri, Satish Rao, Samantha J. Riesenfeld, Kunal Talwar	What Would Edmonds Do? Augmenting Paths and Witnesses for Degree-Bounded MSTs.	APPROX-RANDOM	2005	DBLP DOI BibTeX RDF
23	Sándor P. Fekete, Samir Khuller, Monika Klemmstein, Balaji Raghavachari, Neal E. Young	A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees.	IPCO	1996	DBLP DOI BibTeX RDF
23	Magnús M. Halldórsson, Kiyohito Yoshihara	Greedy Approximations of Independent Sets in Low Degree Graphs.	ISAAC	1995	DBLP DOI BibTeX RDF
23	Tian Hai, Nie Bing, Zhang Wujun	Military Units Importance Evaluation Based on Complex Networks.	MVHI	2010	DBLP DOI BibTeX RDF	military units, correlation degree, key degree, complex networks, importance
23	Pulak Samanta, Mihir K. Chakraborty	On Extension of Dependency and Consistency Degrees of Two Knowledges Represented by Covering.	Trans. Rough Sets	2008	DBLP DOI BibTeX RDF	elementary category(partition and covering of knowledge), dependency degree, consistency degree, Rough sets
23	Jinghong Wang, Bi Li 0002, Chenguang Liu, Jiaomin Liu	Research of New Learning Method of Feedforward Neural Network.	ISIP	2008	DBLP DOI BibTeX RDF	Disperse degree, Feed forward neural network, Similar degree
23	Jun Li, Guojun Wang	Theory of truth degrees of propositions in the logic system Ln*.	Sci. China Ser. F Inf. Sci.	2006	DBLP DOI BibTeX RDF	truth degree, approximate reasoning, similarity degree
23	Yuval Ishai, Eyal Kushilevitz	Randomizing Polynomials: A New Representation with Applications to Round-Efficient Secure Computation.	FOCS	2000	DBLP DOI BibTeX RDF	randomizing polynomials, round-efficient secure computation, natural representation, degree-3 polynomials, round-efficient secure protocols, protocols, probability, Boolean functions, Boolean functions, communication complexity, communication complexity, polynomials, secure multi-party computation, branching program, low-degree polynomials
23	Christos Kaklamanis, Danny Krizanc, Satish Rao	Universal Emulations with Sublogarithmic Slowdown	FOCS	1993	DBLP DOI BibTeX RDF	arbitrary bounded degree networks, universal emulations, sublogarithmic slowdown, bounded degree networks, area-universal network, VLSI layout area, N-node network, sublogarithmic bounds, hypercube, butterfly
22	Uros Cibej, Aaron Li, István Miklós, Sohaib Nasir, Varun Srikanth	Constructing bounded degree graphs with prescribed degree and neighbor degree sequences.	Discret. Appl. Math.	2023	DBLP DOI BibTeX RDF
22	Chris Jones, Karoline Wiesner	Clarifying How Degree Entropies and Degree-Degree Correlations Relate to Network Robustness.	Entropy	2022	DBLP DOI BibTeX RDF
22	Chris Jones, Karoline Wiesner	Clarifying How Degree Entropies and Degree-Degree Correlations Relate to Network Robustness.	CoRR	2021	DBLP BibTeX RDF
22	Uros Cibej, Aaron Li, István Miklós, Sohaib Nasir, Varun Srikanth	Constructing bounded degree graphs with prescribed degree and neighbor degree sequences.	CoRR	2021	DBLP BibTeX RDF
22	Pengpeng Yuan, Zhihua Wang 0001, Dongmei Li, Xin Wang, Liyuan Liu	A nanopower CMOS bandgap reference with 30ppm/degree C from -30 degree C to 150 degree C.	ISCAS	2011	DBLP DOI BibTeX RDF
22	Theodore I. Bieber, Mark D. Jackson	Applications of degree distribution. 1. (a) General discussion and computer generation of degree distributions. (b) Maximal degree distributions.	J. Chem. Inf. Comput. Sci.	1993	DBLP DOI BibTeX RDF
22	Enes Pasalic	Almost Fully Optimized Infinite Classes of Boolean Functions Resistant to (Fast) Algebraic Cryptanalysis.	ICISC	2008	DBLP DOI BibTeX RDF	Fast Algebraic attacks, Algebraic Attack Resistant, High Degree Product, Boolean function, Stream ciphers, Algebraic Immunity, Annihilators
22	Hongju Cheng, Qin Liu 0003, Xiaohua Jia	Heuristic algorithms for real-time data aggregation in wireless sensor networks.	IWCMC	2006	DBLP DOI BibTeX RDF	degree and hop constrained MST, sensor networks, real-time, data aggregation
22	Javier Sánchez-Reyes	The Symmetric Analogue of the Polynomial Power Basis.	ACM Trans. Graph.	1997	DBLP DOI BibTeX RDF	Ball basis, Bernstein-Be´zier basis, monomial form, power basis, symmetric power, Hermite interpolation, degree reduction
22	Herman Akdag, Myriam Mokhtari	Approximative Conjunctions Processing by Multi-Valued Logic.	ISMVL	1996	DBLP DOI BibTeX RDF	conjunctions processing, neighbourhood degree, knowledge based systems, knowledge base, inference mechanisms, multivalued logic, production rule, multi-valued logic
22	David L. Millman, Jack Snoeyink	Computing planar Voronoi diagrams in double precision: a further example of degree-driven algorithm design.	SCG	2010	DBLP DOI BibTeX RDF	low-degree primitives, reduced precision, robust computation, voronoi diagrams
22	Susan Khor	Effect of degree distribution on evolutionary search.	GECCO	2009	DBLP DOI BibTeX RDF	evolutionary algorithm difficulty, modularity, network topology, hierarchy, mutation, crossover, degree distribution
22	Hirokazu Watabe, Eriko Yoshimura, Seiji Tsuchiya	Degree of Association between Documents Using Association Mechanism.	KES (1)	2009	DBLP DOI BibTeX RDF	Earth Mover’s Distance, Concept-Base, Degree of association, Document search
22	Myungha Jang, Arang Rhie, Joyce Jiyoung Whang, Sanduk Yang, Hyun Seok Park	A statistical analysis of relation degree of compound pair on online biological pathway databases.	ICUIMC	2009	DBLP DOI BibTeX RDF	drawing algorithm, edge crossing, relation degree, XML, parsing, metabolic pathway
22	Wen Huo, Xiaoguang Hong	A Heuristic Knowledge Reduction Algorithm Based on Partition Subdivision and Consistent Degree.	Intelligent Information Processing	2008	DBLP DOI BibTeX RDF	positive region, partition subdivision, consistent degree, data mining, rough set, decision table, knowledge reduction
22	Margaret-Ellen Messinger, Pawel Pralat, Richard J. Nowakowski, Nicholas C. Wormald	Cleaning Random d-Regular Graphs with Brushes Using a Degree-Greedy Algorithm.	CAAN	2007	DBLP DOI BibTeX RDF	cleaning process, random d-regular graphs, degree-greedy algorithm, differential equations method
22	Lin Lin, Xue-Hai Yuan	A Method of Intuitionistic Fuzzy Reasoning Based on Inclusion Degree and Similarity Measure.	ICFIE	2007	DBLP DOI BibTeX RDF	Intuitionistic fuzzy reasoning, Inclusion degree, Similarity measure, Intuitionistic fuzzy sets
22	Sofiane Gueddana, Nicolas Roussel 0001	Pêle-Mêle, a video communication system supporting a variable degree of engagement.	CSCW	2006	DBLP DOI BibTeX RDF	smooth transitions, variable degree of engagement, video-mediated communication
22	Priya Mahadevan, Dmitri V. Krioukov, Kevin R. Fall, Amin Vahdat	Systematic topology analysis and generation using degree correlations.	SIGCOMM	2006	DBLP DOI BibTeX RDF	degree correlations, network topology
22	Xianming Chen, Richard F. Riesenfeld, Elaine Cohen	Degree Reduction for NURBS Symbolic Computation on Curves.	SMI	2006	DBLP DOI BibTeX RDF	NURBS symbolic computation, zero curvature, critical curvature, focal curve, tangent developable, normal scroll, binormal scroll, rectifying developable, bisector curve, bisector surface, evolute, torsion, degree reduction
22	Régis Dupont, Andreas Enge, François Morain	Building Curves with Arbitrary Small MOV Degree over Finite Prime Fields.	J. Cryptol.	2005	DBLP DOI BibTeX RDF	Elliptic curves over finite fields, MOV degree, Complex multiplication
22	Carsten Schneider	Degree Bounds to Find Polynomial Solutions of Parameterized Linear Difference Equations in Pi-Sigma-Fields.	Appl. Algebra Eng. Commun. Comput.	2005	DBLP DOI BibTeX RDF	Linear Difference Equations, ??-Fields, Degree Bounds
22	Jochen Könemann, Asaf Levin, Amitabh Sinha	Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem.	Algorithmica	2005	DBLP DOI BibTeX RDF	Degree-bounded spanning trees, Approximation algorithms, Spanning trees, Bicriteria approximation
22	Remi Badonnel, Radu State, Olivier Festor, André Schaff	A Framework for Optimizing End-to-End Connectivity Degree in Mobile Ad-Hoc Networks.	J. Netw. Syst. Manag.	2005	DBLP DOI BibTeX RDF	end-to-end connectivity degree, ad-hoc networks, Network management, dynamic configuration
22	Biplab K. Sikdar, Samir Roy, Debesh K. Das	A Degree-of-Freedom Based Synthesis Scheme for Sequential Machines with Enhanced BIST Quality and Reduced Area.	J. Electron. Test.	2005	DBLP DOI BibTeX RDF	emitability, FSM state encoding, reachability, degree-of-freedom
22	Patrick Amestoy, Enseeiht-Irit, Timothy A. Davis 0001, Iain S. Duff	Algorithm 837: AMD, an approximate minimum degree ordering algorithm.	ACM Trans. Math. Softw.	2004	DBLP DOI BibTeX RDF	minimum degree, sparse matrices, Linear equations, ordering methods
22	Tovi Grossman, Ravin Balakrishnan, Karan Singh	An interface for creating and manipulating curves using a high degree-of-freedom curve input device.	CHI	2003	DBLP DOI BibTeX RDF	curve editing, high degree-of-freedom input
22	Christian Bettstetter	On the minimum node degree and connectivity of a wireless multihop network.	MobiHoc	2002	DBLP DOI BibTeX RDF	isolated nodes, minimum node degree, modeling, sensor networks, ad hoc networking, connectivity, analytical methods, geometric random graphs
22	Samir Roy, Biplab K. Sikdar, Monalisa Mukherjee, Debesh K. Das	Degree-of-Freedom Analysis for Sequential Machines Targeting BIST Quality and Gate Area.	ASP-DAC/VLSI Design	2002	DBLP DOI BibTeX RDF	FSM synthesis, emitability, BIST, reachability, degree of freedom
22	Maurice R. Masliah, Paul Milgram	Measuring the allocation of control in a 6 degree-of-freedom docking experiment.	CHI	2000	DBLP DOI BibTeX RDF	6 degree-of-freedom control, allocation of control, the M-metric, virtual docking task, coordination, interaction techniques, input devices, evaluation methods, motor control
22	Ken Hinckley, Mike Sinclair, Erik Hanson, Richard Szeliski, Matthew Conway	The Videomouse: A Camera-Based Multi-degree-of-freedom Input Device.	ACM Symposium on User Interface Software and Technology	1999	DBLP DOI BibTeX RDF	camera-based input, multi-degree-of-freedom input, tilt sensing, interaction technique, input devices, rotation
22	Shahram Latifi, Pradip K. Srimani	Sep: A Fixed Degree Regular Network for Massively Parallel Systems.	J. Supercomput.	1998	DBLP DOI BibTeX RDF	fixed degree, simple routing, fault tolerance, interconnection network, computer architecture, Cayley graph
22	Ding-Ming Kwai, Behrooz Parhami	A Class of Fixed-Degree Cayley-Graph Interconnection Networks Derived by Pruning k-ary n-cubes.	ICPP	1997	DBLP DOI BibTeX RDF	fixed-degree network, pruning strategy, interconnection network, Cayley graph, k-ary n-cube, cube-connected cycles
22	Sabine R. Öhring, Falguni Sarkar, Sajal K. Das 0001, Dirk H. Hohndel	Cayley graph connected cycles: A new class of fixed-degree interconnection networks.	HICSS (2)	1995	DBLP DOI BibTeX RDF	Cayley graph connected cycles, fixed-degree interconnection networks, vertex-symmetric networks, maximally fault tolerant networks, abelian generator-sets, graph theory, fault tolerant computing, multiprocessor interconnection networks, routing algorithms, hypercube networks, network routing, broadcasting algorithms, cube-connected cycles, average distance
22	Ping Yu 0010, Anastasios N. Venetsanopoulos	Partial pattern recognition and classification using the scatter degree technique and neural networks.	J. Intell. Robotic Syst.	1992	DBLP DOI BibTeX RDF	Scatter degree technique, neural networks, object recognition, local features, object classification
22	Elaine Cohen, Tom Lyche, Larry L. Schumaker	Algorithms for Degree-Raising of Splines.	ACM Trans. Graph.	1985	DBLP DOI BibTeX RDF	degree-rasing approach, subdivision approach, B-splines
22	Donald H. Beil	The data processing Curriculum of the National Technical Institute for the Deaf: A suggested implementation for an AAS degree program in computer programming.	ACM Annual Conference (2)	1978	DBLP DOI BibTeX RDF	Associate degree programs, Computer programmer education, Physically handicapped, Education, Deaf, Curricula
21	S. Barry Cooper, Matthew C. Salts, Guohua Wu	The Non-isolating Degrees Are Upwards Dense in the Computably Enumerable Degrees.	TAMC	2008	DBLP DOI BibTeX RDF
21	Andrej Bogdanov, Emanuele Viola	Pseudorandom Bits for Polynomials.	FOCS	2007	DBLP DOI BibTeX RDF
21	Yong Wang, Xiao-chun Yun, Yifei Li	Analyzing the Characteristics of Gnutella Overlays.	ITNG	2007	DBLP DOI BibTeX RDF
21	Mário M. Freire, Rui M. F. Coelho, Joel J. P. C. Rodrigues	High Performance Optical Backbones for Next Generation Internet.	ITCC	2003	DBLP DOI BibTeX RDF
21	Kishan Chand Gupta, Subhamoy Maitra	Multiples of Primitive Polynomials over GF(2).	INDOCRYPT	2001	DBLP DOI BibTeX RDF	Cryptanalysis, Stream Cipher, Galois Field, Primitive Polynomials, Polynomial Multiples
21	Dimitris Achlioptas, Aaron Clauset, David Kempe 0001, Cristopher Moore	On the bias of traceroute sampling: Or, power-law degree distributions in regular graphs.	J. ACM	2009	DBLP DOI BibTeX RDF	sampling bias, Internet topology, traceroute
21	Marcin Bienkowski, André Brinkmann, Miroslaw Korzeniowski	Degree 3 Suffices: A Large-Scale Overlay for P2P Networks.	OPODIS	2008	DBLP DOI BibTeX RDF
21	Zeev Nutov	Approximating Directed Weighted-Degree Constrained Networks.	APPROX-RANDOM	2008	DBLP DOI BibTeX RDF
21	Zeev Dvir, Amir Shpilka	Noisy Interpolating Sets for Low Degree Polynomials.	CCC	2008	DBLP DOI BibTeX RDF	Error correcting codes, Polynomial interpolation
21	Arnaud Durand 0001, Etienne Grandjean	First-order queries on structures of bounded degree are computable with constant delay.	ACM Trans. Comput. Log.	2007	DBLP DOI BibTeX RDF	enumeration problems, Computational complexity, first-order logic
21	Artur Czumaj, Christian Sohler	On testable properties in bounded degree graphs.	SODA	2007	DBLP BibTeX RDF
21	Yusuke Sasaki, Hiroyoshi Miwa	A Control Method of a P2P Network with Small Degree and Diameter.	HIS	2007	DBLP DOI BibTeX RDF
21	Meijuan Gao, Jingwen Tian, Wei Jiang, Kai Li	Research of Sludge Compost Maturity Degree Modeling Method Based on Wavelet Neural Network for Sewage Treatment.	LSMS (1)	2007	DBLP DOI BibTeX RDF
21	Shoji Hirano, Shusaku Tsumoto	Characteristics of Indiscernibility Degree in Rough Clustering Examined Using Perfect Initial Equivalence Relations.	ISMIS	2006	DBLP DOI BibTeX RDF	Clustering, Rough Set, Indiscernibility
21	R. Ravi 0001, Mohit Singh	Delegate and Conquer: An LP-Based Approximation Algorithm for Minimum Degree MSTs.	ICALP (1)	2006	DBLP DOI BibTeX RDF
21	John Healy, Jeannette C. M. Janssen, Evangelos E. Milios, William Aiello	Characterization of Graphs Using Degree Cores.	WAW	2006	DBLP DOI BibTeX RDF
21	Stefan S. Dantchev, Florent R. Madelaine	Bounded-Degree Forbidden Patterns Problems Are Constraint Satisfaction Problems.	CSR	2006	DBLP DOI BibTeX RDF	Constraint Satisfaction, Duality, Monadic Second Order Logic, Logic in Computer Science, Graph Homomorphism
21	Jiong Guo, Rolf Niedermeier, Sebastian Wernicke 0001	Fixed-Parameter Tractability Results for Full-Degree Spanning Tree and Its Dual.	IWPEC	2006	DBLP DOI BibTeX RDF
21	Prosenjit Bose, Vida Dujmovic, David R. Wood	Induced Subgraphs of Bounded Degree and Bounded Treewidth.	WG	2005	DBLP DOI BibTeX RDF
21	Dongsheng Li 0001, Xicheng Lu, Jie Wu 0001	FISSIONE: a scalable constant degree and low congestion DHT scheme based on Kautz graphs.	INFOCOM	2005	DBLP DOI BibTeX RDF
21	Xiaomin Chen, Mario Szegedy, Lei Wang 0039	Optimally Balanced Forward Degree Sequence.	COCOON	2005	DBLP DOI BibTeX RDF
21	Lutz Bornmann, Jürgen Enders	Social origin and gender of doctoral degree holders.	Scientometrics	2004	DBLP DOI BibTeX RDF
21	Anirban Dasgupta 0001, John E. Hopcroft, Frank McSherry	Spectral Analysis of Random Graphs with Skewed Degree Distributions.	FOCS	2004	DBLP DOI BibTeX RDF
21	Ioannis Z. Emiris, Elias P. Tsigaridas	Comparing Real Algebraic Numbers of Small Degree.	ESA	2004	DBLP DOI BibTeX RDF
21	Sifeng Liu, Yi Lin 0001	An axiomatic definition for the degree of greyness of grey numbers.	SMC (3)	2004	DBLP DOI BibTeX RDF
21	Noam Berger, Béla Bollobás, Christian Borgs, Jennifer T. Chayes, Oliver Riordan	Degree Distribution of the FKP Network Model.	ICALP	2003	DBLP DOI BibTeX RDF
21	Maurice Margenstern, Yurii Rogozhin	A Universal Time-Varying Distributed H System of Degree 1.	DNA	2001	DBLP DOI BibTeX RDF
21	Maw-Shang Chang, Haiko Müller	On the Tree-Degree of Graphs.	WG	2001	DBLP DOI BibTeX RDF
21	Fedor V. Fomin, Petr A. Golovach	Interval Completion with the Smallest Max-degree.	WG	1998	DBLP DOI BibTeX RDF
21	Simon Sheu, Kien A. Hua, Ying Cai	On the Optimality of Degree of Declustering.	DEXA	1996	DBLP DOI BibTeX RDF
21	Chandra M. R. Kintala, Detlef Wotschke	Concurrent Conciseness of Degree, Probabilistic, Nondeterministic and Deterministic Finite Automata (Extended Abstract).	STACS	1986	DBLP DOI BibTeX RDF
20	Daniela Kühn, Deryk Osthus	Every Graph of Sufficiently Large Average Degree Contains a C4-Free Subgraph of Large Average Degree.	Comb.	2004	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 05C35, 05D40
20	Wolfgang Mader 0001	Subdivisions of a Graph of Maximal Degree n + 1 in Graphs of Average Degree n\epsilon and Large Girth.	Comb.	2001	DBLP DOI BibTeX RDF	AMS Subject Classification (2000) Classes: 05C83, 05C35
20	Thomas Wilke, Haiseung Yoo	Computing the Wadge Degree, the Lifschitz Degree, and the Rabin Index of a Regular Language of Infinite Words in Polynomial Time.	TAPSOFT	1995	DBLP DOI BibTeX RDF
19	Micha Sharir, Adam Sheffer, Emo Welzl	On degrees in random triangulations of point sets.	SCG	2010	DBLP DOI BibTeX RDF	crossing-free geometric graphs, degree sequences, number of triangulatons, random triangulations, counting, charging, plane graphs
19	Xianmin Geng, Hongwei Zhou, Guanghui Wen	Evolving Model of Weighted Networks.	Complex (2)	2009	DBLP DOI BibTeX RDF	intrinsic strength, scale-free network, degree distribution, weighted network
19	Jiu-Zhong Li, Shuo Shi	Extracting Schema from Semistructured Data with Weight Tag.	ISNN (3)	2009	DBLP DOI BibTeX RDF	Schema extraction, OEM model with weight, Label path supporting degree, Target set of label path, Semistructured Data
19	Manimegalai M. Subramaniam	Emergence of information technology skill standards: the case of NWCET initiative.	SIGITE Conference	2009	DBLP DOI BibTeX RDF	curricula guidelines, emergence of computing degree programs, nwcet, sigite, skill standards, information technology education, information technology curricula
19	Juan A. Garay, Rafail Ostrovsky	Almost-Everywhere Secure Computation.	EUROCRYPT	2008	DBLP DOI BibTeX RDF	secure message transmission, almost-everywhere agreement, bounded-degree networks, Secure multi-party computation, expander graphs
19	Shachar Lovett, Roy Meshulam, Alex Samorodnitsky	Inverse conjecture for the gowers norm is false.	STOC	2008	DBLP DOI BibTeX RDF	gowers norm, multivariate polynomials, low degree tests
19	Noriyuki Okumura, Eriko Yoshimura, Hirokazu Watabe, Tsukasa Kawaoka	An Association Method Using Concept-Base.	KES (1)	2007	DBLP DOI BibTeX RDF	Association Method, Concept-base, Degree of Association
19	Pandian Vasant, Nader Nassif Barsoum	Fuzzy optimization of units products in mix-product selection problem using fuzzy linear programming approach.	Soft Comput.	2006	DBLP DOI BibTeX RDF	Degree of satisfaction and decision maker, Uncertainty, Vagueness, Fuzzy constraint
19	Martin Isenburg, Jack Snoeyink	Early-split coding of triangle mesh connectivity.	Graphics Interface	2006	DBLP BibTeX RDF	TG coder, connectivity compression, cut-border machine, degree coding, edgebreaker, label coding, split offsets
19	O. Nouisser, Driss Sbibih, Paul Sablonnière	Pairs of B-Splines with Small Support on the Four-Directional Mesh Generating a Partition of Unity.	Adv. Comput. Math.	2004	DBLP DOI BibTeX RDF	complete 1-splines, complete 1-splines, minimal degree, B-splines
19	Alexandros Ntoulas, Junghoo Cho, Christopher Olston	What's new on the web?: the evolution of the web from a search engine perspective.	WWW	2004	DBLP DOI BibTeX RDF	change prediction, degree of change, link structure evolution, rate of change, search engines, web pages, web evolution, web characterization
19	Dennis Fetterly, Mark S. Manasse, Marc Najork, Janet L. Wiener	A large-scale study of the evolution of web pages.	WWW	2003	DBLP DOI BibTeX RDF	degree of change, rate of change, web pages, web evolution, web characterization
19	Hossein Saiedian, Donald J. Bagert, Nancy R. Mead	Software Engineering Programs: Dispelling the Myths and Misconceptions.	IEEE Softw.	2002	DBLP DOI BibTeX RDF	Software Engineering Degree, Software Engineering Education, SWEBOK
19	Jie Li 0002, Jiahong Wang, Hisao Kameda	Performance Studies of Shared-Nothing Parallel Transaction Processing Systems.	PaCT	1999	DBLP DOI BibTeX RDF	Additional overheads, degree of declustering, shared-nothing parallel transaction processing systems, simulation, performance studies, two-phased locking, resource contention
19	Vijay K. Jain, L. Lin	High-speed double precision computation of nonlinear functions.	IEEE Symposium on Computer Arithmetic	1995	DBLP DOI BibTeX RDF	high-speed double precision computation, interpolative approach, third degree polynomial, image processing, interpolation, interpolation, scientific computing, digital arithmetic, multiplications, coprocessors, coprocessors, real-time image processing, nonlinear functions, silicon area