BibSLEIGH — one stem

Used together with:

way (56)
two (50)
model (43)
time (38)
use (37)

Stem one$ (all stems)

551 papers:

CASE-2015-ZhuQZ #clustering #modelling #multi #petri net #scheduling #tool support: Petri net modeling and one-wafer scheduling of single-arm tree-like multi-cluster tools (QZ, YQ, MZ), pp. 292–297.
DAC-2015-TenaceCMP #logic #synthesis: One-pass logic synthesis for graphene-based Pass-XNOR logic circuits (VT, AC, EM, MP), p. 6.
HT-2015-AinsworthNS #web: Only One Out of Five Archived Web Pages Existed as Presented (SGA, MLN, HVdS), pp. 257–266.
SIGMOD-2015-PantelaI: One Loop Does Not Fit All (SP, SI), pp. 2073–2074.
SIGMOD-2015-YuanMYG #algorithm #graph: Updating Graph Indices with a One-Pass Algorithm (DY, PM, HY, CLG), pp. 1903–1916.
VLDB-2015-ChingEKLM #graph: One Trillion Edges: Graph Processing at Facebook-Scale (AC, SE, MK, DL, SM), pp. 1804–1815.
MSR-2015-SlagWB #stack overflow #why: One-Day Flies on StackOverflow — Why the Vast Majority of StackOverflow Users Only Posts Once (RS, MdW, AB), pp. 458–461.
STOC-2015-BhattacharyaHNT #algorithm #maintenance: Space- and Time-Efficient Algorithm for Maintaining Dense Subgraphs on One-Pass Dynamic Streams (SB, MH, DN, CET), pp. 173–182.
STOC-2015-GargLOS #ram: Garbled RAM From One-Way Functions (SG, SL, RO, AS), pp. 449–458.
STOC-2015-LiuL #bound: FPTAS for #BIS with Degree Bounds on One Side (JL, PL), pp. 549–556.
CIAA-2015-Hulden #automaton #finite #regular expression: From Two-Way to One-Way Finite Automata — Three Regular Expression-Based Methods (MH), pp. 176–187.
DLT-2015-BealH #finite: Deciding Proper Conjugacy of Classes of One-Sided Finite-Type-Dyck Shifts (MPB, PH), pp. 167–178.
ICALP-v1-2015-CsehHK: Popular Matchings with Two-Sided Preferences and One-Sided Ties (ÁC, CCH, TK), pp. 367–379.
ICALP-v1-2015-MolinaroWY #complexity: Amplification of One-Way Information Complexity via Codes and Noise Sensitivity (MM, DPW, GY), pp. 960–972.
ICALP-v2-2015-LerouxST #automaton #on the #problem: On the Coverability Problem for Pushdown Vector Addition Systems in One Dimension (JL, GS, PT), pp. 324–336.
ICFP-2015-Russo #functional #haskell: Functional pearl: two can keep a secret, if one of them uses Haskell (AR), pp. 280–288.
CHI-2015-GirouardLRDEP #interactive #smarttech: One-Handed Bend Interactions with Deformable Smartphones (AG, JL, MR, FD, AKE, JP), pp. 1509–1518.
CHI-2015-GrevetG #prototype #scalability #social #using: Piggyback Prototyping: Using Existing, Large-Scale Social Computing Systems to Prototype New Ones (CG, EG), pp. 4047–4056.
CSCW-2015-GaoXHYCF #collaboration #multi: Two is Better Than One: Improving Multilingual Collaboration by Giving Two Machine Translation Outputs (GG, BX, DCH, ZY, DC, SRF), pp. 852–863.
DHM-HM-2015-WangLYHM #case study: A Study on Characteristic of Calligraphy Characters Part 2 Case of One Character of Calligraphy Letter “Kanji” and “Hiragana” (ZW, ML, KY, RH, ZM), pp. 429–436.
DUXU-UI-2015-BeltranUPSSSPCA #design #game studies #learning: Inclusive Gaming Creation by Design in Formal Learning Environments: “Girly-Girls” User Group in No One Left Behind (MEB, YU, AP, CS, WS, BS, SdlRP, MFCU, MTA), pp. 153–161.
HCI-UC-2015-DantecWCM #ecosystem: Cycle Atlanta and OneBusAway: Driving Innovation Through the Data Ecosystems of Civic Computing (CALD, KEW, RJC, EDM), pp. 327–338.
HIMI-IKD-2015-SakuraiNKTH #image #integration: Basic Study of Evoking Emotion Through Extending One’s Body Image by Integration of Internal Sense and External Sense (SS, TN, TK, TT, MH), pp. 433–444.
HIMI-IKD-2015-ZhangNZC #how #library #mobile: Search in One’s Hand: How Users Search a Mobile Library Catalog (TZ, XN, LZ, HlC), pp. 247–257.
ICML-2015-GasseAE #classification #composition #multi #on the #set: On the Optimality of Multi-Label Classification under Subset Zero-One Loss for Distributions Satisfying the Composition Property (MG, AA, HE), pp. 2531–2539.
ICML-2015-ZhuG #complexity #robust #towards: Towards a Lower Sample Complexity for Robust One-bit Compressed Sensing (RZ, QG), pp. 739–747.
KDD-2015-FrenoSJA #modelling #ranking #recommendation: One-Pass Ranking Models for Low-Latency Product Recommendations (AF, MS, RJ, CA), pp. 1789–1798.
KDD-2015-OkumuraST #analysis #classification #incremental #linear #problem: Quick Sensitivity Analysis for Incremental Data Modification and Its Application to Leave-one-out CV in Linear Classification Problems (SO, YS, IT), pp. 885–894.
SIGIR-2015-BarzegarSFHD #multi #named #semantics: DINFRA: A One Stop Shop for Computing Multilingual Semantic Relatedness (SB, JES, AF, SH, BD), pp. 1027–1028.
BX-2015-ZhuKMSH #named #parsing: BiYacc: Roll Your Parser and Reflective Printer into One (ZZ, HSK, PM, JS, ZH), pp. 43–50.
Onward-2015-AfroozehI #parsing: One parser to rule them all (AA, AI), pp. 151–170.
GPCE-2015-AlsharaSTBDS #component #inheritance #migration #object-oriented #scalability: Migrating large object-oriented Applications into component-based ones: instantiation and inheritance transformation (ZA, ADS, CT, HLB, CD, AS), pp. 55–64.
PPoPP-2015-TallentVDDKH: Diagnosing the causes and severity of one-sided message contention (NRT, AV, HvD, JD, DJK, AH), pp. 130–139.
CAV-2015-GardnerSWW #javascript #specification: A Trusted Mechanised Specification of JavaScript: One Year On (PG, GS, CW, TW), pp. 3–10.
CSL-2015-GasconST #polynomial #strict #unification: Two-Restricted One Context Unification is in Polynomial Time (AG, MSS, AT), pp. 405–422.
CSL-2015-KieronskiK #equivalence: Uniform One-Dimensional Fragments with One Equivalence Relation (EK, AK), pp. 597–615.
LICS-2015-ChatterjeeHL #algorithm: Improved Algorithms for One-Pair and k-Pair Streett Objectives (KC, MH, VL), pp. 269–280.
LICS-2015-GasconTS #polynomial #problem #unification: One Context Unification Problems Solvable in Polynomial Time (AG, AT, MSS), pp. 499–510.
CASE-2014-ShiWS #approximate #matrix: Approximation method to rank-one binary matrix factorization (ZS, LW, LS), pp. 800–805.
DAC-2014-AndraudSS: One-Shot Calibration of RF Circuits Based on Non-Intrusive Sensors (MA, HGDS, ES), p. 2.
DAC-2014-KeszoczeWHD #synthesis: Exact One-pass Synthesis of Digital Microfluidic Biochips (OK, RW, TYH, RD), p. 6.
DATE-2014-KarkarDATMY #architecture #communication #hybrid: Hybrid wire-surface wave architecture for one-to-many communication in networks-on-chip (AK, ND, RAD, KT, TSTM, AY), pp. 1–4.
DATE-2014-TsoutsosM #named: HEROIC: Homomorphically EncRypted One Instruction Computer (NGT, MM), pp. 1–6.
PODS-2014-Tao: A dynamic I/O-efficient structure for one-dimensional top-k range reporting (YT), pp. 256–265.
SIGMOD-2014-MuhlbauerRSRK0: One DBMS for all: the brawny few and the wimpy crowd (TM, WR, RS, AR, AK, TN), pp. 697–700.
VLDB-2015-YuBPDS14 #concurrent #evaluation: Staring into the Abyss: An Evaluation of Concurrency Control with One Thousand Cores (XY, GB, AP, SD, MS), pp. 209–220.
STOC-2014-BermanHT #bias #constant: Coin flipping of any constant bias implies one-way functions (IB, IH, AT), pp. 398–407.
STOC-2014-BitanskyCPR #on the: On the existence of extractable one-way functions (NB, RC, OP, AR), pp. 505–514.
DLT-J-2013-KutribMW14a #automaton #finite #multi: Stateless One-Way Multi-Head Finite Automata with Pebbles (MK, AM, MW), pp. 1141–1160.
CIAA-2014-BianchiMP #automaton #on the #power of #quantum: On the Power of One-Way Automata with Quantum and Classical States (MPB, CM, BP), pp. 84–97.
CIAA-2014-BiasiY #automaton: Unary Languages Recognized by Two-Way One-Counter Automata (MDB, AY), pp. 148–161.
ICALP-v1-2014-DemaineDFPSWW #assembly #simulation: One Tile to Rule Them All: Simulating Any Tile Assembly System with a Single Universal Tile (EDD, MLD, SPF, MJP, RTS, AW, DW), pp. 368–379.
ICALP-v1-2014-GafniH: Sporadic Solutions to Zero-One Exclusion Tasks (EG, MH), pp. 1–10.
CHI-2014-CohenDMHT #named #visual notation: OneSpace: shared visual scenes for active freeplay (MC, KRD, HM, SEH, AT), pp. 2177–2180.
CHI-2014-NgBW #interactive #mobile: Investigating the effects of encumbrance on one- and two- handed interactions with mobile devices (AN, SAB, JHW), pp. 1981–1990.
CHI-2014-TsandilasABB #coordination: Coordination of tilt and touch in one- and two-handed use (TT, CA, AB, DB), pp. 2001–2004.
DUXU-TMT-2014-SchmuntzschF #design #how #smarttech: How Two become One — Creating Synergy Effects by Applying the Joint Interview Method to Design Wearable Technology (US, LHF), pp. 173–184.
HCI-TMT-2014-Moran #interface: One Interface, Many Views: A Case for Repeatable Patterns (WM), pp. 340–349.
HIMI-AS-2014-GotzeBPB #quote: “A Careful Driver is One Who Looks in Both Directions When He Passes a Red Light” — Increased Demands in Urban Traffic (MG, FB, IPS, KB), pp. 229–240.
LCT-NLE-2014-TaraghiSES #classification #learning #markov #multi: Markov Chain and Classification of Difficulty Levels Enhances the Learning Path in One Digit Multiplication (BT, AS, ME, MS), pp. 322–333.
HILT-2014-Anderson #ada: From Ada 9x to spaceport America: going where no one has gone before (CA), pp. 1–2.
CIKM-2014-YaoTYXZSL #collaboration: Dual-Regularized One-Class Collaborative Filtering (YY, HT, GY, FX, XZ, BKS, JL), pp. 759–768.
CIKM-2014-ZhangLCZW #collaboration: Exploit Latent Dirichlet Allocation for One-Class Collaborative Filtering (HZ, ZL, YC, XZ, SW), pp. 1991–1994.
ICML-c1-2014-Shrivastava0 #performance #permutation: Densifying One Permutation Hashing via Rotation for Fast Near Neighbor Search (AS, PL), pp. 557–565.
ICML-c2-2014-0001NKA #estimation #probability: GEV-Canonical Regression for Accurate Binary Class Probability Estimation when One Class is Rare (AA, HN, SK, SA), pp. 1989–1997.
ICML-c2-2014-0005YJ #algorithm #performance #robust: Efficient Algorithms for Robust One-bit Compressive Sensing (LZ, JY, RJ), pp. 820–828.
ICML-c2-2014-RomanoBNV #clustering #standard: Standardized Mutual Information for Clustering Comparisons: One Step Further in Adjustment for Chance (SR, JB, XVN, KV), pp. 1143–1151.
ICML-c2-2014-SeldinS #algorithm #probability: One Practical Algorithm for Both Stochastic and Adversarial Bandits (YS, AS), pp. 1287–1295.
ICML-c2-2014-WangLLFDY #matrix: Rank-One Matrix Pursuit for Matrix Completion (ZW, MJL, ZL, WF, HD, JY), pp. 91–99.
ICPR-2014-HadjadjiCG #classification #multi: Multiple One-Class Classifier Combination for Multi-class Classification (BH, YC, YG), pp. 2832–2837.
ICPR-2014-KrawczykWC #classification #clustering #fuzzy: Weighted One-Class Classifier Ensemble Based on Fuzzy Feature Space Partitioning (BK, MW, BC), pp. 2838–2843.
KEOD-2014-FreibergHP #knowledge-based #novel #paradigm: Clarification KBS as Consultation-Justification Mash Ups — Proposing a Novel Paradigm for All-in-One Knowledge-based Systems (MF, FH, FP), pp. 168–175.
MLDM-2014-AbdullahiCM #approach #identification #novel #using: A Novel Approach for Identifying Banded Patterns in Zero-One Data Using Column and Row Banding Scores (FBA, FC, RM), pp. 58–72.
MLDM-2014-LarinSKKHC #classification #parametricity #representation #using: Parametric Representation of Objects in Color Space Using One-Class Classifiers (AL, OS, AK, SYK, SCH, BHC), pp. 300–314.
MLDM-2014-UtkinZC #classification #data-driven #database #robust: A Robust One-Class Classification Model with Interval-Valued Data Based on Belief Functions and Minimax Strategy (LVU, YAZ, AIC), pp. 107–118.
Onward-2014-VisserWTNVPK #design #implementation #verification: A Language Designer’s Workbench: A One-Stop-Shop for Implementation and Verification of Language Designs (EV, GW, APT, PN, VAV, AP, GK), pp. 95–111.
SAC-2014-PatanaikZK #estimation #parametricity #simulation: Parameter estimation and simulation for one-choice Ratcliff diffusion model (AP, VZ, CKK), pp. 3–7.
ICST-2014-DelamaroDDLO #c #evaluation: Experimental Evaluation of SDL and One-Op Mutation for C (MED, LD, VHSD, NL, JO), pp. 203–212.
LICS-CSL-2014-ChenM #classification #complexity #graph #query: One hierarchy spawns another: graph deconstructions and the complexity classification of conjunctive queries (HC, MM), p. 10.
TAP-2014-BardinCDK #automation #testing #tool support: An All-in-One Toolkit for Automated White-Box Testing (SB, OC, MD, NK), pp. 53–60.
CASE-2013-PanHJ #concurrent #flexibility #petri net #policy #using: One computationally improved deadlock prevention policy for flexible manufacturing systems using Petri nets (YLP, HH, MJ), pp. 924–929.
CASE-2013-ZhuGX #scheduling: MDP-based appointment scheduling for one examination of two types of outpatients (LZ, NG, XX), pp. 764–769.
CASE-2013-ZhuWQZ #clustering #modelling #multi #petri net #scheduling #tool support: Petri net modeling and one-wafer scheduling of single-arm multi-cluster tools (QZ, NW, YQ, MZ), pp. 862–867.
ICDAR-2013-HoRRES #approach #classification #documentation: Document Classification in a Non-stationary Environment: A One-Class SVM Approach (AKNH, NR, JYR, VE, NS), pp. 616–620.
ICDAR-2013-Howe #modelling #word: Part-Structured Inkball Models for One-Shot Handwritten Word Spotting (NRH), pp. 582–586.
VLDB-2013-0007DSF #named: Mosquito: Another One Bites the Data Upload STream (SR, JD, SS, TF), pp. 1274–1277.
VLDB-2013-BrunatoB #learning #optimisation: Learning and Intelligent Optimization (LION): One Ring to Rule Them All (MB, RB), pp. 1176–1177.
VLDB-2013-KoutrikaLL #web: User Analytics with UbeOne: Insights into Web Printing (GK, QL, JL), pp. 1382–1385.
VLDB-2013-SundaramTSMIMD #parallel #similarity #streaming #twitter #using: Streaming Similarity Search over one Billion Tweets using Parallel Locality-Sensitive Hashing (NS, AT, NS, TM, PI, SM, PD), pp. 1930–1941.
VLDB-2014-KaulWYJ13: Finding Shortest Paths on Terrains by Killing Two Birds with One Stone (MK, RCWW, BY, CSJ), pp. 73–84.
ITiCSE-2013-Kurkovsky #mobile #question #why: Mobile computing and robotics in one course: why not? (SK), pp. 64–69.
MSR-2013-DullemondGSD #distributed #microblog #problem: Fixing the “out of sight out of mind” problem: one year of mood-based microblogging in a distributed software team (KD, BvG, MADS, AvD), pp. 267–276.
STOC-2013-BohmGJ #automaton #equivalence: Equivalence of deterministic one-counter automata is NL-complete (SB, SG, PJ), pp. 131–140.
STOC-2013-ChungPS #security #simulation: Non-black-box simulation from one-way functions and applications to resettable security (KMC, RP, KS), pp. 231–240.
CIAA-J-2012-Berlinkov13 #automaton #clustering: Synchronizing quasi-Eulerian and quasi-One-Cluster Automata (MVB), pp. 729–746.
CIAA-2013-PrusaMO #2d #automaton: Comparing Two-Dimensional One-Marker Automata to Sgraffito Automata (DP, FM, FO), pp. 268–279.
DLT-2013-JezO #ambiguity #boolean grammar: Unambiguous Conjunctive Grammars over a One-Letter Alphabet (AJ, AO), pp. 277–288.
DLT-2013-KutribMW #automaton #finite #multi: One-Way Multi-Head Finite Automata with Pebbles But No States (MK, AM, MW), pp. 313–324.
ICALP-v2-2013-Jez #equation #linear #word: One-Variable Word Equations in Linear Time (AJ), pp. 324–335.
LATA-2013-Quaas #automaton #logic #metric #model checking: Model Checking Metric Temporal Logic over Automata with One Counter (KQ), pp. 468–479.
CHI-2013-TeatherS #3d: Pointing at 3d target projections with one-eyed and stereo cursors (RJT, WS), pp. 159–168.
DUXU-CXC-2013-Stevens #behaviour #gamification #how #social: How Gamification and Behavior Science Can Drive Social Change One Employee at a Time (SHS), pp. 597–601.
HCI-IMT-2013-EbisawaF #detection #using #video: Head-Free, Remote Gaze Detection System Based on Pupil-Corneal Reflection Method with Using Two Video Cameras — One-Point and Nonlinear Calibrations (YE, KF), pp. 205–214.
ICEIS-J-2013-JuniorPVDCC #aspect-oriented #modelling #object-oriented #re-engineering: Reengineering of Object-Oriented Software into Aspect-Oriented Ones Supported by Class Models (PAPJ, RDP, MCV, RSD, VVdC, HAXC), pp. 296–313.
ICEIS-v2-2013-JuniorVDCCP #aspect-oriented #modelling #object-oriented #refactoring: Concern-based Refactorings Supported by Class Models to Reengineer Object-Oriented Software into Aspect-Oriented Ones (PAPJ, MCV, RSD, VVdC, HAXC, RADP), pp. 46–57.
CIKM-2013-GanuM #multi #web: One size does not fit all: multi-granularity search of web forums (GG, AM), pp. 9–18.
ICML-c3-2013-GaoJZZ #optimisation: One-Pass AUC Optimization (WG, RJ, SZ, ZHZ), pp. 906–914.
ICML-c3-2013-GopiN0N: One-Bit Compressed Sensing: Provable Support and Vector Recovery (SG, PN, PJ, AVN), pp. 154–162.
ICML-c3-2013-LondonHTG #predict: Collective Stability in Structured Prediction: Generalization from One Example (BL, BH, BT, LG), pp. 828–836.
KDD-2013-TangZM #modelling #multi #topic: One theme in all views: modeling consensus topics in multiple contexts (JT, MZ, QM), pp. 5–13.
RecSys-2013-AharonABLABLRS #named #online #persistent #recommendation #set: OFF-set: one-pass factorization of feature sets for online recommendation in persistent cold start settings (MA, NA, EB, RL, RA, TB, LL, RR, OS), pp. 375–378.
RecSys-2013-XuBATMK #recommendation: Catch-up TV recommendations: show old favourites and find new ones (MX, SB, SA, ST, AM, IK), pp. 285–294.
SIGIR-2013-Ekstrand-AbuegPKSYI #automation #evaluation: Exploring semi-automatic nugget extraction for Japanese one click access evaluation (MEA, VP, MPK, TS, TY, MI), pp. 749–752.
SIGIR-2013-PappasP #analysis #collaboration #sentiment: Sentiment analysis of user comments for one-class collaborative filtering over ted talks (NP, APB), pp. 773–776.
Onward-2013-WurthingerWWSDHRSW #virtual machine: One VM to rule them all (TW, CW, AW, LS, GD, CH, GR, DS, MW), pp. 187–204.
REFSQ-2013-JantunenHG #challenge #problem: Adjusting to Increasing Product Management Problems: Challenges and Improvement Proposals in One Software Company (SJ, KH, DCG), pp. 386–400.
SAC-2013-SrivastavaSM #clustering #graph #using: Text clustering using one-mode projection of document-word bipartite graphs (AS, AJS, EEM), pp. 927–932.
ICSE-2013-DongSL #model checking: Build your own model checker in one month (JSD, JS, YL), pp. 1481–1483.
PLOS-2013-Kell #operating system #question: The operating system: should there be one? (SK), p. 7.
CADE-2013-Filliatre #logic: One Logic to Use Them All (JCF), pp. 1–20.
CAV-2013-StewartEY #automaton #bound #model checking #polynomial #probability: Upper Bounds for Newton’s Method on Monotone Polynomial Systems, and P-Time Model Checking of Probabilistic One-Counter Automata (AS, KE, MY), pp. 495–510.
CSL-2013-HampsonK #first-order #linear #logic: One-variable first-order linear temporal logics with counting (CH, AK), pp. 348–362.
ICST-2013-PezzeRW #effectiveness #generative #integration #testing: Generating Effective Integration Test Cases from Unit Ones (MP, KR, JW), pp. 11–20.
LICS-2013-FiliotGRS #finite #transducer: From Two-Way to One-Way Finite State Transducers (EF, OG, PAR, FS), pp. 468–477.
LICS-2013-HofmanMT #decidability #simulation: Decidability of Weak Simulation on One-Counter Nets (PH, RM, PT), pp. 203–212.
LICS-2013-RosuSCM #logic #reachability: One-Path Reachability Logic (GR, AS, SC, BMM), pp. 358–367.
CASE-2012-ZhangWZX #fault #memory management #using: A dynamic memory model for mechanical fault diagnosis using one-class support vector machine (QZ, JW, JZ, GX), pp. 497–501.
VLDB-2012-GiannikisAK #named #query: SharedDB: Killing One Thousand Queries With One Stone (GG, GA, DK), pp. 526–537.
ITiCSE-2012-Harel #experience: Standing on the shoulders of a giant: one person’s experience of turing’s impact (DH), p. 3.
FoSSaCS-2012-GollerHOW #automaton #model checking #parametricity: Branching-Time Model Checking of Parametric One-Counter Automata (SG, CH, JO, JW), pp. 406–420.
STOC-2012-Applebaum #generative #locality #pseudo #random: Pseudorandom generators with long stretch and low locality from random local one-way functions (BA), pp. 805–816.
STOC-2012-BrandtIKK #analysis: An analysis of one-dimensional schelling segregation (CB, NI, GK, RK), pp. 789–804.
AFL-J-2011-IbarraS12 #bound #linear: Characterizations of Bounded semilinear Languages by One-Way and Two-Way Deterministic Machines (OHI, SS), pp. 1291–1306.
AFL-J-2011-KufleitnerL12: Around dot-Depth One (MK, AL), pp. 1323–1340.
CIAA-2012-Martyugin #ambiguity #automaton: Synchronization of Automata with One Undefined or Ambiguous Transition (PVM), pp. 278–288.
ICALP-v1-2012-DeshpandeKS: Zero-One Rounding of Singular Vectors (AD, RK, NS), pp. 278–289.
ICALP-v2-2012-BrazdilKNW #markov #process #termination: Minimizing Expected Termination Time in One-Counter Markov Decision Processes (TB, AK, PN, DW), pp. 141–152.
ICALP-v2-2012-Harel #experience #summary: Standing on the Shoulders of a Giant — One Persons Experience of Turings Impact (Summary of the Alan M. Turing Lecture) (DH), pp. 16–22.
LATA-2012-Yamakami #automaton #finite #quantum: One-Way Reversible and Quantum Finite Automata with Advice (TY), pp. 526–537.
CHI-2012-RaeTM #behaviour #communication: One of the gang: supporting in-group behavior for embodied mediated communication (IR, LT, BM), pp. 3091–3100.
CSCW-2012-DongF #communication #why: One piece at a time: why video-based communication is better for negotiation and conflict resolution (WD, WTF), pp. 167–176.
CSCW-2012-EhrlichC #analysis #communication #development #distributed #multi #performance: All-for-one and one-for-all?: a multi-level analysis of communication patterns and individual performance in geographically distributed software development (KE, MC), pp. 945–954.
CSCW-2012-EiriksdottirKCMMXP #comprehension #game studies #health #multi #pervasive: This is not a one-horse race: understanding player types in multiplayer pervasive health games for youth (EE, DK, RC, EDM, ADM, YX, ESP), pp. 843–852.
CIKM-2012-HaiCC #mining: One seed to find them all: mining opinion features via association (ZH, KC, GC), pp. 255–264.
ICML-2012-SunRZ #adaptation #multi #named #problem: AOSO-LogitBoost: Adaptive One-Vs-One LogitBoost for Multi-Class Problem (PS, MDR, JZ), p. 103.
ICPR-2012-CheplyginaTL #question: Does one rotten apple spoil the whole barrel? (VC, DMJT, ML), pp. 1156–1159.
ICPR-2012-DAmbrosioIS #learning #re-engineering: A One-per-Class reconstruction rule for class imbalance learning (RD, GI, PS), pp. 1310–1313.
KDD-2012-WuALYY #on the: On “one of the few” objects (YW, PKA, CL, JY, CY), pp. 1487–1495.
SEKE-2012-AnguswamyF #case study #component #reuse: An Exploratory Study of One-Use and Reusable Software Components (RA, WBF), pp. 194–219.
SIGIR-2012-LipkaSA #classification #clustering #information retrieval #problem: Cluster-based one-class ensemble for classification problems in information retrieval (NL, BS, MA), pp. 1041–1042.
SIGIR-2012-MaoLCCS #named #recommendation: myDJ: recommending karaoke songs from one’s own voice (KM, XL, KC, GC, LS), p. 1009.
IJCAR-2012-MarshallN #algorithm #unification: New Algorithms for Unification Modulo One-Sided Distributivity and Its Variants (AMM, PN), pp. 408–422.
RTA-2012-CreusGG #unification: One-context Unification with STG-Compressed Terms is in NP (CC, AG, GG), pp. 149–164.
CASE-2011-LeeLNCC #design #optimisation: Design optimization of one-time-use leaping mechanism for sensor node relocation (GL, GL, YN, NYC, DC), pp. 749–754.
DocEng-2011-Davis #how: Google’s international bloopers... and how we fixed one (MD), pp. 101–102.
HT-2011-JonesA #tool support: Many views, many modes, many tools & one structure (WJ, KMA), pp. 113–122.
SIGMOD-2011-LiMDMS #framework #pipes and filters #scalability #using: A platform for scalable one-pass analytics using MapReduce (BL, EM, YD, AM, PJS), pp. 985–996.
SIGMOD-2011-OrdonezP #algorithm #data mining #mining: One-pass data mining algorithms in a DBMS with UDFs (CO, SKP), pp. 1217–1220.
FoSSaCS-2011-BorealePP #information management: Asymptotic Information Leakage under One-Try Attacks (MB, FP, MP), pp. 396–410.
STOC-2011-Goyal #constant #protocol #using: Constant round non-malleable protocols using one way functions (VG), pp. 695–704.
STOC-2011-LinP: Constant-round non-malleable commitments from any one-way function (HL, RP), pp. 705–714.
STOC-2011-RegevK #communication #quantum: Quantum one-way communication can be exponentially stronger than classical communication (OR, BK), pp. 31–40.
DLT-J-2009-BealBP11 #automaton #bound #clustering #polynomial #word: A Quadratic Upper Bound on the Size of a Synchronizing Word in One-Cluster Automata (MPB, MVB, DP), pp. 277–288.
DLT-J-2009-LaineP11 #equation #word: Word Equations with One Unknown (ML, WP), pp. 345–375.
AFL-2011-Blanchet-SadriNT #on the #word: On Operations Preserving Primitivity of Partial Words with One Hole (FBS, SN, AT), pp. 93–107.
AFL-2011-IbarraS #bound #linear: Characterizations of Bounded Semilinear Languages by One-Way and Two-way Deterministic Machines (OHI, SS), pp. 211–224.
AFL-2011-KufleitnerL: Around Dot-Depth One (MK, AL), pp. 255–269.
CIAA-2011-HanK #automaton: A Cellular Automaton Model for Car Traffic with a Form-One-Lane Rule (YSH, SKK), pp. 154–165.
DLT-2011-BattagliaGS #multi #order: Counting the Orderings for Multisets in Consecutive Ones Property and PQ-Trees (GB, RG, NS), pp. 58–69.
DLT-2011-CaronHM: Generalized One-Unambiguity (PC, YSH, LM), pp. 129–140.
DLT-2011-Fujioka: Morphic Characterizations in Terms of Insertion Systems with a Context of Length One (KF), pp. 474–475.
ICALP-v1-2011-Zhang #bound #communication #complexity #on the #power of #quantum: On the Power of Lower Bound Methods for One-Way Quantum Communication Complexity (SZ), pp. 49–60.
ICALP-v2-2011-BrazdilBEK #approximate #game studies #probability #termination: Approximating the Termination Value of One-Counter MDPs and Stochastic Games (TB, VB, KE, AK), pp. 332–343.
CHI-2011-MaedaHKA: “ClearPlate” for capturing printed information: a scanner and viewfinder in one optical unit (AM, KH, MK, MA), pp. 2737–2740.
DHM-2011-QinTD #type system #using: The Upper Extremity Loading during Typing Using One, Two and Three Fingers (JQ, MT, JTD), pp. 178–185.
DUXU-v1-2011-BuettnerS #how #mobile #web: Mobile Web and Native Apps: How One Team Found a Happy Medium (KB, AMS), pp. 549–554.
HCD-2011-Shima #design #industrial #information management: One of Industrial Design Case to Share Tacit Knowledge (HS), pp. 435–439.
HCI-DDA-2011-WangDL #algorithm: A Global Optimal Algorithm for Camera Calibration with One-Dimensional Objects (LW, FD, CL), pp. 660–669.
IDGD-2011-HwangY #interface #multi: Accommodating Both Expert Users and Novice Users in One Interface by Utilizing Multi-layer Interface in Complex Function Products (TKPH, HYY), pp. 159–165.
ICEIS-v1-2011-DiEM #framework #research: Research and Application of Carrier-grade Mashup Platform on OneAPI (JD, HE, LM), pp. 504–509.
CIKM-2011-AnderkaSL #classification #detection #problem #quality: Detection of text quality flaws as a one-class classification problem (MA, BS, NL), pp. 2313–2316.
CIKM-2011-KoloniariNPS #distributed: One is enough: distributed filtering for duplicate elimination (GK, NN, EP, DS), pp. 433–442.
CIKM-2011-LiuLH #bound #fault #kernel #learning: Learning kernels with upper bounds of leave-one-out error (YL, SL, YH), pp. 2205–2208.
CIKM-2011-NavigliFSLA #ambiguity #categorisation #learning #modelling #semantics #word: Two birds with one stone: learning semantic models for text categorization and word sense disambiguation (RN, SF, AS, OLdL, EA), pp. 2317–2320.
CIKM-2011-Pasca #query #using #web #what: Asking what no one has asked before: using phrase similarities to generate synthetic web search queries (MP), pp. 1347–1352.
KMIS-2011-Nishioka #process #using: Quotation Process Management of One-of-a-kind Production using PSLX Information Model (YN), pp. 167–172.
MLDM-2011-JoutsijokiJ #classification #image: Comparing the One-vs-One and One-vs-All Methods in Benthic Macroinvertebrate Image Classification (HJ, MJ), pp. 399–413.
SIGIR-2011-HaoCPZ #web: From one tree to a forest: a unified solution for structured web data extraction (QH, RC, YP, LZ), pp. 775–784.
OOPSLA-2011-BurckhardtLSYB #incremental #parallel: Two for the price of one: a model for parallel and incremental computation (SB, DL, CS, JY, TB), pp. 427–444.
SLE-2011-KlintLP #analysis #towards #visualisation: Towards a One-Stop-Shop for Analysis, Transformation and Visualization of Software (PK, BL, AvdP), pp. 1–18.
LICS-2011-KufleitnerL #infinity #word: Languages of Dot-Depth One over Infinite Words (MK, AL), pp. 23–32.
SAT-2011-AbioDNS: Reducing Chaos in SAT-Like Search: Finding Solutions Close to a Given One (IA, MD, RN, PJS), pp. 273–286.
DAC-2010-HarmsCDHUWY #design #experience #question #what: What will make your next design experience a much better one? (TH, JAC, RD, RAH, DU, GW, JY), p. 730.
DATE-2010-AkinSH #configuration management #estimation #hardware #multi: A reconfigurable hardware for one bit transform based multiple reference frame Motion Estimation (AA, GS, IH), pp. 393–398.
TACAS-2010-BaslerHKOWZ #model checking #named: Boom: Taking Boolean Program Model Checking One Step Further (GB, MH, DK, CHLO, TW, HZ), pp. 145–149.
STOC-2010-AkaviaGGM #np-hard: Erratum for: on basing one-way functions on NP-hardness (AA, OG, SG, DM), pp. 795–796.
STOC-2010-BravermanO10a: Zero-one frequency laws (VB, RO), pp. 281–290.
STOC-2010-HaitnerRV #generative #performance #pseudo: Efficiency improvements in constructing pseudorandom generators from one-way functions (IH, OR, SPV), pp. 437–446.
STOC-2010-Vegh: Augmenting undirected node-connectivity by one (LAV), pp. 563–572.
ICALP-v1-2010-KratschW #preprocessor #problem: Preprocessing of Min Ones Problems: A Dichotomy (SK, MW), pp. 653–665.
ICALP-v2-2010-GollerHOW #automaton #model checking #parametricity: Model Checking Succinct and Parametric One-Counter Automata (SG, CH, JO, JW), pp. 575–586.
CHI-2010-FerrisWB #named #realtime: OneBusAway: results from providing real-time arrival information for public transit (BF, KW, AB), pp. 1807–1816.
CHI-2010-HeGH #design #energy #feedback: One size does not fit all: applying the transtheoretical model to energy feedback technology design (HAH, SG, EMH), pp. 927–936.
CSCW-2010-KeeganG #social #social media: Egalitarians at the gate: one-sided gatekeeping practices in social media (BK, DG), pp. 131–134.
CIKM-2010-LiHZC #collaboration: Improving one-class collaborative filtering by incorporating rich user information (YL, JH, CZ, YC), pp. 959–968.
ICML-2010-GaudelS #feature model #game studies: Feature Selection as a One-Player Game (RG, MS), pp. 359–366.
ICML-2010-Raphael #machine learning #music: Music Plus One and Machine Learning (CR), pp. 21–28.
ICML-2010-Scherrer #difference #fixpoint #perspective: Should one compute the Temporal Difference fix point or minimize the Bellman Residual? The unified oblique projection view (BS), pp. 959–966.
ICML-2010-TuL #classification #multi: One-sided Support Vector Regression for Multiclass Cost-sensitive Classification (HHT, HTL), pp. 1095–1102.
ICPR-2010-CoutinhoFF #identification #parsing #using: One-Lead ECG-based Personal Identification Using Ziv-Merhav Cross Parsing (DPC, ALNF, MATF), pp. 3858–3861.
ICPR-2010-Liu10a #classification #prototype #retrieval: One-Vs-All Training of Prototype Classifier for Pattern Classification and Retrieval (CLL), pp. 3328–3331.
ICPR-2010-LiZ #using: One-Shot Scanning Using a Color Stripe Pattern (RL, HZ), pp. 1666–1669.
KR-2010-DitmarschEW #logic: One Hundred Prisoners and a Lightbulb — Logic and Computation (HvD, JvE, WW).
KR-2010-HuL #correctness #problem #reasoning: A Correctness Result for Reasoning about One-Dimensional Planning Problems (YH, HJL).
SIGIR-2010-WangL #multi #summary: Many are better than one: improving multi-document summarization via weighted consensus (DW, TL), pp. 809–810.
SAC-2010-DolevGK #multi #scalability #trust: Computing multi-party trust privately: in O(n) time units sending one (possibly large) message at a time (SD, NG, MK), pp. 1460–1465.
HPCA-2010-RomanescuLSB #protocol: UNified Instruction/Translation/Data (UNITD) coherence: One protocol to rule them all (BFR, ARL, DJS, AB), pp. 1–12.
SAT-2010-GelderS #design #satisfiability: Zero-One Designs Produce Small Hard SAT Instances (AVG, IS), pp. 388–397.
TAP-2010-Ernst #feedback #how #proving #testing: How Tests and Proofs Impede One Another: The Need for Always-On Static and Dynamic Feedback (MDE), pp. 1–2.
DAC-2009-NanshiS #abstraction #constraints #refinement: Constraints in one-to-many concretization for abstraction refinement (KN, FS), pp. 569–574.
PODS-2009-PaghS: Secondary indexing in one dimension: beyond b-trees and bitmap indexes (RP, SRS), pp. 177–186.
PODS-2009-Yi #bound #query: Dynamic indexability and lower bounds for dynamic one-dimensional range query indexes (KY), pp. 187–196.
SIGMOD-2009-NathYC #outsourcing: Secure outsourced aggregation via one-way chains (SN, HY, HC), pp. 31–44.
CSEET-2009-MaramPMD: Sixteen Roles Performed by Software Engineers in First One Year (MM, PP, SM, ND), pp. 212–215.
ITiCSE-2009-HuangB #approach #question: A unified approach to introductory computer science: can one size fit all? (TH, AB), pp. 253–257.
DLT-2009-BealP #automaton #bound #clustering #polynomial #word: A Quadratic Upper Bound on the Size of a Synchronizing Word in One-Cluster Automata (MPB, DP), pp. 81–90.
DLT-2009-LaineP #equation #word: Word Equations with One Unknown (ML, WP), pp. 348–359.
LATA-2009-VerwerWW #automaton: One-Clock Deterministic Timed Automata Are Efficiently Identifiable in the Limit (SV, MdW, CW), pp. 740–751.
CHI-2009-RosnerB #learning: Learning from IKEA hacking: I’m not one to decoupage a tabletop and call it a day (DR, JB), pp. 419–422.
CHI-2009-SauroD #comparison #usability: Comparison of three one-question, post-task usability questionnaires (JS, JSD), pp. 1599–1608.
DHM-2009-AksenovVLC #approach: Ambient Compass: One Approach to Model Spatial Relations (PA, GV, KL, KC), pp. 183–191.
HCI-AUII-2009-JiK #named #using: CLURD: A New Character-Inputting System Using One 5-Way Key Module (HJ, TK), pp. 39–47.
HCI-NIMT-2009-Pastel #2d #modelling: Modeling the Difficulty for Centering Rectangles in One and Two Dimensions (RP), pp. 879–888.
CAiSE-2009-Simone #modelling: Computer-Centric Business Operating Models vs. Network-Centric Ones (MdS), pp. 6–7.
ICEIS-DISI-2009-ClaypoolMHSR #integration #named: ESpace — Web-scale Integration One Step at a Time (KTC, JLM, DVH, MS, EAR), pp. 247–252.
KDD-2009-PanS #collaboration #scalability: Mind the gaps: weighting the unknown in large-scale one-class collaborative filtering (RP, MS), pp. 667–676.
KDIR-2009-VillalbaC #biology #case study #classification #generative #reduction: Artificial Data Generation for One-class Classification — A Case Study of Dimensionality Reduction for Text and Biological Data (SDV, PC), pp. 202–210.
KMIS-2009-SonntagM #image #information management #problem #query #repository #semantics: Unifying Semantic Annotation and Querying in Biomedical Image Repositories — One Solution for Two Problems of Medical Knowledge Engineering (DS, MM), pp. 89–94.
MLDM-2009-SilvaSNPJN #classification #geometry #image #metric #using: Lung Nodules Classification in CT Images Using Simpson’s Index, Geometrical Measures and One-Class SVM (CAdS, ACS, SMBN, ACdP, GBJ, RAN), pp. 810–822.
PADL-2009-CostaR: One Table Fits All (JC, RR), pp. 195–208.
SAC-2009-Brand #composition #constraints #matrix #problem: The sum-of-increments constraint in the consecutive-ones matrix decomposition problem (SB), pp. 1417–1418.
CADE-2009-GregoireMP #question #set: Does This Set of Clauses Overlap with at Least One MUS? (ÉG, BM, CP), pp. 100–115.
CSL-2009-To #model checking #process: Model Checking FO(R) over One-Counter Processes and beyond (AWT), pp. 485–499.
ICLP-2009-ChenJL #logic programming #source code: Computing Loops with at Most One External Support Rule for Disjunctive Logic Programs (XC, JJ, FL), pp. 130–144.
ICLP-2009-LierlerL #decidability #source code: One More Decidable Class of Finitely Ground Programs (YL, VL), pp. 489–493.
LICS-2009-GollerMT #complexity #on the #process #verification: On the Computational Complexity of Verifying One-Counter Processes (SG, RM, AWT), pp. 235–244.
RTA-2009-Schubert #parallel: The Existential Fragment of the One-Step Parallel Rewriting Theory (AS), pp. 78–92.
RTA-2009-SeidlV #protocol: Flat and One-Variable Clauses for Single Blind Copying Protocols: The XOR Case (HS, KNV), pp. 118–132.
SAT-2009-JohannsenRW #satisfiability #strict: Solving SAT for CNF Formulas with a One-Sided Restriction on Variable Occurrences (DJ, IR, MW), pp. 80–85.
ASE-2008-LuciaOT #comparison #empirical #incremental #process #traceability: IR-Based Traceability Recovery Processes: An Empirical Comparison of “One-Shot” and Incremental Processes (ADL, RO, GT), pp. 39–48.
CASE-2008-QianK #component #performance #product line: Supply chain performance with various price-dependent demand functions and component commonality in one product family (LQ, Z(K), pp. 760–765.
DATE-2008-FangH #algorithm #approximate #performance #satisfiability: A Fast Approximation Algorithm for MIN-ONE SAT (LF, MSH), pp. 1087–1090.
DATE-2008-NanshiS: Improved Visibility in One-to-Many Trace Concretization (KN, FS), pp. 819–824.
FoSSaCS-2008-DemriLS #automaton #ltl #model checking: Model Checking Freeze LTL over One-Counter Automata (SD, RL, AS), pp. 490–504.
STOC-2008-ColeF #algorithm #problem: Fast-converging tatonnement algorithms for one-time and ongoing market problems (RC, LF), pp. 315–324.
AFL-2008-AfoninK #regular expression: Semigroups of regular languages over a one letter alphabet are rational (SA, EK), pp. 61–73.
ICALP-B-2008-BojanczykS #first-order #logic #quantifier: Tree Languages Defined in First-Order Logic with One Quantifier Alternation (MB, LS), pp. 233–245.
ICALP-C-2008-CanettiD: Extractable Perfectly One-Way Functions (RC, RRD), pp. 449–460.
LATA-2008-ArrighiNW #automaton #bound #finite #quantum: One-Dimensional Quantum Cellular Automata over Finite, Unbounded Configurations (PA, VN, RFW), pp. 64–75.
LATA-2008-KrassovitskiyRV: Further Results on Insertion-Deletion Systems with One-Sided Contexts (AK, YR, SV), pp. 333–344.
LATA-2008-Petersen #sorting #turing machine: Sorting and Element Distinctness on One-Way Turing Machines (HP), pp. 433–439.
CHI-2008-KarlsonB #legacy: One-handed touchscreen input for legacy applications (AKK, BBB), pp. 1399–1408.
CHI-2008-MoscovichH #multi #using: Indirect mappings of multi-touch input using one and two hands (TM, JFH), pp. 1275–1284.
CSCW-2008-ReillyMWI #using: Small details: using one device to navigate together (DFR, BM, CRW, KMI), pp. 253–256.
SIGAda-2008-McCormick08a #ada #case study #education #experience #re-engineering: Ada and software engineering education: one professor’s experiences (JWM), pp. 91–96.
ICML-2008-BiggsGV #matrix: Nonnegative matrix factorization via rank-one downdate (MB, AG, SAV), pp. 64–71.
ICML-2008-CrammerTP #clustering: A rate-distortion one-class model and its applications to clustering (KC, PPT, FCNP), pp. 184–191.
ICML-2008-FrancLM #fault: Stopping conditions for exact computation of leave-one-out error in support vector machines (VF, PL, KRM), pp. 328–335.
ICPR-2008-BelleDS #detection #random #realtime #recognition: Randomized trees for real-time one-step face detection and recognition (VB, TD, SS), pp. 1–4.
ICPR-2008-TanHL #orthogonal #recognition: Face recognition based on LBP and orthogonal rank-one tensor projections (NT, LH, CL), pp. 1–4.
ICPR-2008-ZhangCZJ #2d #3d #framework: 2D and 3D upper body tracking with one framework (LZ, JC, ZZ, QJ), pp. 1–4.
KDD-2008-BhattacharyaGJ #categorisation #documentation #identification: Structured entity identification and document categorization: two tasks with one joint model (IB, SG, SJ), pp. 25–33.
KR-2008-ChenJL: Computing Loops with at Most One External Support Rule (XC, JJ, FL), pp. 401–410.
SIGIR-2008-OkamotoKY #empirical #video: One-button search extracts wider interests: an empirical study with video bookmarking search (MO, MK, TY), pp. 779–780.
LICS-2008-BaierBBBG #automaton #infinity #model checking: Almost-Sure Model Checking of Infinite Paths in One-Clock Timed Automata (CB, NB, PB, TB, MG), pp. 217–226.
RTA-2008-UrbanZ #proving: Revisiting Cut-Elimination: One Difficult Proof Is Really a Proof (CU, BZ), pp. 409–424.
CASE-2007-ChanYD #clustering #multi #on the #scheduling #tool support: On the Optimality of One-Unit Cycle Scheduling of Multi-Cluster Tools with Single-Blade Robots (WKC, JY, SD), pp. 392–397.
DATE-2007-Gordon-RossVVNB #configuration management #energy #performance: A one-shot configurable-cache tuner for improved energy and performance (AGR, PV, FV, WAN, EB), pp. 755–760.
HT-2007-schraefel #question #semantics #web #what #why: What is an analogue for the semantic web and why is having one important? (MMCS), pp. 123–132.
SIGMOD-2007-LiuMQYRWLHZ #development #evaluation #named #scalability: AllInOneNews: development and evaluation of a large-scale news metasearch engine (KLL, WM, JQ, CTY, VVR, ZW, YL, HH, HZ), pp. 1017–1028.
FoSSaCS-2007-BouyerLM #automaton #model checking: Model-Checking One-Clock Priced Timed Automata (PB, KGL, NM), pp. 108–122.
TACAS-2007-JurdzinskiLS #automaton #model checking #probability: Model Checking Probabilistic Timed Automata with One or Two Clocks (MJ, FL, JS), pp. 170–184.
STOC-2007-GavinskyKKRW #communication #complexity #encryption #exponential #quantum: Exponential separations for one-way quantum communication complexity, with applications to cryptography (DG, JK, IK, RR, RdW), pp. 516–525.
STOC-2007-GilbertSTV #algorithm #performance #sketching: One sketch for all: fast algorithms for compressed sensing (ACG, MJS, JAT, RV), pp. 237–246.
STOC-2007-HaitnerR #statistics: Statistically-hiding commitment from any one-way function (IH, OR), pp. 1–10.
STOC-2007-SinghL #approximate #bound: Approximating minimum bounded degree spanning trees to within one of optimal (MS, LCL), pp. 661–670.
ICALP-2007-IwamaNRY #bound #communication #complexity #quantum: Unbounded-Error One-Way Classical and Quantum Communication Complexity (KI, HN, RR, SY), pp. 110–121.
LATA-2007-HanW #regular expression: Generalizations of One-Deterministic Regular Languages (YSH, DW), pp. 273–284.
CHI-2007-HancockCC #3d #design #evaluation #interactive: Shallow-depth 3d interaction: design and evaluation of one-, two- and three-touch techniques (MSH, MSTC, AC), pp. 1147–1156.
HCI-IPT-2007-BartneckAK #interface #rating: Hit Me Baby One More Time: A Haptic Rating Interface (CB, PA, TK), pp. 743–747.
HCI-MIE-2007-GratchWOLMWM #question: Can Virtual Humans Be More Engaging Than Real Ones? (JG, NW, AO, FL, MM, RJvdW, LPM), pp. 286–297.
ICEIS-AIDSS-2007-Bussler #architecture: Service-oriented architecture — one size fits nobody (CB), pp. 15–20.
ICEIS-DISI-2007-Bussler #architecture: Service-oriented architecture — one size fits nobody (CB), pp. 15–20.
ICEIS-DISI-2007-CarreiraGPW #data transformation #execution #optimisation: One-to-many data transformation operations — optimization and execution on an RDBMS (PJFC, HG, JLMP, AW), pp. 21–27.
ICEIS-EIS-2007-Bussler #architecture: Service-oriented architecture — one size fits nobody (CB), pp. 15–20.
ICEIS-HCI-2007-Bussler #architecture: Service-oriented architecture — one size fits nobody (CB), pp. 15–20.
ICEIS-J-2007-Bussler07a #architecture: Service-Oriented Architecture: One Size Fits Nobody (CB), pp. 55–62.
ICEIS-J-2007-CarreiraGPW07a #on the #relational: On Handling One-to-Many Transformations in Relational Systems (PC, HG, JLMP, AW), pp. 121–134.
ICEIS-SAIC-2007-Bussler #architecture: Service-oriented architecture — one size fits nobody (CB), pp. 15–20.
ICML-2007-KropotovV #learning #on the: On one method of non-diagonal regularization in sparse Bayesian learning (DK, DV), pp. 457–464.
KDD-2007-Sculley #feedback #learning: Practical learning from one-sided feedback (DS), pp. 609–618.
MLDM-2007-SilvaGF #identification: One Lead ECG Based Personal Identification with Feature Subspace Ensembles (HS, HG, ALNF), pp. 770–783.
CGO-2007-PouchetBCV #optimisation: Iterative Optimization in the Polyhedral Model: Part I, One-Dimensional Time (LNP, CB, AC, NV), pp. 144–156.
PPoPP-2007-MamidalaNVSP #on the #performance #scalability #trade-off #using: On using connection-oriented vs. connection-less transport for performance and scalability of collective and one-sided operations: trade-offs and impact (ARM, SN, AV, GS, DKP), pp. 46–54.
DRR-2006-ChenS #2d #recognition #verification: Combining one- and two-dimensional signal recognition approaches to off-line signature verification (SC, SNS).
VLDB-2006-MoerkotteN #algorithm #analysis #generative #programming: Analysis of Two Existing and One New Dynamic Programming Algorithm for the Generation of Optimal Bushy Join Trees without Cross Products (GM, TN), pp. 930–941.
ITiCSE-2006-BiancoT: One step further the ACM K-12 final report: a proposal for level 1: computer organization for K-8 (GMB, ST), pp. 207–211.
ITiCSE-2006-GharibyanG #case study #gender: Gender gap in computer science does not exist in one former soviet republic: results of a study (HG, SG), pp. 222–226.
FoSSaCS-2006-Serre #game studies #graph #process: Parity Games Played on Transition Graphs of One-Counter Processes (OS), pp. 337–351.
STOC-2006-AkaviaGGM #np-hard #on the: On basing one-way functions on NP-hardness (AA, OG, SG, DM), pp. 701–710.
ICALP-v1-2006-FortnowHPVW #complexity: Extracting Kolmogorov Complexity with Applications to Dimension Zero-One Laws (LF, JMH, AP, NVV, FW), pp. 335–345.
ICALP-v2-2006-DanosKP #quantum: The One Way to Quantum Computation (VD, EK, PP), pp. 13–21.
ICALP-v2-2006-HaitnerHR #generative #performance #pseudo: Efficient Pseudorandom Generators from Exponentially Hard One-Way Functions (IH, DH, OR), pp. 228–239.
ICALP-v2-2006-MicciancioP #encryption #multi: Corrupting One vs. Corrupting Many: The Case of Broadcast and Multicast Encryption (DM, SP), pp. 70–82.
CHI-2006-HinckleyGBSAC #multi: The springboard: multiple modes in one spring-loaded control (KH, FG, PB, RS, MA, EC), pp. 181–190.
CSCW-2006-YankelovichKPWD #question: Improving audio conferencing: are two ears better than one? (NY, JK, JP, MW, JMD), pp. 333–342.
AdaEurope-2006-BreuerP #fault #kernel #linux #source code #static analysis: One Million (LOC) and Counting: Static Analysis for Errors and Vulnerabilities in the Linux Kernel Source Code (PTB, SP), pp. 56–70.
CIKM-2006-JiangLH #algorithm #performance #xml: An efficient one-phase holistic twig join algorithm for XML data (ZJ, CL, WCH), pp. 786–787.
ICML-2006-ZhengW #lazy evaluation #performance: Efficient lazy elimination for averaged one-dependence estimators (FZ, GIW), pp. 1113–1120.
ICPR-v1-2006-ShanLC #image #recognition #robust: Face Recognition Robust to Head Pose from One Sample Image (TS, BCL, SC), pp. 515–518.
ICPR-v2-2006-IlonenPKK #classification: Gaussian mixture pdf in one-class classification: computing and utilizing confidence values (JI, PP, JKK, HK), pp. 577–580.
ICPR-v2-2006-MozaffarifF #online #recognition: One Dimensional Fractal Coder for Online Signature Recognition (SM, KF, FF), pp. 857–860.
ICPR-v3-2006-EscaleraP #named #novel: ECOC-ONE: A Novel Coding and Decoding Strategy (SE, OP), pp. 578–581.
ICPR-v4-2006-HocquetRC #estimation #parametricity #problem: Estimation of User Specific Parameters in One-class Problems (SH, JYR, HC), pp. 449–452.
ICPR-v4-2006-LuC #3d: Accurate 3D Scanning of Swaying Human Body Parts by One Projection Based on OIMP Technique (CL, GC), pp. 1–4.
KDD-2006-Kahn #problem #statistics: Capital One’s statistical problems: our top ten list (WK), p. 834.
SIGIR-2006-LiuO #effectiveness #metric #retrieval #speech: One-sided measures for evaluating ranked retrieval effectiveness with spontaneous conversational speech (BL, DWO), pp. 673–674.
SIGIR-2006-Sakai06a #documentation: Give me just one highly relevant document: P-measure (TS), pp. 695–696.
PPDP-2006-GabbayM #logic: One-and-a-halfth-order logic (MG, AM), pp. 189–200.
CSL-2006-DurandO #first-order #query: First-Order Queries over One Unary Function (AD, FO), pp. 334–348.
ICDAR-2005-KanounAL #approach #recognition #validation #word: Affixal Approach for Arabic Decomposable Vocabulary Recognition: A Validation on Printed Word in Only One Font (SK, AMA, YL), pp. 1025–1029.
ICDAR-2005-LongJ #hybrid #recognition: Hybrid Recognition for One Stroke Style Cursive Handwriting Characters (TL, LJ), pp. 232–236.
SIGMOD-2005-OzcanCPKBJZ #relational #xml: System RX: One Part Relational, One Part XML (KSB, RC, VJ, JK, GL, GML, RL, FÖ, HP, NS, TCT, BVdL, BV, CZ), pp. 347–358.
VLDB-2005-KarrasM #metric: One-Pass Wavelet Synopses for Maximum-Error Metrics (PK, NM), pp. 421–432.
STOC-2005-MortensenPP #on the: On dynamic range reporting in one dimension (CWM, RP, MP), pp. 104–111.
ICALP-2005-CrescenzoK #communication: Asynchronous Perfectly Secure Communication over One-Time Pads (GDC, AK), pp. 216–227.
CHI-2005-KarlsonBS #design: AppLens and launchTile: two designs for one-handed thumb use on small devices (AKK, BBB, JS), pp. 201–210.
ICML-2005-GuptaG #clustering #hybrid #robust #using: Robust one-class clustering using hybrid global and local search (GG, JG), pp. 273–280.
MoDELS-2005-Tolvanen #modelling: Keynote Address II: Domain-Specific Modeling: No One Size Fits All (JPT), p. 279.
MoDELS-2005-Tolvanen #modelling: Keynote Address II: Domain-Specific Modeling: No One Size Fits All (JPT), p. 279.
LOPSTR-2005-GallagherPA #abstract domain #type system: Converting One Type-Based Abstract Domain to Another (JPG, GP, EA), pp. 147–162.
SAC-2005-Hosobe #constraints #documentation #layout #linear #web: Solving linear and one-way constraints for web document layout (HH), pp. 1252–1253.
ICSE-2005-PretschnerPWKBSZS #automation #evaluation #modelling #testing: One evaluation of model-based testing and its automation (AP, WP, SW, CK, MB, BS, RZ, TS), pp. 392–401.
RTA-2005-MoczydlowskiG #termination #thread: Termination of Single-Threaded One-Rule Semi-Thue Systems (WM, AG), pp. 338–352.
DATE-v2-2004-BranoverKG #design: Asynchronous Design By Conversion: Converting Synchronous Circuits into Asynchronous Ones (AB, RK, RG), pp. 870–877.
SIGMOD-2004-IpeirotisG #database #using: When one Sample is not Enough: Improving Text Database Selection Using Shrinkage (PGI, LG), pp. 767–778.
SIGMOD-2004-JagadishLSSW #xml: Colorful XML: One Hierarchy Isn’t Enough (HVJ, LVSL, MS, DS, NW), pp. 251–262.
FoSSaCS-2004-Kirsten #automaton #distance #problem: Distance Desert Automata and the Star Height One Problem (DK), pp. 257–272.
STOC-2004-AzarR #network: The zero-one principle for switching networks (YA, YR), pp. 64–71.
STOC-2004-Bar-YossefJK #communication #complexity #exponential #quantum: Exponential separation of quantum and classical one-way communication complexity (ZBY, TSJ, IK), pp. 128–137.
DLT-2004-AnselmoGM #2d #regular expression: Regular Expressions for Two-Dimensional Languages Over One-Letter Alphabet (MA, DG, MM), pp. 63–75.
ICALP-2004-AulettaPPP #power of #verification: The Power of Verification for One-Parameter Agents (VA, RDP, PP, GP), pp. 171–182.
CHI-2004-LyonsSPFLDL #mobile #type system: Twiddler typing: one-handed chording text entry for mobile phones (KL, TS, DP, JF, AL, AD, EWL), pp. 671–678.
CHI-2004-MullerGBWM #collaboration: One-hundred days in an activity-centric collaboration environment based on shared objects (MJM, WG, BB, EW, DRM), pp. 375–382.
ICEIS-v4-2004-MazhelisP #classification #detection: Combining One-Class Classifiers for Mobile-User Substitution Detection (OM, SP), pp. 130–137.
ECIR-2004-CachedaPO #analysis #architecture #distributed #performance: Performance Analysis of Distributed Architectures to Index One Terabyte of Text (FC, VP, IO), pp. 394–408.
ICML-2004-CrammerC #optimisation: A needle in a haystack: local one-class optimization (KC, GC).
ICML-2004-KoppelS #classification #problem #verification: Authorship verification as a one-class classification problem (MK, JS).
ICPR-v1-2004-ChenL #image #invariant #recognition: Illumination and Expression Invariant Face Recognition with One Sample Image (SC, BCL), pp. 300–303.
ICPR-v1-2004-LeL #image #markov #modelling #using: Recognizing Frontal Face Images Using Hidden Markov Models with One Training Image per Person (HSL, HL), pp. 318–321.
ICPR-v1-2004-WangA #composition #multi #representation #using: Compact Representation of Multidimensional Data Using Tensor Rank-One Decomposition (HW, NA), pp. 44–47.
ICPR-v3-2004-TaxM #classification: A Consistency-Based Model Selection for One-Class Classification (DMJT, KRM), pp. 363–366.
ICPR-v3-2004-YingK #evaluation #performance: Fast Leave-One-Out Evaluation and Improvement on Inference for LS-SVMs (ZY, KCK), pp. 494–497.
SAC-2004-Al-HoumailyC #commit #named #protocol: 1-2PC: the one-two phase atomic commit protocol (YJAH, PKC), pp. 684–691.
ICSE-2004-Rajan #integration: One More Step in the Direction of Modularized Integration Concerns (HR), pp. 36–38.
OSDI-2004-GummadiMGLW #internet #reliability: Improving the Reliability of Internet Paths with One-hop Source Routing (PKG, HVM, SDG, HML, DW), pp. 183–198.
ITiCSE-2003-Yehezkel #execution: Making program execution comprehensible one level above the machine language (CY), pp. 124–128.
ICEIS-v2-2003-KropotovV #approach #fuzzy: One Approach to Fuzzy Expert Systems Construction (DK, DV), pp. 566–570.
ICEIS-v3-2003-LopezMFL #adaptation #generative #people #towards #user interface: Towards Adaptive User Interface Generation: One Step Closer to People (VLJ, FMS, AFC, MDL), pp. 97–103.
ICEIS-v4-2003-SonneckM #graph #personalisation #using #web: One-To-One Personalization of Web Applications Using a Graph Based Model (GS, TAM), pp. 95–102.
RE-2003-ChardonD #approach #imperative #metric #process #requirements: One Approach to the Metric Baselining Imperative for Requirements Processes (RC, MD), p. 292.
CC-2003-Danvy #monad #normalisation: A New One-Pass Transformation into Monadic Normal Form (OD), pp. 77–89.
LICS-2003-GurevichS #higher-order #monad: Spectra of Monadic Second-Order Formulas with One Unary Function (YG, SS), pp. 291–300.
LICS-2003-PistoreV #infinity: The Planning Spectrum — One, Two, Three, Infinity (MP, MYV), pp. 234–243.
RTA-2003-Geser #string #termination: Termination of String Rewriting Rules That Have One Pair of Overlaps (AG), pp. 410–423.
DAC-2002-LekatsasHJ #design #embedded #hardware #performance: Design of an one-cycle decompression hardware for performance increase in embedded systems (HL, JH, VJ), pp. 34–39.
SIGMOD-2002-GarofalakisGR #data type #mining #query #tutorial: Querying and mining data streams: you only get one look a tutorial (MNG, JG, RR), p. 635.
VLDB-2002-GarofalakisG #data type #mining #query: Querying and Mining Data Streams: You Only Get One Look (MNG, JG).
VLDB-2002-LeeWMS #algorithm #multi: A One-Pass Aggregation Algorithm with the Optimal Buffer Size in Multidimensional OLAP (YKL, KYW, YSM, IYS), pp. 790–801.
FoSSaCS-2002-DanvyN #continuation #first-order: A First-Order One-Pass CPS Transformation (OD, LRN), pp. 98–113.
FoSSaCS-2002-JancarKMS #automaton #bound #proving: Equivalence-Checking with One-Counter Automata: A Generic Method for Proving Lower Bounds (PJ, AK, FM, ZS), pp. 172–186.
ICALP-2002-KuskeL #formal method #monad #on the: On the Theory of One-Step Rewriting in Trace Monoids (DK, ML), pp. 752–763.
ICALP-2002-OstlinP: One-Probe Search (AÖ, RP), pp. 439–450.
ICFP-2002-Hinze #array #flexibility: Bootstrapping one-sided flexible arrays (RH), pp. 2–13.
CHI-2002-HudsonCKE #quote #research: “I’d be overwhelmed, but it’s just one more thing to do”: availability and interruption in research management (JMH, JC, WAK, TE), pp. 97–104.
ICML-2002-DzeroskiZ #classification: Is Combining Classifiers Better than Selecting the Best One (SD, BZ), pp. 123–130.
ICPR-v1-2002-MakhervaksBB #image #representation #visual notation: Image Flows and One-Liner Graphical Image Representation (VM, GB, AMB), pp. 640–643.
ICPR-v2-2002-ErcilB #classification #polynomial #using: One Class Classification Using Implicit Polynomial Surface Fitting (AE, BB), pp. 152–155.
ICPR-v2-2002-LacombeKAB #approach: A Variational Approach to One Dimensional Phase Unwrapping (CL, PK, GA, LBF), p. 810–?.
ICPR-v3-2002-MedioniP #3d #generative: Generation of a 3-D Face Model from One Camera (GGM, BP), pp. 667–671.
ICPR-v3-2002-SongCLC02a #image #recognition: Graphics Recognition from Binary Images: One Step or Two Steps (JS, MC, MRL, SC), pp. 135–138.
ICSE-2002-BratthallGHJKMOZA #architecture #industrial: Integrating hundred’s of product through one architecture: the industrial IT architecture (LB, RvdG, HH, EJ, ZK, RM, MO, CZ, JSA), pp. 604–614.
LICS-2002-EdalatL #calculus #difference: Domain Theory and Differential Calculus (Functions of one Variable) (AE, AL), pp. 277–286.
RTA-2002-Geser #string: Loops of Superexponential Lengths in One-Rule String Rewriting (AG), pp. 267–280.
DAC-2001-Zeijl #challenge: One-chip Bluetooth ASIC Challenges (PTMvZ), p. 262.
DATE-2001-HettichT #architecture #challenge: Vehicle electric/electronic architecture — one of the most important challenges for OEM’s (GH, TT), pp. 112–113.
DATE-2001-LockCM #framework #programmable #question: The programmable platform: does one size fit all? (AL, RC, HM), pp. 226–227.
VLDB-2001-GilbertKMS #approximate #query #summary: Surfing Wavelets on Streams: One-Pass Summaries for Approximate Aggregate Queries (ACG, YK, SM, MS), pp. 79–88.
STOC-2001-AlstrupBR: Optimal static range reporting in one dimension (SA, GSB, TR), pp. 476–482.
STOC-2001-AmbainisBNVW #quantum: One-dimensional quantum walks (AA, EB, AN, AV, JW), pp. 37–49.
STOC-2001-GartnerSTWV: One line and n points (BG, JS, FT, EW, PV), pp. 306–315.
DLT-2001-Cachat #power of: The Power of One-Letter Rational Languages (TC), pp. 145–154.
ICALP-2001-ComonCM #automaton #constraints #memory management #protocol #set: Tree Automata with One Memory, Set Constraints, and Ping-Pong Protocols (HC, VC, JM), pp. 682–693.
ICSE-2001-Shepard #performance #set #source code: An Efficient Set of Software Degree Programs for One Domain (TS), pp. 623–632.
RTA-2001-VestergaardB #confluence #first-order #proving #using #λ-calculus: A Formalised First-Order Confluence Proof for the λ-Calculus Using One-Sorted Variable Names (RV, JB), pp. 306–321.
DAC-2000-LevySMW #analysis #performance: A rank-one update method for efficient processing of interconnect parasitics in timing analysis (HL, WS, DM, JW), pp. 75–78.
DAC-2000-MacchiaruloM: Wave-steering one-hot encoded FSMs (LM, MMS), pp. 357–360.
STOC-2000-Klauck #communication #on the #probability #protocol #quantum: On quantum and probabilistic communication: Las Vegas and one-way protocols (HK), pp. 644–651.
ICALP-2000-AielloBOR #performance #proving #verification: Fast Verification of Any Remote Procedure Call: Short Witness-Indistinguishable One-Round Proofs for NP (WA, SNB, RO, SR), pp. 463–474.
ICALP-2000-CachinCKM #mobile: One-Round Secure Computation and Secure Autonomous Mobile Agents (CC, JC, JK, JM), pp. 512–523.
ICALP-2000-Kucera #algorithm #performance #process #verification: Efficient Verification Algorithms for One-Counter Processes (AK), pp. 317–328.
WLC-2000-KoshibaH #consistency: A Note on Finding One-Variable Patterns Consistent with Examples and Counterexamples (TK, KH), pp. 253–265.
ICML-2000-KaynakA #classification #multi: MultiStage Cascading of Multiple Classifiers: One Man’s Noise is Another Man’s Data (CK, EA), pp. 455–462.
ICPR-v1-2000-KampkeES #estimation #image #network #using: Estimation of Superresolution Images Using Causal Networks: The One-Dimensional Case (TK, AE, CS), pp. 1584–1587.
ICPR-v4-2000-SmithSL #monitoring: Monitoring Head/Eye Motion for Driver Alertness with One Camera (PS, MS, NdVL), pp. 4636–4635.
KR-2000-FargierLM #logic: Propositional Logic and One-Stage Decision Making (HF, JL, PM), pp. 445–456.
SAC-2000-HaffnerREM #documentation #modelling #predict: Modeling of Time and Document Aging for Request Prediction — One Step Further (EGH, UR, TE, CM), pp. 984–990.
CSL-2000-BlassG00a #polynomial: Choiceless Polynomial Time Computation and the Zero-One Law (AB, YG), pp. 18–40.
DATE-1999-RayaneVN #detection #embedded: A One-Bit-Signature BIST for Embedded Operational Amplifiers in Mixed-Signal Circuits Based on the Slew-Rate Detection (IR, JVM, MN), p. 792–?.
VLDB-1999-CeriFP #data-driven #generative #web: Data-Driven, One-To-One Web Site Generation for Data-Intensive Applications (SC, PF, SP), pp. 615–626.
VLDB-1999-Pound: In Cyber Space No One can Hear You Scream (CP), pp. 207–210.
STOC-1999-BeimelIKM #information retrieval: One-Way Functions Are Essential for Single-Server Private Information Retrieval (AB, YI, EK, TM), pp. 89–98.
STOC-1999-CrescenzoI: Security-Preserving Hardness-Amplification for Any Regular One-Way Function (GDC, RI), pp. 169–178.
FM-v2-1999-OcicaI #algebra #aspect-oriented #corba #syntax: Algebraic Aspects of the Mapping between Abstract Syntax Notation One and CORBA IDL (RO, DI), p. 1863.
HCI-CCAD-1999-Reijonen: When one is more than twenty one (PR), pp. 558–562.
CSL-1999-Stewart #array #quantifier: Program Schemes, Arrays, Lindström Quantifiers and Zero-One Laws (IAS), pp. 374–388.
RTA-1999-CaronSTT #quantifier #satisfiability: Deciding the Satisfiability of Quantifier free Formulae on One-Step Rewriting (ACC, FS, ST, MT), pp. 103–117.
RTA-1999-LimetR #decidability: A New Result about the Decidability of the Existential One-Step Rewriting Theory (SL, PR), pp. 118–132.
SIGMOD-1998-RajagopalanML #approximate #memory management: Approximate Medians and other Quantiles in One Pass and with Limited Memory (GSM, SR, BGL), pp. 426–435.
TACAS-1998-AjamiHI #linear #logic #model checking #symmetry: Exploiting Symmetry in Linear Time Temporal Logic Model Checking: One Step Beyond (KA, SH, JMI), pp. 52–67.
STOC-1998-BeigelH: One Help Bit Doesn’t Help (RB, TH), pp. 124–130.
STOC-1998-CanettiMR #probability: Perfectly One-Way Probabilistic Hash Functions (Preliminary Version) (RC, DM, OR), pp. 131–140.
STOC-1998-TherienW #quantifier #word: Over Words, Two Variables Are as Powerful as One Quantifier Alternation (DT, TW), pp. 234–240.
ICALP-1998-Wigderson #algorithm #probability #question: Do Probabilistic Algorithms Outperform Deterministic Ones? (AW), pp. 212–214.
CHI-1998-NassKL #comparison #interface: When My Face Is the Interface: An Experimental Comparison of Interacting With One’s Own Face or Someone Else’s Face (CN, EYK, EJL), pp. 148–154.
ICPR-1998-BouletreauVSE #identifier #question: Handwriting and signature: one or two personality identifiers? (VB, NV, RS, HE), pp. 1758–1760.
HPDC-1998-NieplochaFD: Distant I/O: One-Sided Access to Secondary Storage on Remote Processors (JN, ITF, HD), pp. 148–154.
ISMM-1998-RothW: One-Bit Counts between Unique and Sticky (DJR, DSW), pp. 49–56.
RTA-1998-DegtyarevGNVV #decidability: The Decidability of Simultaneous Rigid E-Unification with One Variable (AD, YG, PN, MV, AV), pp. 181–195.
VLDB-1997-AlsabtiRS #algorithm: A One-Pass Algorithm for Accurately Estimating Quantiles for Disk-Resident Data (KA, SR, VS), pp. 346–355.
PLDI-1997-SperberT #compilation #partial evaluation: Two for the Price of One: Composing Partial Evaluation and Compilation (MS, PT), pp. 215–225.
DLT-1997-BuchholzK #bound #on the #power of: On the power of one-way bounded cellular time computers (TB, MK), pp. 365–375.
DLT-1997-WatanabeT #attribute grammar #evaluation #using: An Attribute Evaluation of One-Pass Attribute Grammars Using Value Estimate (YW, TT), pp. 155–165.
ICALP-1997-Jancar #bisimulation #decidability #equivalence #process: Bisimulation Equivalence is Decidable for One-Counter Processes (PJ), pp. 549–559.
IFL-1997-Erwig #graph #persistent #question: Fully Persistent Graphs — Which One To Choose? (ME), pp. 123–140.
ICML-1997-KubatM #set: Addressing the Curse of Imbalanced Training Sets: One-Sided Selection (MK, SM), pp. 179–186.
OOPSLA-1997-HudsonMMM #garbage collection: Garbage Collecting the World: One Car at a Time (RLH, RM, JEBM, DSM), pp. 162–175.
ICSE-1997-BasiliM #experience #how #tutorial: The Experience Factory: How to Build and Run One (Tutorial) (VRB, FEM), pp. 643–644.
CADE-1997-NiehrenPR #constraints #finite #on the #similarity #unification: On Equality Up-to Constraints over Finite Trees, Context Unification, and One-Step Rewriting (JN, MP, PR), pp. 34–48.
RTA-1997-Marcinkowski #first-order: Undecidability of the First Order Theory of One-Step Right Ground Rewriting (JM), pp. 241–253.
RTA-1997-Vorobyov #decidability #first-order #linear: The First-Order Theory of One Step Rewriting in Linear Noetherian Systems is Undecidable (SGV), pp. 254–268.
PLDI-1996-BruggemanWD #continuation #representation: Representing Control in the Presence of One-Shot Continuations (CB, OW, RKD), pp. 99–107.
STOC-1996-NewmanS #communication #game studies: Public vs. Private Coin Flips in One Round Communication Games (Extended Abstract) (IN, MS), pp. 561–570.
ICML-1996-KahaviW #bias #composition: Bias Plus Variance Decomposition for Zero-One Loss Functions (RK, DW), pp. 275–283.
ICPR-1996-MurshedBS #approach #classification #detection #fuzzy #problem: A fuzzy ARTMAP-based classification system for detecting cancerous cells, based on the one-class problem approach (NAM, FB, RS), pp. 478–482.
ICPR-1996-ProesmansGO #3d: One-shot active 3D shape acquisition (MP, LJVG, AO), pp. 336–340.
ICPR-1996-TianT #image: Shape from shading for non-Lambertian surfaces from one color image (YlT, HTT), pp. 258–262.
ICPR-1996-ZhangW #algorithm #parallel: A parallel thinning algorithm with two-subiteration that generates one-pixel-wide skeletons (EYYZ, PSPW), pp. 457–461.
KDD-1996-UrpaniWS #induction #named: RITIO — Rule Induction Two In One (DU, XW, JS), pp. 339–342.
KR-1996-Rychtyckyj #evaluation #industrial #named: DLMS: An Evaluation of KL-ONE in the Automobile Industry (NR), pp. 588–596.
SIGIR-1996-LiuLYR #2d #memory management #performance #proximity #query: Efficient Processing of One and Two Dimensional Proximity Queries in Associative Memory (KLL, GJL, CTY, NR), pp. 138–146.
ECOOP-1996-RinatM #morphism #polymorphism #reuse: Metaphoric Polymorphism: Taking Code Reuse One Step Further (RR, MM), pp. 449–471.
CC-1996-ProebstingW #parsing: One-Pass, Optimal Tree Parsing — With Or Without Trees (TAP, BRW), pp. 294–308.
LICS-1996-HirstH #complexity #recursion: More About Recursive Structures: Descriptive Complexity and Zero-One Laws (TH, DH), pp. 334–347.
LICS-1996-McColm #graph #random: Zero-One Laws for Gilbert Random Graphs (GLM), pp. 360–369.
RTA-1996-Senizergues #on the #problem #termination: On the Termination Problem for One-Rule Semi-Thue System (GS), pp. 302–316.
RTA-1996-Treinen #decidability #first-order: The First-Order Theory of One-Step Rewriting is Undecidable (RT), pp. 276–286.
SIGMOD-1995-French #architecture #database: “One Size Fits All” Database Architectures Do Not Work for DDS (CDF), pp. 449–450.
STOC-1995-KremerNR #communication #complexity #on the #random: On randomized one-round communication complexity (IK, NN, DR), pp. 596–605.
STOC-1995-MansourP: Many-to-one packet routing on grids (Extended Abstract) (YM, BPS), pp. 258–267.
DLT-1995-CattaneoFM #automaton: Rule Space Transformations and One-Dimensional Cellular Automata (GC, EF, GM), pp. 409–419.
DLT-1995-KutribR #automaton #realtime: Real-Time One-Way Pushdown Cellular Automata Languages (MK, JR), pp. 420–429.
CIKM-1995-Tammet #using: Using Resolution for Extending KL-ONE-type Languages (TT), pp. 326–332.
SIGIR-1995-Church #question: One Term Or Two? (KWC), pp. 310–318.
IWMM-1995-ArmstrongV #garbage collection #realtime: One Pass Real-Time Generational Mark-Sweep Garbage Collection (JLA, RV), pp. 313–322.
RTA-1995-ChenA #commutative #named: STORM: A MAny-to-One Associative-Commutative Matcher (TC, SA), pp. 414–419.
TRI-Ada-1994-BarbaschE #ada #debugging: Always One More Bug: Applying AdaWise to Improve Ada Code (CB, DE), pp. 228–235.
ICML-1994-Elomaa #learning: In Defense of C4.5: Notes Learning One-Level Decision Trees (TE), pp. 62–69.
SAC-1994-GordonBW #algorithm #performance #problem #search-based: A note on the performance of genetic algorithms on zero-one knapsack problems (VSG, APWB, DW), pp. 194–195.
SAC-1994-KhuriBH #algorithm #multi #problem #search-based: The zero/one multiple knapsack problem and genetic algorithms (SK, TB, JH), pp. 188–193.
STOC-1993-JiangL #string: k one-way heads cannot do string-matching (TJ, ML), pp. 62–70.
STOC-1993-RaviMRRH #algorithm #approximate #multi: Many birds with one stone: multi-objective approximation algorithms (RR, MVM, SSR, DJR, HBHI), pp. 438–447.
DLT-1993-PaunRS: Contextual Grammars: Erasing, Determinism, One-Side Contexts (GP, GR, AS), pp. 370–388.
ICALP-1993-Ablayev #bound #communication #complexity #probability: Lower Bounds for One-way Probabilistic Communication Complexity (FMA), pp. 241–252.
INTERCHI-1993-GaverSHL #multi: One is not enough: multiple views in a media space (WWG, AS, CH, PL), pp. 335–341.
INTERCHI-1993-MatiasMB #named: Half-QWERTY: a one-handed keyboard facilitating skill transfer from QWERTY (EM, ISM, WB), pp. 88–94.
CAV-1993-Peled #model checking #using: All from One, One for All: on Model Checking Using Representatives (DP), pp. 409–423.
ILPS-1993-DevienneLR #decidability #horn clause #problem #recursion: The Emptiness Problem of One Binary Recursive Horn Clause is Undecidable (PD, PL, JCR), pp. 250–265.
DAC-1992-ChenF #algorithm #logic #optimisation #performance #set: Efficient Sum-to-One Subsets Algorithm for Logic Optimization (KCC, MF), pp. 443–448.
STOC-1992-Beigel: When Do Extra Majority Gates Help? Polylog(n) Majority Gates Are Equivalent to One (RB), pp. 450–454.
STOC-1992-FeigeL92a #problem #proving: Two-Prover One-Round Proof Systems: Their Power and Their Problems (Extended Abstract) (UF, LL), pp. 733–744.
ICALP-1992-SantisPY #bound #proving #statistics #verification: One-Message Statistical Zero-Knowledge Proofs and Space-Bounded Verifier (ADS, GP, MY), pp. 28–40.
CHI-1992-PauschVC #case study: One dimensional motion tailoring for the disabled: a user study (RFP, LV, MC), pp. 405–411.
ML-1992-IbaL #induction: Induction of One-Level Decision Trees (WI, PL), pp. 233–240.
CADE-1992-VershininR #logic #nondeterminism: One More Logic with Uncertainty and Resolution Principle for it (KV, IR), pp. 663–667.
LICS-1992-HalpernK #logic: Zero-One Laws for Modal Logic (JYH, BMK), pp. 369–380.
PLDI-1991-Launchbury #analysis #strict: Strictness and Binding-Time Analyses: Two for the Price of One (JL), pp. 80–91.
CSL-1991-Mundici #logic #normalisation: Normal Forms in Infinite-Valued Logic: The Case of One Variable (DM), pp. 272–277.
STOC-1990-Rompel: One-Way Functions are Necessary and Sufficient for Secure Signatures (JR), pp. 387–394.
WAGA-1990-KleinK #compilation #parallel: Parallel One-Pass Compilation (EK, KK), pp. 76–90.
STOC-1989-ChorK #privacy: A Zero-One Law for Boolean Privacy (extended abstract) (BC, EK), pp. 62–72.
STOC-1989-GoldreichL: A Hard-Core Predicate for all One-Way Functions (OG, LAL), pp. 25–32.
STOC-1989-ImpagliazzoLL #generative #pseudo: Pseudo-random Generation from one-way functions (Extended Abstracts) (RI, LAL, ML), pp. 12–24.
STOC-1989-ImpagliazzoR #permutation: Limits on the Provable Consequences of One-Way Permutations (RI, SR), pp. 44–61.
STOC-1989-NaorY #encryption: Universal One-Way Hash Functions and their Cryptographic Applications (MN, MY), pp. 33–43.
ICALP-1989-MehlhornP #source code: Two Versus One Index Register and Modifiable Versus Non-modifiable Programs (KM, WJP), pp. 603–609.
KR-1989-Schmidt-Schauss #decidability: Subsumption in KL-ONE is Undecidable (MSS), pp. 421–431.
ML-1989-SarrettP #algorithm #empirical #learning: One-Sided Algorithms for Integrating Empirical and Explanation-Based Learning (WS, MJP), pp. 26–28.
RTA-1989-Pedersen #monad: Morphocompletion for One-Relation Monoids (JP), pp. 574–578.
ICALP-1988-DietzfelbingerM #complexity #matrix #turing machine: The Complexity of Matrix Transposition on One-Tape Off-Line Turing Machines with Output Tape (MD, WM), pp. 188–200.
LICS-1988-BohmP #calculus: Characterizing X-Separability and One-Side Invertibility in λ-β-Ω-Calculus (CB, AP), pp. 91–101.
DAC-1987-RoylePVNS #geometry: Geometrical Compaction in One Dimension for Channel Routing (JR, MP, HV, NN, JS), pp. 140–145.
PODS-1987-Naughton #recursion: One-Sided Recursions (JFN), pp. 340–348.
STOC-1987-MaassSS #turing machine: Two Tapes Are Better than One for Off-Line Turing Machines (WM, GS, ES), pp. 94–100.
ICALP-1987-IbarraJ #array #on the #power of: On the Computing Power of One-Way Cellular Arrays (OHI, TJ), pp. 550–562.
PODS-1986-BiskupBSK: One Flavor Assumption and Gamma-Acyclicity for Universal Relation Views (JB, HHB, LS, MK), pp. 148–159.
STOC-1986-Cai #polynomial #probability #random: With Probability One, A Random Oracle Separates PSPACE from the Polynomial-Time Hierarchy (JyC), pp. 21–29.
STOC-1986-GalilKS #graph #nondeterminism #on the #simulation #turing machine: On Nontrivial Separators for k-Page Graphs and Simulations by Nondeterministic One-Tape Turing Machines (ZG, RK, ES), pp. 39–49.
STOC-1986-KoLD #morphism #polynomial: A Note on One-Way Functions and Polynomial-Time Isomorphisms (Extended Abstract) (KIK, TJL, DZD), pp. 295–303.
CSCW-1986-StaszB: Computer-supported cooperative work: examples and issues in one federal agency (CS, TKB), pp. 318–324.
DAC-1985-HennionSC #algorithm #generative: A new algorithm for third generation circuit simulators: the one-step relaxation method (BH, PS, DC), pp. 137–143.
DAC-1985-SongC #algorithm: An algorithm for one and half layer channel routing (JNS, YKC), pp. 131–136.
SIGMOD-1985-YuC #adaptation #design #information management #query: Adaptive Information System Design: One Query at a Time (CTY, CHC), pp. 280–290.
STOC-1985-FichHRW #bound #infinity #parallel: One, Two, Three … Infinity: Lower Bounds for Parallel Computation (FEF, FMadH, PR, AW), pp. 48–58.
STOC-1985-Levin #generative #pseudo: One-Way Functions and Pseudorandom Generators (LAL), pp. 363–365.
ICALP-1985-Chrobak #automaton #multi: Hierarchies of One-Way Multihead Automata Languages (MC), pp. 101–110.
SIGIR-1985-DAmoreM #theory and practice: One-Time Complete Indexing of Text: Theory and Practice (RJD, CPM), pp. 155–164.
POPL-1985-Lamport #concurrent #specification #what #why: What It Means for a Concurrent Program to Satisfy a Specification: Why No One Has Specified Priority (LL), pp. 78–83.
RTA-1985-ArnborgT #problem #unification: Unification Problems with One-Sided Distributivity (SA, ET), pp. 398–406.
RTA-1985-PurdomB #algorithm #performance: Fast Many-to-One Matching Algorithms (PWPJ, CAB), pp. 407–416.
SCC-1984-Koskimies #analysis #semantics #specification: A specification language for one-pass semantic analysis (KK), pp. 179–189.
STOC-1984-GoldbergM #on the #problem: On Finding the Exact Solution of a Zero-One Knapsack Problem (AVG, AMS), pp. 359–368.
STOC-1984-Maass #bound #nondeterminism #polynomial #turing machine: Quadratic Lower Bounds for Deterministic and Nondeterministic One-Tape Turing Machines (Extended Abstract) (WM), pp. 401–408.
DAC-1983-Robinson #array #automation #layout: Automatic layout for gate arrays with one layer of metal (PR0), pp. 658–664.
PODS-1983-FischerLP #distributed #process: Impossibility of Distributed Consensus with One Faulty Process (MJF, NAL, MP), pp. 1–7.
ICALP-1983-Vitanyi #on the #simulation: On the Simulation of Many Storage Heads by a Single One (Extended Abstract) (PMBV), pp. 687–694.
STOC-1982-DurisG #nondeterminism: Two Tapes are Better than One for Nondeterministic Machines (PD, ZG), pp. 1–7.
STOC-1982-Vitanyi #multi #realtime #simulation #turing machine: Real-Time Simulation of Multicounters by Oblivious One-Tape Turing Machines (PMBV), pp. 27–36.
DAC-1981-Lambert #design #physics: Graphics language / one — IBM Corporate-Wide physical design data format (DRL), pp. 713–719.
STOC-1981-DurisG #automaton: Fooling a Two-Way Automaton or One Pushdown Store Is Better Than One Counter for Two Way Machines (Preliminary Version) (PD, ZG), pp. 177–188.
ICALP-1981-ItzhaikY #equivalence #linear: A Decision Procedure for the Equivalence of Two DPDAs, One of Which is Linear (Extended Abstract) (YI, AY), pp. 229–237.
SIGIR-1981-Croft #documentation #modelling #retrieval: Incorporating Different Search Models into One Document Retrieval System (WBC), pp. 40–45.
ICALP-1980-EngelfrietF #attribute grammar #multi: Formal Properties of One-Visit and Multi-Pass Attribute Grammars (JE, GF), pp. 182–194.
STOC-1979-Long #on the #polynomial: On γ-Reducibility versus Polynomial Time Many-One Reducibility (Extended Abstract) (TJL), pp. 278–287.
ICALP-1979-Deussen #algorithm #parsing: One Abstract Accepting Algorithm for all Kinds of Parsers (PD), pp. 203–217.
DAC-1978-WilcoxRC #design #verification: Design rule verification based on one dimensional scans (PSW, HR, DMC), pp. 285–289.
ICSE-1978-CamposE #concurrent #design: Concurrent Software System Design, Supported by SARA at the Age of One (IMC, GE), pp. 230–242.
ICALP-1977-Simon #difference #on the: On the Difference Between One and Many (Preliminary Version) (JS), pp. 480–491.
STOC-1975-BoothL #algorithm #graph #linear: Linear Algorithms to Recognize Interval Graphs and Test for the Consecutive Ones Property (KSB, GSL), pp. 255–265.
ICALP-1972-Dubinsky #monad: The Functions Computed by a Monadic Program Schema with One Location (AD), pp. 521–535.
STOC-1971-Boasson #theorem: An Iteration Theorem for One-Counter Languages (LB), pp. 116–120.