286 papers:
- DATE-2015-ChenM #distributed #learning #manycore #optimisation #performance
- Distributed reinforcement learning for power limited many-core system performance optimization (ZC, DM), pp. 1521–1526.
- DATE-2015-KuhnPABR
- Spatial and temporal granularity limits of body biasing in UTBB-FDSOI (JMK, DP, HA, OB, WR), pp. 876–879.
- DATE-2015-ZhongLLZLZS #mobile #named
- nCode: limiting harmful writes to emerging mobile NVRAM through code swapping (KZ, DL, LL, XZ, WL, QZ, EHMS), pp. 1305–1310.
- HT-2015-SampsonMML #clustering #keyword #twitter
- Surpassing the Limit: Keyword Clustering to Improve Twitter Sample Coverage (JS, FM, RM, HL), pp. 237–245.
- ITiCSE-2015-AycockPS #design #experience #game studies #python
- A Game Engine in Pure Python for CS1: Design, Experience, and Limits (JA, EP, SS), pp. 93–98.
- TACAS-2015-KiniV #automaton #ltl #probability
- Limit Deterministic and Probabilistic Automata for LTL ∖ GU (DK, MV), pp. 628–642.
- SCAM-2015-BinkleyGHIKY #slicing
- ORBS and the limits of static slicing (DB, NEG, MH, SSI, JK, SY), pp. 1–10.
- STOC-2015-AmbainisFG #matrix #multi #performance
- Fast Matrix Multiplication: Limitations of the Coppersmith-Winograd Method (AA, YF, FLG), pp. 585–593.
- ICALP-v1-2015-BerkholzG #algebra #graph #morphism #testing
- Limitations of Algebraic Approaches to Graph Isomorphism Testing (CB, MG), pp. 155–166.
- ICALP-v2-2015-ColcombetS #linear #order #quantifier #set
- Limited Set quantifiers over Countable Linear Orderings (TC, AVS), pp. 146–158.
- CSCW-2015-KoYLHJLSYSC #named #self #smarttech
- NUGU: A Group-based Intervention App for Improving Self-Regulation of Limiting Smartphone Use (MK, SY, JL, CH, JJ, UL, DS, KY, JS, KMC), pp. 1235–1245.
- ICML-2015-GongY #analysis #convergence #memory management
- A Modified Orthant-Wise Limited Memory Quasi-Newton Method with Convergence Analysis (PG, JY), pp. 276–284.
- ICML-2015-GuptaAGN #learning #precise
- Deep Learning with Limited Numerical Precision (SG, AA, KG, PN), pp. 1737–1746.
- ICML-2015-XinW #adaptation #probability #rank
- Pushing the Limits of Affine Rank Minimization by Adapting Probabilistic PCA (BX, DPW), pp. 419–427.
- ICML-2015-YiCP #algorithm #performance
- Binary Embedding: Fundamental Limits and Fast Algorithm (XY, CC, EP), pp. 2162–2170.
- OOPSLA-2015-BrutschyFTP #named #resource management
- ShamDroid: gracefully degrading functionality in the presence of limited resource access (LB, PF, OT, MP), pp. 316–331.
- SAC-2015-AttiaTHKTC #detection
- On-device anomaly detection for resource-limited systems (MBA, CT, AHL, BK, VT, MC), pp. 548–554.
- SAC-2015-MainiS #communication #distributed #multi #using
- Distributed task servicing using multiple robots with human-in-the-loop under limited communication range (PM, PBS), pp. 301–306.
- HPDC-2015-EllsworthMRS #named
- POW: System-wide Dynamic Reallocation of Limited Power in HPC (DAE, ADM, BR, MS), pp. 145–148.
- CASE-2014-WangCG #algorithm #constraints #estimation #hybrid #multi #problem #scheduling
- Hybrid estimation of distribution algorithm with multiple subpopulations for semiconductor manufacturing scheduling problem with limited waiting-time constraint (HKW, CFC, MG), pp. 101–106.
- DAC-2014-NaeemiCKPIR #generative #scalability
- BEOL Scaling Limits and Next Generation Technology Prospects (AN, AC, VK, CP, RMI, SR), p. 6.
- DATE-2014-LeePB #configuration management
- Brisk and limited-impact NoC routing reconfiguration (DL, RP, VB), pp. 1–6.
- DATE-2014-RuhrmairSB #how
- Special session: How secure are PUFs really? On the reach and limits of recent PUF attacks (UR, US, WB), pp. 1–4.
- DATE-2014-Wuttig
- Exploring the limits of phase change memories (MW), pp. 1–2.
- VLDB-2014-Arauz #database #design
- CAP Limits in Telecom Subscriber Database Design (JA), pp. 1474–1483.
- VLDB-2014-Viglas #memory management #persistent
- Write-limited sorts and joins for persistent memory (SV), pp. 413–424.
- FoSSaCS-2014-0001MS #markov #process
- Limit Synchronization in Markov Decision Processes (LD, TM, MS), pp. 58–72.
- PLDI-2014-YangM #haskell
- Dynamic space limits for Haskell (EZY, DM), p. 59.
- STOC-2014-KumarS #all about #reduction
- The limits of depth reduction for arithmetic formulas: it’s all about the top fan-in (MK, SS), pp. 136–145.
- DLT-2014-OkhotinS #automaton #nondeterminism
- Input-Driven Pushdown Automata with Limited Nondeterminism — (Invited Paper) (AO, KS), pp. 84–102.
- ICALP-v2-2014-BorelloCV #automaton #set
- Turing Degrees of Limit Sets of Cellular Automata (AB, JC, PV), pp. 74–85.
- LATA-2014-BednarovaG #automaton
- Two Double-Exponential Gaps for Automata with a Limited Pushdown (ZB, VG), pp. 113–125.
- CHI-2014-JoshiRRESKPSRSSVR #people
- Supporting treatment of people living with HIV / AIDS in resource limited settings with IVRs (ANJ, MR, DR, NE, PS, NK, SP, DS, RR, DGS, KS, EV, RR), pp. 1595–1604.
- CHI-2014-MellisB
- Do-it-yourself cellphones: an investigation into the possibilities and limits of high-tech diy (DAM, LB), pp. 1723–1732.
- DHM-2014-Harriehausen-Muhlabauter #mobile #navigation
- Mobile Navigation for Limited Mobility Users (BHM), pp. 535–545.
- ICML-c1-2014-SeldinBCA #multi #predict
- Prediction with Limited Advice and Multiarmed Bandits with Paid Observations (YS, PLB, KC, YAY), pp. 280–287.
- ICML-c1-2014-TangMNMZ #analysis #comprehension #modelling #topic
- Understanding the Limiting Factors of Topic Modeling via Posterior Contraction Analysis (JT, ZM, XN, QM, MZ), pp. 190–198.
- ICPR-2014-Chetouani #assessment #image #quality
- Full Reference Image Quality Assessment: Limitation (AC), pp. 833–837.
- OOPSLA-2014-XiaoGZZZYWLCZ #named #reduction #source code
- Cybertron: pushing the limit on I/O reduction in data-parallel programs (TX, ZG, HZ, JZ, XZ, CY, XW, WL, WC, LZ), pp. 895–908.
- ASPLOS-2014-DingZZES #compilation #complexity #runtime #scheduling
- Finding the limit: examining the potential and complexity of compilation scheduling for JIT-based runtime systems (YD, MZ, ZZ, SE, XS), pp. 607–622.
- VMCAI-2014-WangH #concurrent #reachability
- Precisely Deciding Control State Reachability in Concurrent Traces with Limited Observability (CW, KH), pp. 376–394.
- DATE-2013-BaiS #architecture #automation #data transformation #manycore #memory management #performance
- Automatic and efficient heap data management for limited local memory multicore architectures (KB, AS), pp. 593–598.
- DocEng-2013-TruranSGC #automation #generative #guidelines
- Automatic generation of limited-depth hyper-documents from clinical guidelines (MT, JS, GG, MC), pp. 245–248.
- VLDB-2014-BailisDFGHS13 #transaction
- Highly Available Transactions: Virtues and Limitations (PB, AD, AF, AG, JMH, IS), pp. 181–192.
- ICSM-2013-KlintLV #domain model
- Exploring the Limits of Domain Model Recovery (PK, DL, JJV), pp. 120–129.
- PLDI-2013-CohenP #bound #towards
- Limitations of partial compaction: towards practical bounds (NC, EP), pp. 309–320.
- LATA-2013-BalaJ #automaton #nondeterminism
- Limited Non-determinism Hierarchy of Counter Automata (SB, DJ), pp. 92–103.
- CHI-2013-AceitunoCR #how
- How low can you go?: human limits in small unidirectional mouse movements (JA, GC, NR), pp. 1383–1386.
- CHI-2013-BaumerAKLSSW #case study #experience #facebook
- Limiting, leaving, and (re)lapsing: an exploration of facebook non-use practices and experiences (EPSB, PA, VDK, TCL, MES, VSS, KW), pp. 3257–3266.
- CHI-2013-MedhiLTC #education #navigation #user interface
- Some evidence for the impact of limited education on hierarchical user interface navigation (IM, ML, KT, EC), pp. 2813–2822.
- HIMI-D-2013-ZeshanMA #bibliography #ontology #quality #web #web service
- Quality of Service Ontology Languages for Web Services Discovery: An Overview and Limitations (FZ, RM, MNA), pp. 400–407.
- KDD-2013-YenCLLL #classification #coordination #linear #memory management #scalability
- Indexed block coordinate descent for large-scale linear classification with limited memory (IEHY, CFC, TWL, SWL, SDL), pp. 248–256.
- SAC-2013-CameronCL #memory management #mining #set
- Stream mining of frequent sets with limited memory (JJC, AC, CKSL), pp. 173–175.
- CSL-2013-Tendera
- Means and Limits of Decision (Invited Talk) (LT), pp. 28–29.
- CASE-2012-HN #approach #multi #network #social
- Influence limitation in multi-campaign social networks: A Shapley value based approach (PRH, YN), pp. 735–740.
- DAC-2012-ParkKCDCP #prototype
- Approaching the theoretical limits of a mesh NoC with a 16-node chip prototype in 45nm SOI (SP, TK, CHOC, BKD, AC, LSP), pp. 398–405.
- DAC-2012-PinckneySDFMSB #performance
- Assessing the performance limits of parallelized near-threshold computing (NRP, KS, RGD, DF, TNM, DS, DB), pp. 1147–1152.
- DAC-2012-QiuM #question #scalability
- Can pin access limit the footprint scaling? (XQ, MMS), pp. 1100–1106.
- SAS-2012-Alonso-BlasG #approach #cost analysis #on the
- On the Limits of the Classical Approach to Cost Analysis (DEAB, SG), pp. 405–421.
- STOC-2012-AbernethyFW
- Minimax option pricing meets black-scholes in the limit (JA, RMF, AW), pp. 1029–1040.
- STOC-2012-ChawlaIL #black box #design #on the #reduction
- On the limits of black-box reductions in mechanism design (SC, NI, BL), pp. 435–448.
- ICALP-v1-2012-SanthanamS #on the
- On the Limits of Sparsification (RS, SS), pp. 774–785.
- LATA-2012-SaloT #automaton #finite #on the #product line #set
- On Stable and Unstable Limit Sets of Finite Families of Cellular Automata (VS, IT), pp. 502–513.
- CHI-2012-LeonUSWBC #behaviour #evaluation #online #tool support #usability #why
- Why Johnny can’t opt out: a usability evaluation of tools to limit online behavioral advertising (PGL, BU, RS, YW, RB, LFC), pp. 589–598.
- ICML-2012-HazanK12a #linear
- Linear Regression with Limited Observation (EH, TK), p. 242.
- KDD-2012-ChengZKC #algorithm #clique #memory management #performance
- Fast algorithms for maximal clique enumeration with limited memory (JC, LZ, YK, SC), pp. 1240–1248.
- KR-2012-BoothFKP #logic
- Credibility-Limited Revision Operators in Propositional Logic (RB, EF, SK, RPP).
- MLDM-2012-JoenssenB
- Hot Deck Methods for Imputing Missing Data — The Effects of Limiting Donor Usage (DWJ, UB), pp. 63–75.
- ICSE-2012-SusB #education #integration #re-engineering #using
- Using continuous integration of code and content to teach software engineering with limited resources (JGS, WB), pp. 1175–1184.
- OSDI-2012-TangABBGS #mobile #named
- CleanOS: Limiting Mobile Data Exposure with Idle Eviction (YT, PA, SB, AB, RG, NS), pp. 77–91.
- CASE-2011-WanY #detection #fault
- Fault detection of networked control systems utilizing limited possibilities of unknown packet transmission (YW, HY), pp. 619–624.
- DATE-2011-DrmanacSWWA #multi #optimisation #parametricity #predict #testing
- Multidimensional parametric test set optimization of wafer probe data for predicting in field failures and setting tighter test limits (DGD, NS, LW, LCW, MSA), pp. 794–799.
- DATE-2011-NalamCAC
- Dynamic write limited minimum operating voltage for nanoscale SRAMs (SN, VC, RCA, BHC), pp. 467–472.
- ICDAR-2011-Smith #modelling
- Limits on the Application of Frequency-Based Language Models to OCR (RS), pp. 538–542.
- ITiCSE-2011-FeasterSWH #education
- Teaching CS unplugged in the high school (with limited success) (YF, LS, SKW, JOH), pp. 248–252.
- STOC-2011-Pass #security #standard
- Limits of provable security from standard assumptions (RP), pp. 109–118.
- DLT-J-2009-LehtinenO11 #equation #on the #set
- On Equations over Sets of Numbers and their Limitations (TL, AO), pp. 377–393.
- ICALP-v1-2011-AllenderFG #power of #random #string
- Limits on the Computational Power of Random Strings (EA, LF, WIG), pp. 293–304.
- ICALP-v1-2011-HarrowMS #quantum #reduction
- Limitations on Quantum Dimensionality Reduction (AWH, AM, AJS), pp. 86–97.
- ICALP-v2-2011-Delacourt #automaton #set #theorem
- Rice’s Theorem for μ-Limit Sets of Cellular Automata (MD), pp. 89–100.
- CHI-2011-MitchellM #interactive
- Limits of rereadability in procedural interactive stories (AM, KM), pp. 1939–1948.
- ICEIS-v4-2011-YangZZZ #policy
- Urban Motor Vehicle Limiting Policy based on System Dynamics (HY, ZZ, YZ, HZ), pp. 539–542.
- ECIR-2011-CumminsLO #effectiveness #retrieval
- The Limits of Retrieval Effectiveness (RC, ML, CO), pp. 277–282.
- KDD-2011-ChangR #convergence #linear #memory management #modelling #performance #scalability
- Selective block minimization for faster convergence of limited memory large-scale linear models (KWC, DR), pp. 699–707.
- HPDC-2011-Meoni #grid
- Interactivity on the grid: limitations and opportunities (MM), pp. 273–274.
- ICST-2011-CausevicSP #bibliography #development #industrial #perspective
- Factors Limiting Industrial Adoption of Test Driven Development: A Systematic Review (AC, DS, SP), pp. 337–346.
- DATE-2010-MajidK #performance
- Stretching the limits of FPGA SerDes for enhanced ATE performance (AMM, DCK), pp. 202–207.
- VLDB-2010-WeiRM #quality #xml
- Achieving High Output Quality under Limited Resources through Structure-based Spilling in XML Streams (MW, EAR, MM), pp. 1267–1278.
- STOC-2010-BayatiGT #approach #combinator #graph #random #scalability
- Combinatorial approach to the interpolation method and scaling limits in sparse random graphs (MB, DG, PT), pp. 105–114.
- STOC-2010-LeightonM
- Extensions and limits to vertex sparsification (FTL, AM), pp. 47–56.
- STOC-2010-VerbinZ #bound #memory management
- The limits of buffering: a tight lower bound for dynamic membership in the external memory model (EV, QZ), pp. 447–456.
- ICALP-v1-2010-BorodinL #combinator #design #on the
- On the Limitations of Greedy Mechanism Design for Truthful Combinatorial Auctions (AB, BL), pp. 90–101.
- AdaEurope-2010-GraydonKY #case study #dependence
- Practical Limits on Software Dependability: A Case Study (PJG, JCK, XY), pp. 83–96.
- ICPR-2010-WakaharaY #correlation #multi #recognition
- Multi-template GAT/PAT Correlation for Character Recognition with a Limited Quantity of Data (TW, YY), pp. 2873–2876.
- KR-2010-GrauM #ontology #reasoning
- Pushing the Limits of Reasoning over Ontologies with Hidden Content (BCG, BM).
- SAC-2010-PirkolaT #approach #crawling #problem #using
- Addressing the limited scope problem of focused crawling using a result merging approach (AP, TT), pp. 1735–1740.
- HPCA-2010-HuangSWSXM #named #permutation
- SIF: Overcoming the limitations of SIMD devices via implicit permutation (LH, LS, ZW, WS, NX, SM), pp. 1–12.
- DAC-2009-CochranR
- Spectral techniques for high-resolution thermal characterization with limited sensor data (RC, SR), pp. 478–483.
- DAC-2009-DengCS #authentication #hardware #performance #simulation
- Hardware authentication leveraging performance limits in detailed simulations and emulations (DYD, AHC, GES), pp. 682–687.
- DAC-2009-GargMMO #design #multi #perspective
- Technology-driven limits on DVFS controllability of multiple voltage-frequency island designs: a system-level perspective (SG, DM, RM, ÜYO), pp. 818–821.
- DATE-2009-GenzD
- Overcoming limitations of the SystemC data introspection (CG, RD), pp. 590–593.
- DATE-2009-LangenJ
- Limiting the number of dirty cache lines (PJdL, BHHJ), pp. 670–675.
- DATE-2009-StratigopoulosMM #set
- Enrichment of limited training sets in machine-learning-based analog/RF test (HGDS, SM, YM), pp. 1668–1673.
- TACAS-2009-VechevYY
- Inferring Synchronization under Limited Observability (MTV, EY, GY), pp. 139–154.
- ICPC-J-2008-BinkleyLMM09 #identifier #memory management
- Identifier length and limited programmer memory (DB, DL, SM, CM), pp. 430–445.
- DLT-2009-LehtinenO #equation #on the #set
- On Equations over Sets of Numbers and Their Limitations (TL, AO), pp. 360–371.
- ICALP-v1-2009-KoutisW #algebra #problem
- Limits and Applications of Group Algebras for Parameterized Problems (IK, RW), pp. 653–664.
- ICALP-v1-2009-Morizumi
- Limiting Negations in Formulas (HM), pp. 701–712.
- LATA-2009-VerwerWW #automaton
- One-Clock Deterministic Timed Automata Are Efficiently Identifiable in the Limit (SV, MdW, CW), pp. 740–751.
- HCI-NIMT-2009-Yee #difference #gesture #multi
- Potential Limitations of Multi-touch Gesture Vocabulary: Differentiation, Adoption, Fatigue (WY), pp. 291–300.
- KEOD-2009-GargSSMD #keyword #semantics
- Aragog Semantic Search Engine — Beyond the Limits of Keyword Search (MG, JS, JS, HM, SKD), pp. 21–27.
- RecSys-2009-SeyerlehnerFW #on the #recommendation
- On the limitations of browsing top-N recommender systems (KS, AF, GW), pp. 321–324.
- OOPSLA-2009-ZhaoSZWLS #java #manycore
- Allocation wall: a limiting factor of Java applications on emerging multi-core platforms (YZ, JS, KZ, HW, HL, LS), pp. 361–376.
- CASE-2008-Andoh #identification #using
- Coulomb friction identification for mechatronic servo systems with limited strokes using two reference inputs (FA), pp. 265–272.
- CSMR-2008-Oliveto #information retrieval #traceability
- Traceability Management meets Information Retrieval Methods “Strengths and Limitations” (RO), pp. 302–305.
- ICPC-2008-BinkleyLMM #memory management
- Impact of Limited Memory Resources (DB, DL, SM, CM), pp. 83–92.
- ECIR-2008-ShtykhCJ #interface #mobile #web
- Slide-Film Interface: Overcoming Small Screen Limitations in Mobile Web Search (RYS, JC, QJ), pp. 622–626.
- ICML-2008-DoshiPR #learning #using
- Reinforcement learning with limited reinforcement: using Bayes risk for active learning in POMDPs (FD, JP, NR), pp. 256–263.
- SIGIR-2008-MacdonaldHOS
- Limits of opinion-finding baseline systems (CM, BH, IO, IS), pp. 747–748.
- SAC-2008-SarmentaDRD
- Offline count-limited certificates (LFGS, MvD, JR, SD), pp. 2145–2152.
- ASPLOS-2008-LeeB #adaptation #architecture #performance #roadmap
- Efficiency trends and limits from comprehensive microarchitectural adaptivity (BCL, DMB), pp. 36–47.
- ISMM-2008-SartorHM
- No bit left behind: the limits of heap data compression (JBS, MH, KSM), pp. 111–120.
- ISMM-2008-Siebert #garbage collection #parallel
- Limits of parallel marking garbage collection (FS), pp. 21–29.
- OSDI-2008-ChenZMB #automation #case study #dependence #experience #network
- Automating Network Application Dependency Discovery: Experiences, Limitations, and New Solutions (XC, MZ, ZMM, PB), pp. 117–130.
- CASE-2007-SomesBN #automation
- Overcoming Traditional Automation Limitations Through Compliant Control and Contact Sensing (SDS, DJB, WSN), pp. 295–299.
- DAC-2007-Roychowdhury
- Micro-Photonic Interconnects: Characteristics, Possibilities and Limitations (JSR), pp. 574–575.
- HT-2007-BrownFB #learning
- Real users, real results: examining the limitations of learning styles within AEH (EJB, TF, TJB), pp. 57–66.
- STOC-2007-DobzinskiN
- Limitations of VCG-based mechanisms (SD, NN), pp. 338–344.
- STOC-2007-DworkMT #privacy
- The price of privacy and the limits of LP decoding (CD, FM, KT), pp. 85–94.
- CIKM-2007-LiuTZ #learning #network
- Ensembling Bayesian network structure learning on limited data (FL, FT, QZ), pp. 927–930.
- RecSys-2007-ResnickS #recommendation
- The influence limiter: provably manipulation-resistant recommender systems (PR, RS), pp. 25–32.
- SEKE-2007-PengJRZ #case study #component #database #product line #reuse
- Reuse of Database Access Layer Components in JEE Product Lines: Limitations and a Possible Solution (Case Study) (DP, SJ, DCR, HZ), pp. 308–313.
- OOPSLA-2007-MitchellS #health
- The causes of bloat, the limits of health (NM, GS), pp. 245–260.
- LICS-2007-GimbertZ #markov #multi #process
- Limits of Multi-Discounted Markov Decision Processes (HG, WZ), pp. 89–98.
- CASE-2006-Jiang #algorithm #coordination #multi
- An improved algorithm for coordination control of multi-agent system based on r-limited voronoi partitions (QJ), pp. 667–671.
- DAC-2006-BerezaTWKP #named
- PELE: pre-emphasis & equalization link estimator to address the effects of signal integrity limitations (WB, YT, SW, TAK, RHP), pp. 1013–1016.
- DAC-2006-SheahanFWMM #challenge #design
- 4.25 Gb/s laser driver: design challenges and EDA tool limitations (BS, JWF, JW, KM, BM), pp. 863–866.
- SIGMOD-2006-KiniSND #database
- Database support for matching: limitations and opportunities (AK, SS, JFN, DJD), pp. 85–96.
- WCRE-2006-Briand #challenge #paradigm #reverse engineering
- The Experimental Paradigm in Reverse Engineering: Role, Challenges, and Limitations (LCB), pp. 3–8.
- STOC-2006-BorgsCLSSV #graph #parametricity #testing
- Graph limits and parameter testing (CB, JTC, LL, VTS, BS, KV), pp. 261–270.
- STOC-2006-HallgrenMRRS #graph #morphism #quantum
- Limitations of quantum coset states for graph isomorphism (SH, CM, MR, AR, PS), pp. 604–617.
- ICALP-v2-2006-GimbertZ #game studies
- Deterministic Priority Mean-Payoff Games as Limits of Discounted Games (HG, WZ), pp. 312–323.
- CIKM-2006-WuLWK #feedback #probability
- Probabilistic document-context based relevance feedback with limited relevance judgments (HCW, RWPL, KFW, KLK), pp. 854–855.
- ICML-2006-SrebroSR #clustering
- An investigation of computational and informational limits in Gaussian mixture clustering (NS, GS, STR), pp. 865–872.
- ICPR-v2-2006-JiangL #3d #image #synthesis
- Synthesis of Stereoscopic 3D Videos by Limited Resources of Range Images (XJ, ML), pp. 1220–1224.
- ICPR-v3-2006-WangLL #automation
- Automatic Lipreading with Limited Training Data (SLW, WHL, SHL), pp. 881–884.
- KR-2006-SardinaGLL #nondeterminism #on the #strict
- On the Limits of Planning over Belief States under Strict Uncertainty (SS, GDG, YL, HJL), pp. 463–471.
- SIGIR-2006-BuckleyDSV #bias
- Bias and the limits of pooling (CB, DD, IS, EMV), pp. 619–620.
- SIGIR-2006-LinWDA
- Exploring the limits of single-iteration clarification dialogs (JJL, PW, DDF, EGA), pp. 469–476.
- ICSE-2006-CanforaSZ #java
- Developing and executing java AWT applications on limited devices with TCPTE (GC, GDS, EZ), pp. 787–790.
- DAC-2005-EguroHS #adaptation #architecture
- Architecture-adaptive range limit windowing for simulated annealing FPGA placement (KE, SH, AS), pp. 439–444.
- ICDAR-2005-MaD #adaptation #feedback
- Adaptive OCR with Limited User Feedback (HM, DSD), pp. 814–818.
- ICDAR-2005-Wakahara #correlation #multi #recognition
- Multi-template GAT Correlation for Character Recognition with a Limited Quantity of Data (TW), pp. 824–828.
- FoSSaCS-2005-Schroder #algebra #logic
- Expressivity of Coalgebraic Modal Logic: The Limits and Beyond (LS), pp. 440–454.
- STOC-2005-GuruswamiR
- Limits to list decoding Reed-Solomon codes (VG, AR), pp. 602–609.
- ICEIS-v2-2005-AhmanH #approach #game studies #reduction #simulation #using
- Using a Game Theoretical Approach for Experimental Simulation of Brood Reduction — Conflict and Co-Operation, Effect on Brood Size with Limited Resources (FÅ, LH), pp. 220–225.
- ICML-2005-BeygelzimerDHLZ #classification #fault #reduction
- Error limiting reductions between classification tasks (AB, VD, TPH, JL, BZ), pp. 49–56.
- SEKE-2005-BasitRJ #empirical #unification #using
- An Empirical Study on Limits of Clone Unification Using Generics (HAB, DCR, SJ), pp. 109–114.
- SAC-2005-BartakR
- Limited assignments: a new cutoff strategy for incomplete depth-first search (RB, HR), pp. 388–392.
- SAC-2005-DantchevV #infinity #on the
- On the computational limits of infinite satisfaction (SSD, FDV), pp. 393–397.
- HPCA-2005-JacobsonBHBZEEGLST #performance
- Stretching the Limits of Clock-Gating Efficiency in Server-Class Processors (HMJ, PB, ZH, AB, VVZ, RJE, LE, JG, DL, BS, JMT), pp. 238–242.
- HPCA-2005-MengSK #on the #power management #reduction
- On the Limits of Leakage Power Reduction in Caches (YM, TS, RK), pp. 154–165.
- DAC-2004-ZhaiBSF #scalability
- Theoretical and practical limits of dynamic voltage scaling (BZ, DB, DS, KF), pp. 868–873.
- HT-2004-Bernstein #adaptation #metadata
- Lust, touch, metadata: meaning and the limits of adaptation (MB), pp. 36–37.
- PODS-2004-NashL #data access #first-order #query
- Processing First-Order Queries under Limited Access Patterns (AN, BL), pp. 307–318.
- VLDB-2004-LeFevreAERXD #database
- Limiting Disclosure in Hippocratic Databases (KL, RA, VE, RR, YX, DJD), pp. 108–119.
- VLDB-2004-SrivastavaW #execution
- Memory-Limited Execution of Windowed Stream Joins (US, JW), pp. 324–335.
- ICEIS-v4-2004-Debenham #multi #process #transaction
- Managing E-Market Transaction Processes: Exploring the Limits of Process Management with a Multiagent System (JKD), pp. 322–330.
- KR-2004-LiuLL #logic #reasoning
- A Logic of Limited Belief for Reasoning with Disjunctive Information (YL, GL, HJL), pp. 587–597.
- SAC-2004-MichaelsonHS #automaton #bound #named #programming #using
- FSM-Hume: programming resource-limited systems using bounded automata (GM, KH, JS), pp. 1455–1461.
- CC-2004-ChowdhuryDCBM #alias #analysis #optimisation
- The Limits of Alias Analysis for Scalar Optimizations (RAC, PD, BC, JHB, KSM), pp. 24–38.
- ICLP-2004-CaldonM #implementation
- Limiting Resolution: From Foundations to Implementation (PC, EM), pp. 149–164.
- LICS-2004-DunphyR #parametricity
- Parametric Limits (BPD, USR), pp. 242–251.
- LICS-2004-KhoussainovNRS #automation
- Automatic Structures: Richness and Limitations (BK, AN, SR, FS), pp. 44–53.
- DAC-2003-ChenGK #synthesis
- Performance-impact limited area fill synthesis (YC, PG, ABK), pp. 22–27.
- PODS-2003-EvfimievskiGS #data mining #mining #privacy
- Limiting privacy breaches in privacy preserving data mining (AVE, JG, RS), pp. 211–222.
- PLDI-2003-XieMM #scalability
- Compile-time dynamic voltage scaling settings: opportunities and limits (FX, MM, SM), pp. 49–62.
- STOC-2003-BrodalF #on the
- On the limits of cache-obliviousness (GSB, RF), pp. 307–315.
- SOSP-2003-ManiatisRRBGM
- Preserving peer replicas by rate-limited sampled voting (PM, DSHR, MR, MB, TJG, YM), pp. 44–59.
- DATE-2002-LeeCDGM #algorithm #detection #fault #multi #testing
- A New ATPG Algorithm to Limit Test Set Size and Achieve Multiple Detections of All Faults (SL, BC, JD, MRG, MRM), pp. 94–99.
- STOC-2002-Guruswami #linear
- Limits to list decodability of linear codes (VG), pp. 802–811.
- ICPR-v1-2002-ZhangGSS #2d #image #sequence #using
- Recovering Elastic Property of Soft Tissues Using 2D Image Sequences With Limited Range Data (YZ, DBG, SS, MCS), pp. 755–758.
- KR-2002-DuboisFP #on the
- On the Limitations of Ordinal Approaches to Decision-making (DD, HF, PP), pp. 133–146.
- SAC-2002-FeliciF #evolution #modelling
- Limits in modelling evolving computer-based systems (MF, JKF), pp. 706–710.
- HPCA-2002-BrownP #pipes and filters #using
- Using Internal Redundant Representations and Limited Bypass to Support Pipelined Adders and Register Files (MDB, YNP), pp. 289–298.
- HPDC-2002-ChiuGB #performance
- Investigating the Limits of SOAP Performance for Scientific Computing (KC, MG, RB), pp. 246–254.
- CSL-2002-HayashiA
- Limit-Computable Mathematics and Its Applications (SH, YA), p. 1.
- ICLP-2002-MaSX #logic programming #source code
- The Limits of Horn Logic Programs (SM, YS, KX), p. 467.
- DAC-2001-Pomeranz #random #testing
- Random Limited-Scan to Improve Random Pattern Testing of Scan Circuits (IP), pp. 145–150.
- DATE-2001-StaaBHPMKH #data transformation #design
- Data management: limiter or accelerator for electronic design creativity (PvS, RB, HH, BP, JM, WK, WH), pp. 162–163.
- ICFP-2001-GustavssonS #call-by
- Possibilities and Limitations of Call-by-Need Space Improvement (JG, DS), pp. 265–276.
- ECOOP-2001-Cockburn #people
- People and the Limits of Methodology (AC), p. 302.
- SAC-2001-Chainbi01a #paradigm #using
- Using the object paradigm to deal with the agent paradigm: capabilities and limits (WC), pp. 585–589.
- SAC-2001-Pressel
- Fundamental limitations on the use of prefetching and stream buffers for scientific applications (DMP), pp. 554–559.
- SOSP-2001-YuV #cost analysis
- The Costs and Limits of Availability for Replicated Services (HY, AV), pp. 29–42.
- CSL-2001-Akama #algebra #combinator #logic #towards #λ-calculus
- Limiting Partial Combinatory Algebras towards Infinitary λ-Calculi and Classical Logic (YA), pp. 399–413.
- ICSM-2000-AntoniolCCT #approach #problem
- An Approach to Limit the Wynot Problem (GA, GC, AC, MT), pp. 207–215.
- WLC-2000-BuchholzKK #array #communication #nondeterminism
- Iterative Arrays With Limited Nondeterministic Communication Cell (TB, AK, MK), pp. 73–87.
- ICML-2000-DeJong #empirical #learning
- Hidden Strengths and Limitations: An Empirical Investigation of Reinforcement Learning (GD), pp. 215–222.
- TOOLS-EUROPE-2000-NobleW00a #design pattern #memory management
- Smaller Software: Patterns for Objects in Limited Memory (JN, CW), p. 471.
- CC-2000-WangTP #framework #memory management
- A Framework for Loop Distribution on Limited On-Chip Memory Processors (LW, WT, SP), pp. 141–156.
- LCTES-2000-BairagiPA #embedded #framework #quality #set
- A Framework for Enhancing Code Quality in Limited Register Set Embedded Processors (DB, SP, DPA), pp. 81–95.
- OSDI-2000-LowellCC
- Exploring Failure Transparency and the Limits of Generic Recovery (DEL, SC, PMC), pp. 289–304.
- PODS-1999-AlonGMS #self
- Tracking Join and Self-Join Sizes in Limited Storage (NA, PBG, YM, MS), pp. 10–20.
- SIGMOD-1999-FlorescuLMS #data access #optimisation #query
- Query Optimization in the Presence of Limited Access Patterns (DF, AYL, IM, DS), pp. 311–322.
- VLDB-1999-ShanmugasundaramGTZDN #database #documentation #query #relational #xml
- Relational Databases for Querying XML Documents: Limitations and Opportunities (JS, KT, CZ, GH, DJD, JFN), pp. 302–314.
- TOOLS-ASIA-1999-PeriorellisD #approach #modelling #network
- Modeling Dynamic Networks: Advantages and Limitations of the O-O Approach (PP, JED), pp. 448–457.
- HPCA-1999-BilasJZS #approach #memory management #performance
- Limits to the Performance of Software Shared Memory: A Layered Approach (AB, DJ, YZ, JPS), pp. 193–202.
- DAC-1998-QiuWP #estimation #order #statistics #using
- Maximum Power Estimation Using the Limiting Distributions of Extreme Order Statistics (QQ, QW, MP), pp. 684–689.
- SIGMOD-1998-RajagopalanML #approximate #memory management
- Approximate Medians and other Quantiles in One Pass and with Limited Memory (GSM, SR, BGL), pp. 426–435.
- STOC-1998-GoldreichG #on the #problem
- On the Limits of Non-Approximability of Lattice Problems (OG, SG), pp. 1–9.
- ICALP-1998-Gargano #network
- Limited Wavelength Conversion in All-Optical Tree Networks (LG), pp. 544–555.
- ICSE-1998-ChanBS #analysis #named #specification
- Promises: Limited Specifications for Analysis and Manipulation (ECC, JB, WLS), pp. 167–176.
- LCTES-1998-AnantharamanP #clustering #embedded #memory management #performance
- An Efficient Data Partitioning Method for Limited Memory Embedded Systems (SA, SP), pp. 108–222.
- LCTES-1998-CooperS #scheduling
- Non-local Instruction Scheduling with Limited Code Growth (KDC, PJS), pp. 193–207.
- LCTES-1998-LeeLLMK #memory management #realtime #scheduling
- Limited Preemptible Scheduling to Embrace Cache Memory in Real-Time Systems (SL, CGL, ML, SLM, CSK), pp. 51–64.
- CAV-1998-Thathachar #on the #order
- On the Limitations of Ordered Representations of Functions (JST), pp. 232–243.
- ISSTA-1998-Ball #analysis #control flow #on the #testing
- On the Limit of Control Flow Analysis for Regression Test Selection (TB), pp. 134–142.
- DAC-1997-LiG #exception #modelling #optimisation
- Limited Exception Modeling and Its Use in Presynthesis Optimizations (JL, RKG), pp. 341–346.
- ICDAR-1997-EigenmannN #evaluation #multi #network
- Modification of Hard-Limiting Multilayer Neural Networks for Confidence Evaluation (RE, JAN), pp. 1087–1091.
- DLT-1997-Seemann #multi
- Multiple-limited ET0L Systems (MS), pp. 377–385.
- HCI-CC-1997-Komatsubara
- Psychological Upper and Lower Limits of System Response Time and User’s Preference on Skill Level (AK), pp. 829–832.
- HCI-SEC-1997-Duffy97a #safety
- Safety Management: Some Issues and Limitations (VGD), pp. 343–346.
- EDOC-1997-BlackshawE #corba #distributed #enterprise
- Building Distributed Enterprise OLTP Applications: Current CORBA Limitations (BB, JE), pp. 190–196.
- SIGIR-1997-Saracevic #summary
- Users Lost: Reflections on the Past, Future, and Limits of Information Science (Summary) (TS), pp. 1–2.
- PODS-1996-LevyRU #query #using
- Answering Queries Using Limited External Processors (AYL, AR, JDU), pp. 227–237.
- STOC-1996-HromkovicS #communication #nondeterminism
- Nondeterministic Communication with a Limited Number of Advice Bits (JH, GS), pp. 551–560.
- CHI-1996-YamaashiCNB
- Beating the Limitations of Camera-Monitor Mediated Telepresence with Extra Eyes (KY, JRC, TN, WB), pp. 50–57.
- ICPR-1996-0005SBB #capacity #image
- Image processing to overcome channel capacity limitations in telemicroscopy (JS, PS, BB, JB), pp. 929–933.
- ICPR-1996-KimuraWM #feature model #on the #problem
- On feature extraction for limited class problem (FK, TW, YM), pp. 191–194.
- ICPR-1996-MarchandRC #visual notation
- Avoiding robot joint limits and kinematic singularities in visual servoing (ÉM, AR, FC), pp. 297–301.
- KDD-1996-Sahami #classification #dependence #learning
- Learning Limited Dependence Bayesian Classifiers (MS), pp. 335–338.
- PLILP-1996-Kahrs
- Limits of ML-Definability (SK), pp. 17–31.
- DAC-1995-BernMS #performance
- Efficient OBDD-Based Boolean Manipulation in CAD beyond Current Limits (JB, CM, AS), pp. 408–413.
- STOC-1995-BealsNT #complexity
- More on the complexity of negation-limited circuits (RB, TN, KT), pp. 585–595.
- DLT-1995-Gartner #on the
- On Partition Limited OL Systems (SG), pp. 230–236.
- ICALP-1995-Vogler #equivalence
- The Limit of Split_n-Language Equivalence (WV), pp. 636–647.
- KDD-1995-CortesJC #learning #quality
- Limits on Learning Machine Accuracy Imposed by Data Quality (CC, LDJ, WPC), pp. 57–62.
- HPDC-1995-Crandall #clustering #composition
- The Limited Applicability of Block Decomposition in Cluster Computing (PC), pp. 102–109.
- PLDI-1994-Deutsch #alias #analysis #interprocedural #pointer
- Interprocedural May-Alias Analysis for Pointers: Beyond k-limiting (AD), pp. 230–241.
- STOC-1994-TanakaN #complexity #network #on the
- On the complexity of negation-limited Boolean networks (KT, TN), pp. 38–47.
- CSCW-1994-Shapiro #social
- The Limits of Ethnography: Combining Social Sciences for CSCW (DS), pp. 417–428.
- TOOLS-EUROPE-1994-Beringer #development #object-oriented
- Limits of Seamlessness in Object Oriented Software Development (DB), pp. 161–171.
- CC-1994-SlowikPP #compilation
- Compiling Nested Loops for Limited Connectivity VLIWs (AS, GP, PP), pp. 143–157.
- ICDAR-1993-TakeshitaNK #bias #distance #on the
- On the bias of Mahalanobis distance due to limited sample size effect (TT, SN, FK), pp. 171–174.
- INTERCHI-1993-KurtenbachB #performance #using
- The limits of expert performance using hierarchic marking menus (GK, WB), pp. 482–487.
- SOSP-1993-CheritonS #communication #comprehension #order
- Understanding the Limitations of Causally and Totally Ordered Communication (DRC, DS), pp. 44–57.
- IWPTS-1992-Phalippou #power of #testing
- The Limited Power of Testing (MP), pp. 43–54.
- POPL-1991-SekarMR #abstract interpretation #analysis #on the #strict
- On the Power and Limitation of Strictness Analysis Based on Abstract Interpretation (RCS, PM, IVR), pp. 37–48.
- ASPLOS-1991-ChaikenKA #scalability
- LimitLESS Directories: A Scalable Cache Coherence Scheme (DC, JK, AA), pp. 224–234.
- ASPLOS-1991-Wall #parallel
- Limits of Instruction-Level Parallelism (DWW), pp. 176–188.
- STOC-1990-SchmidtS #analysis
- The Analysis of Closed Hashing under Limited Randomness (Extended Abstract) (JPS, AS), pp. 224–234.
- LICS-1990-EmersonES #decidability #on the #performance
- On the Limits of Efficient Temporal Decidability (Extended Abstract) (EAE, ME, JS), pp. 464–475.
- STOC-1989-ImpagliazzoR #permutation
- Limits on the Provable Consequences of One-Way Permutations (RI, SR), pp. 44–61.
- STOC-1989-KearnsV #automaton #encryption #finite #learning
- Cryptographic Limitations on Learning Boolean Formulae and Finite Automata (MJK, LGV), pp. 433–444.
- ICALP-1989-Allender
- Limitations of the Upward Separation Technique (Preliminary Version) (EA), pp. 18–30.
- KR-1989-CrawfordK #formal method #information management #logic #representation #towards
- Towards a Theory of Access-Limited Logic for Knowledge Representation (JMC, BK), pp. 67–78.
- KR-1989-Davis
- Solutions to a Paradox of Perception with Limited Acuity (ED), pp. 79–82.
- ML-1989-Dietterich #induction #learning
- Limitations on Inductive Learning (TGD), pp. 124–128.
- SEKE-1989-ChenC
- Assignment of Objects in a Dual Processor System with Limited Objects (HLC, SKC), pp. 85–92.
- ASPLOS-1989-SmithJH #multi
- Limits on Multiple Instruction Issue (MDS, MJ, MH), pp. 290–302.
- DAC-1988-GaedeRMB #automation #concurrent #named #parallel #testing #using
- CATAPULT: Concurrent Automatic Testing Allowing Parallelization and Using Limited Topology (RKG, DER, MRM, KMB), pp. 597–600.
- PODS-1988-ParedaensG #algebra #using
- Possibilities and Limitations of Using Flat Operators in Nested Algebra Expressions (JP, DVG), pp. 29–38.
- JICSCP-1988-BiswasSY88 #automaton #logic programming #parallel #scalability #source code #strict
- A Scalable Abstract Machine Model to Support Limited-OR (LOR) / Restricted-AND Parallelism (RAP) in Logic Programs (PB, SCS, DYYY), pp. 1160–1179.
- PODS-1987-Delgrande #automation #constraints #generative #maintenance
- Formal Limits on the Automatic Generation and Maintenance of Integrity Constraints (JPD), pp. 190–196.
- SIGIR-1987-Harman #analysis #online
- A Failure Analysis on the Limitations of Suffixing in an Online Environment (DH), pp. 102–107.
- STOC-1986-Beame #parallel #power of
- Limits on the Power of Concurrent-Write Parallel Machines (PB), pp. 169–176.
- STOC-1986-Cleve #security
- Limits on the Security of Coin Flips when Half the Processors Are Faulty (Extended Abstract) (RC), pp. 364–369.
- POPL-1986-LiskovHG #communication #distributed #process
- Limitations of Synchronous Communication with Static Process Structure in Languages for Distributed Computing (BL, MH, LG), pp. 150–159.
- ICLP-1986-Voda86 #logic programming
- Choices in, and Limitations of, Logic Programming (PJV), pp. 615–623.
- STOC-1985-Alon #sorting
- Expanders, Sorting in Rounds and Superconcentrators of Limited Depth (NA), pp. 98–102.
- STOC-1983-DolevDPW
- Superconcentrators, Generalizers and Generalized Connectors with Limited Depth (Preliminary Version) (DD, CD, NP, AW), pp. 42–51.
- PODS-1982-GonnetL
- External Hashing with Limited Internal Storage (GHG, PÅL), pp. 256–261.
- CADE-1982-FrischA #retrieval
- Knowledge Retrieval as Limited Inference (AMF, JFA), pp. 274–291.
- VLDB-1981-Gray #concept #transaction
- The Transaction Concept: Virtues and Limitations (Invited Paper) (JG), pp. 144–154.
- STOC-1981-Yao81a
- The Entropic Limitations on VLSI Computations (Extended Abstract) (ACCY), pp. 308–311.
- SIGIR-1981-Stirling #algorithm #documentation #information retrieval #on the #ranking
- On the Limitations of Document Ranking Algorithms in Information Retrieval (KHS), pp. 63–65.
- ICALP-1980-LangmaackO #hoare #programming language
- Present-Day Hoare-Like Systems for Programming Languages with Procedures: Power, Limits and most Likely Expressions (HL, ERO), pp. 363–373.
- ICALP-1979-CremersH #requirements
- Arbitration and Queuing Under Limited Shared Storage Requirements (Preliminary Report) (ABC, TNH), pp. 147–160.
- DAC-1976-Misra #algorithm #design #problem
- A principle of algorithm design on limited problem domain (JM), pp. 479–483.
- STOC-1974-Lipton #branch
- Limitations of Synchronization Primitives with Conditional Branching and Global Variables (RJL), pp. 230–241.
- ICALP-1974-Monien #bound #recursion
- Characterizations of Time-Bounded Computations by Limited Primitive Recursion (BM), pp. 280–293.
- SOSP-1973-GareyG #bound #scheduling
- Bounds on Scheduling with Limited Resources (MRG, RLG), pp. 104–111.
- SOSP-1973-Kosaraju #petri net
- Limitations of Dijkstra’s Semaphore Primitives and Petri Nets (SRK), pp. 122–136.
- SIGIR-1971-Katcher #performance
- Efficient Utilization of Limited Access Archival Storage in a Time Shared Environment (AMK), pp. 197–205.
- DAC-1969-Dov #research #simulation
- Misuse and limitations of simulation as a business research technique: Some comments (AGBD), pp. 323–331.