## Stem ideal$ (all stems)

### 54 papers:

- DATE-2014-KimSAVG #enterprise #metric
- Global fan speed control considering non-ideal temperature measurements in enterprise servers (JK, MMS, DA, KV, KCG), pp. 1–6.
- DLT-2014-BrzozowskiS #bound #complexity
- Upper Bounds on Syntactic Complexity of Left and Two-Sided Ideals (JAB, MS), pp. 13–24.
- DUXU-TMT-2014-FaroughiM #design #idea #on the
- On the Idea of Design: Analyzing the Ideal Form of Cars (AF, SM), pp. 64–73.
- KDD-2014-GuSJWC #estimation #network #topic
- Topic-factorized ideal point estimation model for legislative voting network (YG, YS, NJ, BW, TC), pp. 183–192.
- DHM-SET-2013-MeryS
- Ideal Mode Selection of a Cardiac Pacing System (DM, NKS), pp. 258–267.
- DUXU-CXC-2013-Fei #design #interface #mobile
- Designing for a Thumb: An Ideal Mobile Touchscreen Interface for Chinese Users (QF), pp. 44–53.
- HCI-AMTE-2013-FedericiBM #assessment #evaluation #framework #interactive #process
- Environmental Evaluation of a Rehabilitation Aid Interaction under the Framework of the Ideal Model of Assistive Technology Assessment Process (SF, SB, MLM), pp. 203–210.
- CIAA-2012-JahnKL
- Regular Ideal Languages and Their Boolean Combinations (FJ, MK, AL), pp. 205–216.
- ICALP-v2-2012-ReddyD #algol #formal method
- An Automata-Theoretic Model of Idealized Algol — (Extended Abstract) (USR, BPD), pp. 337–350.
- ICPR-2012-PanLS #kernel #learning
- Learning kernels from labels with ideal regularization (BP, JHL, LS), pp. 505–508.
- VMCAI-2012-ZuffereyWH #abstraction
- Ideal Abstractions for Well-Structured Transition Systems (DZ, TW, TAH), pp. 445–460.
- STOC-2011-HolensteinKT #equivalence #random #revisited
- The equivalence of the random oracle model and the ideal cipher model, revisited (TH, RK, ST), pp. 89–98.
- DLT-2011-BrzozowskiY #complexity
- Syntactic Complexity of Ideal and Closed Languages (JAB, YY), pp. 117–128.
- FM-2011-BartheBCL #verification
- Formally Verifying Isolation and Availability in an Idealized Model of Virtualization (GB, GB, JDC, CL), pp. 231–245.
- CHI-2011-PurpuraSWSS #behaviour #design #named #persuasion
- Fit4life: the design of a persuasive technology promoting healthy behavior and ideal weight (SP, VS, KW, WS, PS), pp. 423–432.
- FASE-2010-Harman #optimisation #why
- Why the Virtual Nature of Software Makes It Ideal for Search Based Optimization (MH), pp. 1–12.
- ICPR-2010-Strand10a #3d #grid #re-engineering
- Sampling and Ideal Reconstruction on the 3D Diamond Grid (RS), pp. 4609–4612.
- ICPR-2010-WoodardPMJR #on the
- On the Fusion of Periocular and Iris Biometrics in Non-ideal Imagery (DLW, SJP, PEM, RRJ, AR), pp. 201–204.
- STOC-2009-Gentry #encryption #using
- Fully homomorphic encryption using ideal lattices (CG), pp. 169–178.
- SAC-2008-FariaM #recognition #scalability #speech
- When a mismatch can be good: large vocabulary speech recognition trained with idealized tandem features (AF, NM), pp. 1574–1577.
- SAC-2008-LasserreLR #algebra #algorithm
- Computing the real variety of an ideal: a real algebraic and symbolic-numeric algorithm (JBL, ML, PR), pp. 1845–1846.
- MLDM-2007-MarroccoMT #comparison #empirical
- An Empirical Comparison of Ideal and Empirical ROC-Based Reject Rules (CM, MM, FT), pp. 47–60.
- CAV-2006-Hoare
- The Ideal of Verified Software (CARH), pp. 5–16.
- FoSSaCS-2005-MurawskiW #algol #decidability #higher-order
- Third-Order Idealized Algol with Iteration Is Decidable (ASM, IW), pp. 202–218.
- ICALP-2005-MurawskiOW #algol #equivalence #recursion
- Idealized Algol with Ground Recursion, and DPDA Equivalence (ASM, CHLO, IW), pp. 917–929.
- POPL-2004-VouillonM #fresh look #semantics
- Semantic types: a fresh look at the ideal model for types (JV, PAM), pp. 52–63.
- ICML-2003-KwokT #kernel #learning
- Learning with Idealized Kernels (JTK, IWT), pp. 400–407.
- DATE-2002-GinesPRSM #behaviour #design #modelling #parametricity #reuse
- A Mixed-Signal Design Reuse Methodology Based on Parametric Behavioural Models with Non-Ideal Effects (AJG, EJP, AR, RS, NMM), pp. 310–314.
- STOC-2002-Hallgren #algorithm #equation #polynomial #problem #quantum
- Polynomial-time quantum algorithms for Pell’s equation and the principal ideal problem (SH), pp. 653–658.
- LICS-2002-Ong #algol #decidability #equivalence
- Observational Equivalence of 3rd-Order Idealized Algol is Decidable (CHLO), pp. 245–256.
- TOOLS-USA-2001-McClure #how #privacy #security
- Hacking = Privacy: How Computer Hacking Can Shore Up Your Defenses and Deliver the Closest Ideal to Security Available (SM), p. 7.
- PPDP-2001-Naumann #imperative #modelling #programming #relational
- Ideal Models for Pointwise Relational and State-Free Imperative Programming (DAN), pp. 4–15.
- CBSE-2000-Hall #case study #component #education #question #what
- Educational Case Study–What is the Model of an Ideal Component? Must it be an Object? (PH), p. 8.
- ICALP-2000-GhicaM #algol #reasoning #regular expression #using
- Reasoning about Idealized ALGOL Using Regular Languages (DRG, GM), pp. 103–115.
- ICML-2000-EspositoFFS #refinement
- Ideal Theory Refinement under Object Identity (FE, NF, SF, GS), pp. 263–270.
- ICSE-2000-KautzHT #enterprise #process
- Applying and adjusting a software process improvement model in practice: the use of the IDEAL model in a small software enterprise (KK, HWH, KT), pp. 626–633.
- CAV-2000-RusinowitchSK #consistency #incremental #verification
- Mechanical Verification of an Ideal Incremental ABR Conformance (MR, SS, FK), pp. 344–357.
- ESOP-1999-MoggiTBS #ml
- An Idealized MetaML: Simpler, and More Expressive (EM, WT, ZEAB, TS), pp. 193–207.
- HCI-CCAD-1999-FlemischO
- The search for pilot’s ideal complement: experimental results with the crew assistant military Aircraft CAMA (FOF, RO), pp. 1271–1275.
- HCI-EI-1999-ChenYL #image
- Synthesizing Ideal Product Shapes by Image Morphing (LLC, SHY, JWL), pp. 730–734.
- RTA-1997-BachmairT #commutative #polynomial
- D-Bases for Polynomial Ideals over Commutative Noetherian Rings (LB, AT), pp. 113–127.
- ICALP-1996-KoppenhagenM #algorithm
- Optimal Gröbner Base Algorithms for Binomial Ideals (UK, EWM), pp. 244–255.
- FPLE-1995-JacquotG #requirements
- Requirements for an Ideal First Language (JPJ, JG), pp. 51–63.
- LOPSTR-1995-SemeraroEM #datalog #refinement #source code
- Ideal Refinement of Datalog Programs (GS, FE, DM), pp. 120–136.
- CHI-1992-Miller-Jacobs #prototype
- In Search of the Ideal Prototype (RM, HHMJ), pp. 577–579.
- ICALP-1991-ErnoultM #analysis #strict
- Uniform Ideals and Strictness Analysis (CE, AM), pp. 47–59.
- STOC-1990-Lakshman #complexity #on the
- On the Complexity of Computing a Gröbner Basis for the Radical of a Zero Dimensional Ideal (YNL), pp. 555–563.
- CAV-1990-MorrisH #execution #symbolic computation #verification
- Program Verification by Symbolic Execution of Hyperfinite Ideal Machines (JMM, MH), pp. 322–332.
- LICS-1989-AbadiPP #modelling #polymorphism #recursion
- Faithful Ideal Models for Recursive Polymorphic Types (MA, BCP, GDP), pp. 216–225.
- LICS-1989-MisloveMO #fixpoint #set
- Non-Well-Founded Sets Obtained from Ideal Fixed Points (MWM, LSM, FJO), pp. 263–272.
- SLP-1986-BoscoG86 #deduction #named
- IDEAL: An Ideal Deductive Applicative Language (PGB, EG), pp. 89–94.
- RTA-1985-Kandri-RodyKN #algebra #approach #commutative #problem #unification
- An Ideal-Theoretic Approach to Work Problems and Unification Problems over Finitely Presented Commutative Algebras (AKR, DK, PN), pp. 345–364.
- POPL-1984-MacQueenPS #polymorphism #recursion
- An Ideal Model for Recursive Polymorphic Types (DBM, GDP, RS), pp. 165–174.
- POPL-1976-JonesM #design #optimisation #programming language #towards
- Binding Time Optimization in Programming Languages: Some Thoughts Toward the Design of an Ideal Language (NDJ, SSM), pp. 77–94.