17 papers:
- DAC-2014-QuintonBHNNE #analysis #design #network
- Typical Worst Case Response-Time Analysis and its Use in Automotive Network Design (SQ, TTB, JH, MN, MN, RE), p. 6.
- MSR-2014-TiarksM #development #how #mobile #question #tutorial
- How does a typical tutorial for mobile development look like? (RT, WM), pp. 272–281.
- CASE-2011-LiuZCHZ #energy #evaluation #optimisation #simulation
- Simulation based evaluation and optimization for energy consumption of a typical welding shop (HL, QZ, WC, NH, XZ), pp. 660–665.
- CIKM-2010-CaiLLTL #recommendation
- Recommendation based on object typicality (YC, HfL, QL, JT, JL), pp. 1529–1532.
- SIGMOD-2009-GeZM #nondeterminism #query
- Top-k queries on uncertain data: on score distribution and typical answers (TG, SBZ, SM), pp. 375–388.
- ICPC-2008-AlaliKM #commit #open source #repository #what
- What’s a Typical Commit? A Characterization of Open Source Software Repositories (AA, HHK, JIM), pp. 182–191.
- VLDB-2007-HuaPFLL #database #query #scalability
- Efficiently Answering Top-k Typicality Queries on Large Databases (MH, JP, AWCF, XL, HfL), pp. 890–901.
- WCRE-2007-MarinMD
- Documenting Typical Crosscutting Concerns (MM, LM, AvD), pp. 31–40.
- STOC-2004-BeierV #optimisation
- Typical properties of winners and losers in discrete optimization (RB, BV), pp. 343–352.
- ITiCSE-2003-Trakhtenbrot #analysis #concept #how
- Analysis of typical misconceptions in a theoretical CS course, and how to address them in e-learning (MBT), p. 241.
- SIGAda-2003-Rosen #case study #database #experience #web
- Experiences in developing a typical web/database application (JPR), pp. 38–48.
- CAiSE-2001-FurtadoC #library
- Constructing Libraries of Typical Plans (ALF, AEMC), pp. 124–139.
- HPDC-2001-HumphreyT #grid #security
- Security Implications of Typical Grid Computing Usage Scenarios (MH, MRT), pp. 95–103.
- AGTIVE-1999-ZamperoniE #aspect-oriented #exclamation #experience #graph grammar #integration #re-engineering #term rewriting #using
- Formal Integration of Software Engineering Aspects Using Graph Rewrite Systems — A Typical Experience?! (AZ, GE), pp. 359–367.
- SIGIR-1998-WangL #approach #documentation #roadmap
- Discovering Typical Structures of Documents: A Road Map Approach (KW, HL), pp. 146–154.
- STOC-1993-FreundKRRSS #automaton #finite #learning #performance #random
- Efficient learning of typical finite automata from random walks (YF, MJK, DR, RR, RES, LS), pp. 315–324.
- ML-1992-Zhang #learning
- Selecting Typical Instances in Instance-Based Learning (JZ), pp. 470–479.