Stem degre$ (all stems)

188 papers:

CASE-2015-SuWCRT #adaptation #fuzzy #learning

Adaptive PD fuzzy control with dynamic learning rate for two-wheeled balancing six degrees of freedom robotic arm (SFS, KJW, MCC, IJR, CCT), pp. 1258–1261.

ITiCSE-2015-LarreaDEI #evolution

Capstone Projects Evolution over a Decade in a Computer Science Engineering Degree (JJOL, CD, AJE, FJGI), p. 336.

STOC-2015-LiuL #bound

FPTAS for #BIS with Degree Bounds on One Side (JL, PL), pp. 549–556.

ICALP-v1-2015-BunT #approximate

Hardness Amplification and the Approximate Degree of Constant-Depth Circuits (MB, JT), pp. 268–280.

ICALP-v1-2015-KayalKPS #bound

Lower Bounds for Sums of Powers of Low Degree Univariates (NK, PK, TP, CS), pp. 810–821.

LATA-2015-HalavaNP #game studies #on the

On Robot Games of Degree Two (VH, RN, IP), pp. 224–236.

ICML-2015-TangSX #learning #network

Learning Scale-Free Networks by Dynamic Node Specific Degree Prior (QT, SS, JX), pp. 2247–2255.

SAC-2015-ManhaesCZ #automation #performance #predict #source code #student #towards

Towards automatic prediction of student performance in STEM undergraduate degree programs (LMBM, SMSdC, GZ), pp. 247–253.

ESEC-FSE-2015-ChengGMSSW #formal method #semantics

Semantic degrees for Industrie 4.0 engineering: deciding on the degree of semantic formalization to select appropriate technologies (CHC, TG, CM, JOS, MS, PW), pp. 1010–1013.

ICSE-v2-2015-CamilloniVA #evaluation #re-engineering #using

Using GSwE2009 for the Evaluation of a Master Degree in Software Engineering in the Universidad de la República (LC, DV, MAA), pp. 323–332.

CSL-2015-Paperman #first-order #logic

Finite-Degree Predicates and Two-Variable First-Order Logic (CP), pp. 616–630.

PODS-2014-DurandSS #database #first-order #query

Enumerating answers to first-order queries over databases of low degree (AD, NS, LS), pp. 121–131.

ICPC-2014-BeyerH #evaluation

A formal evaluation of DepDegree based on weyuker’s properties (DB, PH), pp. 258–261.

STOC-2014-DeS #approximate #performance #polynomial

Efficient deterministic approximate counting for low-degree polynomial threshold functions (AD, RAS), pp. 832–841.

STOC-2014-EisentragerHK0 #algorithm #quantum

A quantum algorithm for computing the unit group of an arbitrary degree number field (KE, SH, AK, FS), pp. 293–302.

STOC-2014-EneV #algorithm #approximate #bound #design #network #problem #requirements

Improved approximation algorithms for degree-bounded network design problems with node connectivity requirements (AE, AV), pp. 754–763.

STOC-2014-GuruswamiHHSV

Super-polylogarithmic hypergraph coloring hardness via low-degree long codes (VG, PH, JH, SS, GV), pp. 614–623.

ICALP-v2-2014-AdjiashviliR #bound #graph

Labeling Schemes for Bounded Degree Graphs (DA, NR), pp. 375–386.

ICALP-v2-2014-BorelloCV #automaton #set

Turing Degrees of Limit Sets of Cellular Automata (AB, JC, PV), pp. 74–85.

ASPLOS-2014-EyermanE #concurrent #flexibility #manycore #parallel #smt #thread #towards

The benefit of SMT in the multi-core era: flexibility towards degrees of thread-level parallelism (SE, LE), pp. 591–606.

LICS-CSL-2014-HarwathHS #bound #composition #theorem

Preservation and decomposition theorems for bounded degree structures (FH, LH, NS), p. 10.

CASE-2013-LiF #approach #integer #linear #multi #problem #programming #scheduling

A mixed integer linear programming approach for multi-degree cyclic multi-hoist scheduling problems without overlapping (XL, RYKF), pp. 274–279.

CSEET-2013-EterovicGB #approach #education #process

Teaching software processes to professionals: The approach taken by an evening master’s degree program (YE, GG, JB), pp. 309–313.

ITiCSE-2013-HawthorneC #learning #source code

ACM core IT learning outcomes for associate-degree programs (EKH, RDC), p. 357.

STOC-2013-Ben-SassonGKKS #algebra #geometry #product line

A new family of locally correctable codes based on degree-lifted algebraic geometry codes (EBS, AG, YK, SK, SS), pp. 833–842.

ICALP-v1-2013-BunT #approximate #bound

Dual Lower Bounds for Approximate Degree and Markov-Bernstein Inequalities (MB, JT), pp. 303–314.

ICALP-v1-2013-CyganP #algorithm #bound #graph #performance

Faster Exponential-Time Algorithms in Graphs of Bounded Average Degree (MC, MP), pp. 364–375.

ICALP-v2-2013-HartungNNS #analysis #complexity #graph

A Refined Complexity Analysis of Degree Anonymization in Graphs (SH, AN, RN, OS), pp. 594–606.

KDD-2013-CiglanLN #community #detection #network #on the

On community detection in real-world networks and the importance of degree assortativity (MC, ML, KN), pp. 1007–1015.

LICS-2013-HeimbergKS #bound #normalisation

An Optimal Gaifman Normal Form Construction for Structures of Bounded Degree (LH, DK, NS), pp. 63–72.

SAT-2013-Atserias #algebra #bound #problem #proving

The Proof-Search Problem between Bounded-Width Resolution and Bounded-Degree Semi-algebraic Proofs (AA), pp. 1–17.

CASE-2012-YuPCCK #design #multi

Design and control of multi-degree-of-freedom shroud nozzle hydraulic manipulator in steel manufacturing (HY, YJP, ISC, WKC, KK), pp. 538–543.

STOC-2012-AgrawalSSS #bound

Jacobian hits circuits: hitting-sets, lower bounds for depth-D occur-k formulas & depth-3 transcendence degree-k circuits (MA, CS, RS, NS), pp. 599–614.

ICALP-v1-2012-ChanLN #bound #fault tolerance #metric

Sparse Fault-Tolerant Spanners for Doubling Metrics with Bounded Hop-Diameter or Degree (THHC, ML, LN), pp. 182–193.

ICALP-v2-2012-AtseriasD #approximate #bound #quantifier

Degree Lower Bounds of Tower-Type for Approximating Formulas with Parity Quantifiers (AA, AD), pp. 67–78.

ICALP-v2-2012-GugelmannPP #clustering #graph #random #sequence

Random Hyperbolic Graphs: Degree Sequence and Clustering — (Extended Abstract) (LG, KP, UP), pp. 573–585.

CHI-2012-BoonsukGK #interface #video

The impact of three interfaces for 360-degree video on spatial cognition (WB, SBG, JWK), pp. 2579–2588.

CIKM-2012-DurakPKS #graph #modelling #network

Degree relations of triangles in real-world networks and graph models (ND, AP, TGK, CS), pp. 1712–1716.

CIKM-2012-ZhukovskiyVPOGGSR #empirical #graph #validation #web

Empirical validation of the buckley-osthus model for the web host graph: degree and edge distributions (MZ, DV, YP, LO, EG, GG, PS, AMR), pp. 1577–1581.

ICPR-2012-GuZYZ #assessment #image #quality

A new no-reference stereoscopic image quality assessment based on ocular dominance theory and degree of parallax (KG, GZ, XY, WZ), pp. 206–209.

ICPR-2012-WangCCLP #video

Video stabilization based on high degree B-spline smoothing (YW, RC, TWC, KL, NTP), pp. 3152–3155.

CSEET-2011-ChookittikulM #collaboration #effectiveness #security

Effective real-world project collaboration: Strategies from a cyber security degree program (WC, PEM), pp. 429–433.

CSEET-2011-WhiteC #design #implementation #online #re-engineering

The design and implementation of an innovative online program for a master of science degree in Computer Science — Software Engineering specialization (LJW, JWC), pp. 257–265.

PLDI-2011-RamanKOLA #distributed #parallel #using

Parallelism orchestration using DoPE: the degree of parallelism executive (AR, HK, TO, JWL, DIA), pp. 26–37.

STOC-2011-Yoshida #algorithm #approximate #bound #csp

Optimal constant-time approximation algorithms and (unconditional) inapproximability results for every bounded-degree CSP (YY), pp. 665–674.

ICEIS-v2-2011-WangS #education #information management #recommendation

Application of Recommender Engine in Academic Degree and Postgraduate Education Knowledge Management System (XW, HS), pp. 455–458.

CIKM-2011-NiuLX #graph #named #ranking #using

DIGRank: using global degree to facilitate ranking in an incomplete graph (XN, LL, KX), pp. 2297–2300.

ICML-2011-ChakrabortyS #learning

Structure Learning in Ergodic Factored MDPs without Knowledge of the Transition Function’s In-Degree (DC, PS), pp. 737–744.

KDD-2011-AoyamaSSU #approximate #graph #performance #similarity

Fast approximate similarity search based on degree-reduced neighborhood graphs (KA, KS, HS, NU), pp. 1055–1063.

HPDC-2011-LofsteadPGKSOWL

Six degrees of scientific data: reading patterns for extreme scale science IO (JFL, MP, GAG, SK, KS, RO, MW, QL), pp. 49–60.

CSL-2011-FridmanLZ #game studies #infinity #lookahead

Degrees of Lookahead in Context-free Infinite Games (WF, CL, MZ), pp. 264–276.

SIGMOD-2010-TaoSL #graph

Finding maximum degrees in hidden bipartite graphs (YT, CS, JL), pp. 891–902.

CSEET-2010-AlefP

Building Organizational Competitive Advantages with Strategically Aligned Technical Degrees: Dividends from a Visionary Corporate-University Partnership (ERA, DCP), pp. 144–152.

FoSSaCS-2010-HoltmannKT #game studies #infinity #lookahead

Degrees of Lookahead in Regular Infinite Games (MH, LK, WT), pp. 252–266.

ICALP-v1-2010-BonichonGHP

Plane Spanners of Maximum Degree Six (NB, CG, NH, LP), pp. 19–30.

CHI-2010-ChoKJSS #distance #interface #proximity #query

Dynamic query interface for spatial proximity query with degree-of-interest varied by distance to query point (MC, BHK, DKJ, YGS, JS), pp. 693–702.

CHI-2010-SaerbeckSBJ #behaviour #education #social

Expressive robots in education: varying the degree of social supportive behavior of a robotic tutor (MS, TS, CB, MDJ), pp. 1613–1622.

CHI-2010-SchwarzHHM #mobile #multi

Cord input: an intuitive, high-accuracy, multi-degree-of-freedom input method for mobile devices (JS, CH, SEH, JM), pp. 1657–1660.

ICPR-2010-GouiffesLL

Color Connectedness Degree for Mean-Shift Tracking (MG, FL, LL), pp. 4561–4564.

ICSE-2010-FritzOMM #source code

A degree-of-knowledge model to capture source code familiarity (TF, JO, GCM, ERMH), pp. 385–394.

CSL-2010-BasinC #protocol #security

Degrees of Security: Protocol Guarantees in the Face of Compromising Adversaries (DAB, CJFC), pp. 1–18.

CSEET-2009-TaranRMB #collaboration #design #feedback #implementation #process #source code

A Training Process for Faculty Members in Collaborative Degree Programs: Design, Implementation and Feedback (GT, MZR, PM, PB), pp. 122–129.

ITiCSE-2009-CasselDS

Masters degrees in computing (LNC, GD, SS), p. 366.

ITiCSE-2009-TuschLWES #framework

Technology infrastructure in support of a medical & bioinformatics masters degree (GT, PL, GW, DE, CS), p. 388.

STOC-2009-BateniCG #bound

MaxMin allocation via degree lower-bounded arborescences (MB, MC, VG), pp. 543–552.

RecSys-2009-KawamaeSY #personalisation #recommendation

Personalized recommendation based on the personal innovator degree (NK, HS, TY), pp. 329–332.

SAC-2009-MattheT #query #using

Bipolar query satisfaction using satisfaction and dissatisfaction degrees: bipolar satisfaction degrees (TM, GDT), pp. 1699–1703.

ISMM-2009-JumpM #analysis #metric

Dynamic shape analysis via degree metrics (MJ, KSM), pp. 119–128.

CSL-2009-EndrullisGZ #term rewriting

Degrees of Undecidability in Term Rewriting (JE, HG, HZ), pp. 255–270.

CSL-2009-KuskeL #automation #bound #revisited

Automatic Structures of Bounded Degree Revisited (DK, ML), pp. 364–378.

CSEET-2008-PysterTHLBB #re-engineering #source code

The Current State of Software Engineering Masters Degree Programs (ABP, RT, DH, KL, LB, KB), pp. 103–109.

STOC-2008-BansalKN #bound #design #network

Additive guarantees for degree bounded directed network design (NB, RK, VN), pp. 769–778.

STOC-2008-LauS #approximate #bound #design #network

Additive approximation for bounded degree survivable network design (LCL, MS), pp. 759–768.

STOC-2008-Lovett #generative #pseudo

Unconditional pseudorandom generators for low degree polynomials (SL), pp. 557–562.

ICALP-A-2008-BjorklundHKK #bound #graph #problem

The Travelling Salesman Problem in Bounded Degree Graphs (AB, TH, PK, MK), pp. 198–209.

ICALP-A-2008-KaleS #bound #graph

An Expansion Tester for Bounded Degree Graphs (SK, CS), pp. 527–538.

ICPR-2008-TominagaY #classification

Metal-dielectric object classification by polarization degree map (ST, TY), pp. 1–4.

LCTES-2008-BachirTC

Post-pass periodic register allocation to minimise loop unrolling degree (MB, SAAT, AC), pp. 141–150.

CASE-2007-YangXL

Two-Degree-of-Freedom Based Cross-Coupled Control for High-Accuracy Tracking Systems (JY, JX, ZL), pp. 950–955.

CSEET-2007-MeadHMRS #on the #re-engineering #source code

On the Feasibility of Specialization within Software Engineering Degree Programs (NRM, TBH, JM, MR, DS), pp. 362–366.

STOC-2007-DonovanSVW #network

Degree-constrained network flows (PD, FBS, AV, GTW), pp. 681–688.

STOC-2007-HayesVV #graph

Randomly coloring planar graphs with fewer colors than the maximum degree (TPH, JCV, EV), pp. 450–458.

STOC-2007-LauNSS #constraints #design #network #order

Survivable network design with degree or order constraints (LCL, JN, MRS, MS), pp. 651–660.

STOC-2007-Samorodnitsky #scalability #testing

Low-degree tests at large distances (AS), pp. 506–515.

STOC-2007-SinghL #approximate #bound

Approximating minimum bounded degree spanning trees to within one of optimal (MS, LCL), pp. 661–670.

CIAA-2007-MrazPO #context-free grammar #nondeterminism

A Measure for the Degree of Nondeterminism of Context-Free Languages (FM, MP, FO), pp. 192–202.

ICALP-2007-AlonCHKRS #algorithm #graph

Quasi-randomness and Algorithmic Regularity for Graphs with General Degree Distributions (NA, ACO, HH, MK, VR, MS), pp. 789–800.

CHI-2007-GuiardDC #documentation #evaluation #navigation

Quantifying degree of goal directedness in document navigation: application to the evaluation of the perspective-drag technique (YG, YD, OC), pp. 327–336.

DHM-2007-ChuangL #design #interface #usability

The Usability of Metaphors with Different Degree of Abstract in Interface Design (MCC, IL), pp. 343–352.

HCI-IPT-2007-FallmanMY #design

The Design of a Computer Mouse Providing Three Degrees of Freedom (DF, AM, BY), pp. 53–62.

HCI-IPT-2007-YangP

A Discriminative Color Quantization Depending on the Degree of Focus (HTY, DP), pp. 191–196.

ICML-2007-KramerB #kernel #performance

Kernelizing PLS, degrees of freedom, and efficient model selection (NK, MLB), pp. 441–448.

PODS-2006-Halpern #bibliography #knowledge base #perspective #statistics

From statistical knowledge bases to degrees of belief: an overview (JYH), pp. 110–113.

ITiCSE-2006-HislopE #distance #student

Retention of distance and on-campus students in a graduate computer science degree program (GWH, HJCE), p. 342.

STOC-2006-MoshkovitzR #fault

Sub-constant error low degree test of almost-linear size (DM, RR), pp. 21–30.

STOC-2006-Zuckerman #clique #linear

Linear degree extractors and the inapproximability of max clique and chromatic number (DZ), pp. 681–690.

ICALP-v1-2006-ChaudhuriRRT #algorithm #approximate #bound

A Push-Relabel Algorithm for Approximating Degree Bounded MSTs (KC, SR, SR, KT), pp. 191–201.

ICALP-v1-2006-Coja-OghlanL #graph #random

The Spectral Gap of Random Graphs with Given Expected Degrees (ACO, AL), pp. 15–26.

ICALP-v1-2006-RaviS #algorithm #approximate

Delegate and Conquer: An LP-Based Approximation Algorithm for Minimum Degree MSTs (RR, MS), pp. 169–180.

CHI-2006-FroehlichHSH

The GlobeFish and the GlobeMouse: two new six degree of freedom input devices for graphics applications (BF, JH, VS, AH), pp. 191–199.

CSCW-2006-GueddanaR #communication #video

Pêle-Mêle, a video communication system supporting a variable degree of engagement (SG, NR), pp. 423–426.

SAC-2006-RodriguesMC #order

From spontaneous total order to uniform total order: different degrees of optimistic delivery (LR, JM, NC), pp. 723–727.

SAC-2006-Yu #nondeterminism

A spatiotemporal uncertainty model of degree 1.5 for continuously changing data objects (BY), pp. 1150–1155.

SAT-2006-KojevnikovK #algebra #complexity #proving #strict

Complexity of Semialgebraic Proofs with Restricted Degree of Falsity (AK, ASK), pp. 11–21.

STOC-2005-AchlioptasCKM #bias #graph #on the

On the bias of traceroute sampling: or, power-law degree distributions in regular graphs (DA, AC, DK, CM), pp. 694–703.

STOC-2005-Bogdanov #generative #pseudo

Pseudorandom generators for low degree polynomials (AB), pp. 21–30.

SAC-2005-BeigbederM #fuzzy #information retrieval #proximity #using

An information retrieval model using the fuzzy proximity degree of term occurences (MB, AM), pp. 1018–1022.

ICSE-2005-HoekKR #education #re-engineering

A B.S. degree in informatics: contextualizing software engineering education (AvdH, DGK, DJR), pp. 641–642.

SPLC-2005-MassenL #feature model #modelling

Determining the Variation Degree of Feature Models (TvdM, HL), pp. 82–88.

SAT-2005-HirschN #proving #simulation #strict

Simulating Cutting Plane Proofs with Restricted Degree of Falsity by Resolution (EAH, SIN), pp. 135–142.

DATE-DF-2004-Saul #power management

Low Power Analogue 90 Degree Phase Shifter (PHS), pp. 28–33.

ITiCSE-2004-TuschLWES #framework

Technology infrastructure supporting a medical & bioinformatics masters degree (GT, PL, GW, DE, CS), p. 264.

FoSSaCS-2004-BucciarelliL #parallel

Hypergraphs and Degrees of Parallelism: A Completeness Result (AB, BL), pp. 58–71.

STOC-2004-Feige #bound #graph #independence #on the #random

On sums of independent random variables with unbounded variance, and estimating the average degree in a graph (UF), pp. 594–603.

CSCW-2004-HornFBMJ #analysis #evolution #network #research #social

Six degrees of jonathan grudin: a social network analysis of the evolution and impact of CSCW research (DBH, TAF, JPB, DM, SJ), pp. 582–591.

ICEIS-v3-2004-KilpelainenT #case study

The Degree of Digitalization of the Information Over-Flow: A Case Study (TK, PT), pp. 367–374.

ECIR-2004-XueS #categorisation #reduction

Eliminating High-Degree Biased Character Bigrams for Dimensionality Reduction in Chinese Text Categorization (XD, MS), pp. 197–208.

SAC-2004-RahmaniK #graph #strict

Degree restricted spanning trees of graphs (MSR, AK), pp. 225–228.

CSEET-2003-NavedaBSAHE #re-engineering

Developing an Undergraduate Software Engineering Degree (JFN, DJB, SBS, JA, TBH, SE), p. 318–?.

ITiCSE-2003-BarkerG #source code #women

The effect of institutional characteristics on participation of women in computer science bachelors degree programs (LJB, KGD), p. 242.

STOC-2003-Ben-SassonSVW #testing

Randomness-efficient low degree tests and short PCPs via epsilon-biased sets (EBS, MS, SPV, AW), pp. 612–621.

STOC-2003-KonemannR #approximate #bound

Primal-dual meets local search: approximating MST’s with nonuniform degree bounds (JK, RR), pp. 389–395.

STOC-2003-ODonnellS #bound #polynomial

New degree bounds for polynomial threshold functions (RO, RAS), pp. 325–334.

ICALP-2003-AroraC #approximate #problem #strict

Approximation Schemes for Degree-Restricted MST and Red-Blue Separation Problem (SA, KLC), pp. 176–188.

ICALP-2003-BergerBBCR #network

Degree Distribution of the FKP Network Model (NB, BB, CB, JTC, OR), pp. 725–738.

CHI-2003-GrossmanBS #interface #using

An interface for creating and manipulating curves using a high degree-of-freedom curve input device (TG, RB, KS), pp. 185–192.

ICML-2003-JensenNH #bias #relational

Avoiding Bias when Aggregating Relational Data with Degree Disparity (DJ, JN, MH), pp. 274–281.

LICS-2003-Lynch #convergence #graph #random #sequence

Convergence Law for Random Graphs with Specified Degree Sequence (JFL), p. 301–?.

ITiCSE-2002-Klee #guidelines #source code

Guidelines for associate-degree programs in computer science (KJK), p. 246.

STOC-2002-AchlioptasM #graph

Almost all graphs with average degree 4 are 3-colorable (DA, CM), pp. 199–208.

STOC-2002-CapalboRVW

Randomness conductors and constant-degree lossless expanders (MRC, OR, SPV, AW), pp. 659–668.

STOC-2002-Molloy #graph

The Glauber dynamics on colourings of a graph with high girth and maximum degree (MM), pp. 91–98.

ICALP-2002-BermanK #approximate #bound

Approximation Hardness of Bounded Degree MIN-CSP and MIN-BISECTION (PB, MK), pp. 623–632.

CSEET-2001-Cowling01a #algorithm #data type #education #experience #java #re-engineering

Teaching Data Structures and Algorithms in a Software Engineering Degree: Some Experience with Java (AJC), pp. 247–257.

STOC-2001-MolloyR #graph

Colouring graphs when the number of colours is nearly the maximum degree (MM, BAR), pp. 462–470.

STOC-2001-Trevisan #bound #optimisation #problem

Non-approximability results for optimization problems on bounded degree instances (LT), pp. 453–461.

ICSE-2001-Shepard #performance #set #source code

An Efficient Set of Software Degree Programs for One Domain (TS), pp. 623–632.

CSEET-2000-Grant #re-engineering

Undergraduate Software Engineering Degrees in Australia (DDG), pp. 308–309.

CSEET-2000-McCrackenHRWB #education #re-engineering

A Proposed Curriculum for an Undergraduate Software Engineering Degree (WMM, IH, HAR, RW, LB), p. 246–?.

ITiCSE-2000-HaganM #experience #programming #question

Does it help to have some programming experience before beginning a computing degree program? (DH, SM), pp. 25–28.

STOC-2000-KonemannR #algorithm #approximate #bound #matter

A matter of degree: improved approximation algorithms for degree-bounded minimum spanning trees (JK, RR), pp. 537–546.

CHI-2000-MasliahM #empirical

Measuring the allocation of control in a 6 degree-of-freedom docking experiment (MRM, PM), pp. 25–32.

SAC-2000-RaidlJ #algorithm #problem #search-based

A Weighted Coding in a Genetic Algorithm for the Degree-Constrained Minimum Spanning Tree Problem (GRR, BAJ), pp. 440–445.

ITiCSE-1999-Balbin #quality #question

Is your degree quality endorsed? (IB), pp. 60–63.

STOC-1999-BussGIP #calculus #linear #polynomial

Linear Gaps Between Degrees for the Polynomial Calculus Modulo Distinct Primes (SRB, DG, RI, TP), pp. 547–556.

SAC-1999-HarwoodS #low cost #network

A Method of Trading Diameter for Reduced Degree to Construct Low Cost Interconnection Networks (AH, HS), pp. 474–480.

ICSE-1999-TarrOHS #multi

N Degrees of Separation: Multi-Dimensional Separation of Concerns (PLT, HO, WHH, SMSJ), pp. 107–119.

ITiCSE-1998-NealI

Integrating professionalism into undergraduate degree courses in computing (panel) (LRN, AI), pp. 264–267.

STOC-1998-GoldreichR #graph #sublinear

A Sublinear Bipartiteness Tester for Bunded Degree Graphs (OG, DR), pp. 289–298.

ICALP-1998-Grolmusz

A Degree-Decreasing Lemma for (MOD q — MOD p) Circuits (VG), pp. 215–222.

ICPR-1998-WangIY

Recognizing degree of continuous facial expression change (MW, YI, MY), pp. 1188–1190.

ICPR-1998-WatanabeY #gesture #image #multi #realtime #recognition #sequence #using

Real time recognition of gesture and gesture degree information using multi input image sequences (TW, MY), pp. 1855–1858.

STOC-1997-AroraS #testing

Improved Low-Degree Testing and its Applications (SA, MS), pp. 485–495.

STOC-1997-GoldreichR #bound #graph #testing

Property Testing in Bounded Degree Graphs (OG, DR), pp. 406–415.

STOC-1997-RazS

A Sub-Constant Error-Probability Low-Degree Test, and a Sub-Constant Error-Probability PCP Characterization of NP (RR, SS), pp. 475–484.

CHI-1997-RaderBL #comprehension #programming #visual notation

Degrees of Comprehension: Children’s Understanding of a Visual Programming Environment (CR, CB, CHL), pp. 351–358.

CHI-1996-ZhaiMB #multi #performance

The Influence of Muscle Groups on Performance of Multiple Degree-of-Freedom Input (SZ, PM, WB), pp. 308–315.

ICPR-1996-LiM #3d #estimation

3D pose estimation from an n-degree planar curved feature in two perspective views (LL, SM), pp. 374–377.

HPCA-1996-ChenL #named

Shuffle-Ring: Overcoming the Increasing Degree of Hypercube (GC, FCML), pp. 130–138.

HPCA-1996-QiaoM #multi #network #on the #permutation

On the Multiplexing Degree Required to Embed Permutations in a Class of Networks with Direct Interconnects (CQ, YM), pp. 118–129.

STOC-1995-SaksSZ

Explicit dispersers with polylog degree (MES, AS, SZ), pp. 479–488.

DLT-1995-SalomaaY #context-free grammar #nondeterminism

Nondeterminism Degrees for Context-Free Languages (KS, SY), pp. 154–165.

ICALP-1995-BlumCGS #self

Self-Correcting for Function Fields Transcendental Degree (MB, BC, PG, TS), pp. 547–557.

ICALP-1995-Schwentick #graph #monad

Graph Connectivity, Monadic NP and Built-in Relations of Moderate Degree (TS), pp. 405–416.

CSEE-1994-CoyleFTF #industrial #re-engineering

Meeting the Needs of Industry: SMU’s Master’s Degree Program in Software Engineering (FPC, EF, MMT, DJF), pp. 543–554.

STOC-1994-HalldorssonR #approximate #bound #graph #independence #set

Greed is good: approximating independent sets in sparse and bounded-degree graphs (MMH, JR), pp. 439–448.

STOC-1994-KhullerRY

Low degree spanning trees of small weight (SK, BR, NEY), pp. 412–421.

TAGT-1994-SkodinisW #bound #graph grammar #problem

The Bounded Degree Problem for Non-Obstructing eNCE Graph Grammars (KS, EW), pp. 211–224.

ISSTA-1994-Marcus #composition #correctness #testing #verification

The Incorporation of Testing into Verification: Direct, Modular, and Hierarchical Correctness Degrees (Abstract) (LM), p. 197.

DLT-1993-BordihnD #nondeterminism

A Note on the Degree of Nondeterminism (HB, JD), pp. 70–80.

HCI-SHI-1993-BorgesBLT #design #education #framework #knowledge base #using

A Framework for Building a Knowledge Based System Using Several Experts — With an Application for Curriculum Design of Engineering Degree Courses (MNB, YB, ML, MTT), pp. 344–349.

HCI-SHI-1993-Iwata

A Six Degree-of-Freedom Pen-Based Force Display (HI), pp. 651–656.

STOC-1992-NisanS #on the

On the Degree of Boolean Functions as Real Polynomials (NN, MS), pp. 462–467.

STOC-1992-Paturi #approximate #on the #symmetry

On the Degree of Polynomials that Approximate Symmetric Boolean Functions (Preliminary Version) (RP), pp. 468–474.

ICALP-1991-BruyereF

Degree and Decomposability of Variable-Length Codes (VB, CdF), pp. 575–587.

ICALP-1991-HemachandraH

Collapsing Degrees via Strong Computation (Extended Abstract) (LAH, AH), pp. 393–404.

CSL-1991-Goerdt #bound #proving

The Cutting Plane Proof System with Bounded Degree of Falsity (AG), pp. 119–133.

RTA-1991-Brandenburg #bound #confluence #equivalence #graph grammar

The Equivalence of Boundary and Confluent Graph Grammars on Graph Languages of Bounded Degree (FJB), pp. 312–322.

SEI-1990-ReedD #embedded #re-engineering

An Undergraduate Software Engineering Major Embedded in a Computer Systems Engineering Degree (KR, TSD), pp. 49–66.

SEI-1989-BailesSR

A Proposal for a Bachelor’s Degree Program in Software Bngineering (PAB, EJS, AR), pp. 90–108.

SEI-1989-Gibbs #question #re-engineering

Is the Time Right for an Undergraduate Software Engineering Degree? (NEG), pp. 271–274.

CSL-1989-Ambos-SpiesY #polynomial #recursion #set

Honest Polynomial-Time Degrees of Elementary Recursive Sets (KAS, DY), pp. 1–15.

STOC-1986-DworkPPU #bound #fault tolerance #network

Fault Tolerance in Networks of Bounded Degree (Preliminary Version) (CD, DP, NP, EU), pp. 370–379.

STOC-1983-Gabow #network #performance #problem #reduction

An Efficient Reduction Technique for Degree-Constrained Subgraph and Bidirected Network Flow Problems (HNG), pp. 448–456.

STOC-1975-Wotschke #polynomial #problem #recognition

Degree-Languages, Polynomial Time Recognition, and the LBA Problem (DW), pp. 145–152.

STOC-1974-Chandra #canonical

Degrees of Translatability and Canonical Forms in Program Schemas: Part I (AKC), pp. 1–12.

ICALP-1974-Mehlhorn #decidability #recursion

The “Almost All” Theory of Subrecursive Degrees is Decidable (KM), pp. 317–325.

STOC-1970-Cudia #decidability #problem

The Degree Hierarchy of Undecidable Problems of Formal Grammars (DFC), pp. 10–21.