44 papers:
DAC-2015-BeckertE #design #independence #realtime- Designing time partitions for real-time hypervisor with sufficient temporal independence (MB, RE), p. 6.
DATE-2015-FeldS #analysis #dependence- Sufficient response time analysis considering dependencies between rate-dependent tasks (TF, FS), pp. 519–524.
ECMFA-2015-DiskinMC #category theory #imperative #model management #visual notation- A Model Management Imperative: Being Graphical Is Not Sufficient, You Have to Be Categorical (ZD, TSEM, KC), pp. 154–170.
- DAC-2014-BeckertNEP #independence #realtime
- Sufficient Temporal Independence and Improved Interrupt Latencies in a Real-Time Hypervisor (MB, MN, RE, SMP), p. 6.
CIKM-2014-QianSS #database #multi #scalability #statistics- Computing Multi-Relational Sufficient Statistics for Large Databases (ZQ, OS, YLS), pp. 1249–1258.
ICPR-2014-ShivramRG #case study #comparative #identification #modelling #online- Data Sufficiency for Online Writer Identification: A Comparative Study of Writer-Style Space vs. Feature Space Models (AS, CR, VG), pp. 3121–3125.
- ICPR-2014-ZhangLYQWTZ #detection #statistics
- Sufficient Statistics Feature Mapping over Deep Boltzmann Machine for Detection (CZ, XL, JY, SQ, YW, CT, YZ), pp. 827–832.
SIGIR-2014-EfronWS #learning #query- Learning sufficient queries for entity filtering (ME, CW, GS), pp. 1091–1094.
- DATE-2013-KappelHHHHH #concept #energy #power management #self
- Alternative power supply concepts for self-sufficient wireless sensor nodes by energy harvesting (RK, GH, GH, TH, GH, GH), p. 481.
- DATE-2013-PollexFSMMW #analysis #constant #realtime
- Sufficient real-time analysis for an engine control unit with constant angular velocities (VP, TF, FS, UM, RM, GW), pp. 1335–1338.
ICEIS-J-2013-RudraGA13a #approximate #query- Estimating Sufficient Sample Sizes for Approximate Decision Support Queries (AR, RPG, NRA), pp. 85–99.
- CIKM-2013-LanNGC #question #ranking
- Is top-k sufficient for ranking? (YL, SN, JG, XC), pp. 1261–1270.
ECIR-2013-LeelanupabZJ #question #rank- Is Intent-Aware Expected Reciprocal Rank Sufficient to Evaluate Diversity? (TL, GZ, JMJ), pp. 738–742.
DLT-2011-Zetzsche- A Sufficient Condition for Erasing Productions to Be Avoidable (GZ), pp. 452–463.
KEOD-2011-SharmaB #ontology #problem #question- Can Ontologies Be Sufficient Solution to Requirement Engineering Problem? (RS, KKB), pp. 461–465.
GT-VMT-2008-LambersET #sequence- Sufficient Criteria for Applicability and Non-Applicability of Rule Sequences (LL, HE, GT).
MoDELS-2008-JurackLMT #behaviour #consistency #diagrams #modelling #process- Sufficient Criteria for Consistent Behavior Modeling with Refined Activity Diagrams (SJ, LL, KM, GT), pp. 341–355.
- MoDELS-2008-JurackLMT #behaviour #consistency #diagrams #modelling #process
- Sufficient Criteria for Consistent Behavior Modeling with Refined Activity Diagrams (SJ, LL, KM, GT), pp. 341–355.
ICSE-2008-NaminAM #effectiveness- Sufficient mutation operators for measuring test effectiveness (ASN, JHA, DJM), pp. 351–360.
VMCAI-2008-Moy #composition- Sufficient Preconditions for Modular Assertion Checking (YM), pp. 188–202.
KDD-2006-Moore #algorithm #statistics- New cached-sufficient statistics algorithms for quickly answering statistical questions (AM), p. 2.
IJCAR-2006-HendrixMO #axiom #linear #order #specification- A Sufficient Completeness Checker for Linear Order-Sorted Specifications Modulo Axioms (JH, JM, HO), pp. 151–155.
ICLP-2005-NomikosRW #equivalence #semantics- A Sufficient Condition for Strong Equivalence Under the Well-Founded Semantics (CN, PR, WWW), pp. 414–415.
RTA-2005-HendrixCM #reasoning #specification- A Sufficient Completeness Reasoning Tool for Partial Specifications (JH, MC, JM), pp. 165–174.
ESOP-2003-Comon-LundhC #security- Security Properties: Two Agents Are Sufficient (HCL, VC), pp. 99–113.
ICML-2002-GlobersonT #analysis #novel #reduction- Sufficient Dimensionality Reduction — A novel Analysis Method (AG, NT), pp. 203–210.
CADE-2002-BofillR #order- Well-Foundedness Is Sufficient for Completeness of Ordered Paramodulation (MB, AR), pp. 456–470.
ICALP-2000-SantisCP #proving- Necessary and Sufficient Assumptions for Non-iterative Zero-Knowledge Proofs of Knowledge for All NP Relations (ADS, GDC, GP), pp. 451–462.
KR-2000-Lin #on the- On Strongest Necessary and Weakest Sufficient Conditions (FL), pp. 167–175.
ISSTA-2000-Pincus #analysis #case study #developer #experience #tool support- Analysis is necessary, but far from sufficient: Experiences building and deploying successful tools for developers and testers (abstract only) (JDP), p. 1.
ICSM-1998-CherinkaOR #maintenance #off the shelf #programming #question #static analysis- Maintaining a COTS Integrated Solution — Are Traditional Static Analysis Techniques Sufficient for this New Programming Methodology? (RC, CMO, JR), pp. 160–169.
- KDD-1998-GraefeFC #classification #database #on the #performance #scalability #sql #statistics
- On the Efficient Gathering of Sufficient Statistics for Classification from Large SQL Databases (GG, UMF, SC), pp. 204–208.
CHI-1997-BhavnaniJ #analysis #performance- From Sufficient to Efficient Usage: An Analysis of Strategic Knowledge (SKB, BEJ), pp. 91–98.
ALP-1994-Bouhoula #induction #proving- Sufficient Completeness and Parameterized Proofs by Induction (AB), pp. 23–40.
- CADE-1994-Bouhoula #induction #named #proving
- SPIKE: a System for Sufficient Completeness and Parameterized Inductive Proofs (AB), pp. 836–840.
- ALP-1992-Gramlich #composition #termination
- Generalized Sufficient Conditions for Modular Termination of Rewriting (BG), pp. 53–68.
IWPTS-1992-ChungS #generative #performance #protocol #testing- Applications of Sufficient Conditions for Efficient Protocol Test Generation (AC, DPS), pp. 219–228.
- ICALP-1991-Hashiguchi #algorithm #generative #regular expression
- Algorithms for Determining the Smallest Number of Nonterminals (States) Sufficient for Generating (Accepting) a Regular Language (KH), pp. 641–648.
STOC-1990-Rompel- One-Way Functions are Necessary and Sufficient for Secure Signatures (JR), pp. 387–394.
LICS-1989-Middeldorp #term rewriting #termination- A Sufficient Condition for the Termination of the Direct Sum of Term Rewriting Systems (AM), pp. 396–401.
- STOC-1986-Yannakakis #graph
- Four Pages are Necessary and Sufficient for Planar Graphs (Extended Abstract) (MY), pp. 104–108.
- CADE-1986-Comon #anti #term rewriting
- Sufficient Completeness, Term Rewriting Systems and “Anti-Unification” (HC), pp. 128–140.
- DAC-1981-TsuiS #multi
- A high-density multilayer PCB router based on necessary and sufficient conditions for single row routing (RYT, RJSI), pp. 372–381.
- ICSE-1981-ZeilW #analysis #testing
- Sufficient Tset Sets for Path Analysis Testing Strategies (SJZ, LJW), pp. 184–194.
