41 papers:
CASE-2015-ChenW #design #probability #robust- H∞ robust filter design for a class of nonlinear stochastic poisson jump systems (BSC, CFW), pp. 1557–1561.
DAC-2015-XieLXCJJ- Jump test for metallic CNTs in CNFET-based SRAM (FX, XL, QX, KC, NJ, LJ), p. 6.
CIAA-2015-FernauPS #automaton #complexity #finite- Jumping Finite Automata: Characterizations and Complexity (HF, MP, MLS), pp. 89–101.
ICML-2015-HugginsNSM #markov #named #process- JUMP-Means: Small-Variance Asymptotics for Markov Jump Processes (JHH, KN, AS, VKM), pp. 693–701.
OOPSLA-2015-BlackshearCS #abstraction #control flow- Selective control-flow abstraction via jumping (SB, BYEC, MS), pp. 163–182.
CHI-2014-SilpasuwanchaiR #exclamation #gesture- Jump and shoot!: prioritizing primary and alternative body gestures for intense gameplay (CS, XR), pp. 951–954.
MoDELS-2014-BergmayrGWK #java #named #uml- JUMP — From Java Annotations to UML Profiles (AB, MG, MW, GK), pp. 552–568.
MoDELS-2014-BergmayrGWK #java #named #uml- JUMP — From Java Annotations to UML Profiles (AB, MG, MW, GK), pp. 552–568.
LICS-CSL-2014-FioreS #algebra- Substitution, jumps, and algebraic effects (MPF, SS), p. 10.
ITiCSE-2013-German #learning- Jump-starting team-based learning in the computer science classroom (DAG), p. 323.
CASE-2012-WuY #estimation #linear #markov #metric #using- State estimation for Markovian Jump Linear System using quantized measurements (HW, HY), pp. 527–531.
DATE-2011-SafarESS #configuration management #pipes and filters #satisfiability- A reconfigurable, pipelined, conflict directed jumping search SAT solver (MS, MWEK, MS, AS), pp. 1243–1248.
DHM-2011-OzsoyY #case study- Planar Vertical Jumping Simulation-A Pilot Study (BO, J(Y), pp. 161–170.
HPCA-2010-FarooqCJ #predict- Value Based BTB Indexing for indirect jump prediction (MUF, LC, LKJ), pp. 1–11.
ICALP-v1-2009-Nies #traceability- Superhighness and Strong Jump Traceability (AN), pp. 726–737.
SAC-2009-WangDLL #performance #process- An efficient and accurate lattice for pricing derivatives under a jump-diffusion process (CJW, TSD, YDL, YCL), pp. 966–970.
CSL-2009-AccattoliG- Jumping Boxes (BA, SG), pp. 55–70.
SPLC-2008-Dalgarno #clone detection #detection #product line- Jump-Starting Software Product Lines with Clone Detection (AMD), p. 351.
ASPLOS-2008-JoaoMKAP #object-oriented #performance- Improving the performance of object-oriented languages with dynamic predication of indirect jumps (JAJ, OM, HK, RA, YNP), pp. 80–90.
ICFP-2007-Herman #functional #how- Functional pearl: the great escape or, how to jump the border without getting caught (DH), pp. 157–164.
CHI-2007-HachetPTG #agile #mobile- “Jump and refine” for rapid pointing on mobile phones (MH, JP, FT, PG), pp. 167–170.
CHI-2006-AhlstromAH #comparison #interactive #standard- Improving menu interaction: a comparison of standard, force enhanced and jumping menus (DA, RA, MH), pp. 1067–1076.
ICPR-v1-2006-RiponTKI #algorithm #clustering #multi #search-based #using- Multi-Objective Evolutionary Clustering using Variable-Length Real Jumping Genes Genetic Algorithm (KSNR, CHT, SK, MKI), pp. 1200–1203.
CSL-2006-GiamberardinoF #parallel #proving- Jump from Parallel to Sequential Proofs: Multiplicatives (PDG, CF), pp. 319–333.
SAT-2006-Zhang #random- A Complete Random Jump Strategy with Guiding Paths (HZ), pp. 96–101.
KDD-2005-ZaianeE #traversal- Pattern lattice traversal by selective jumps (ORZ, MEH), pp. 729–735.
FASE-2002-KumarH #slicing #source code- Better Slicing of Programs with Jumps and Switches (SK, SH), pp. 96–112.
IWPC-J-1999-CifuentesE01- Recovery of jump table case statements from binary code (CC, MVE), pp. 171–188.
ICML-2000-LiRD #algorithm #incremental #maintenance- The Space of Jumping Emerging Patterns and Its Incremental Maintenance Algorithms (JL, KR, GD), pp. 551–558.
IWPC-1999-CifuentesE- Recovery of Jump Table Case Statements from Binary Code (CC, MVE), pp. 192–199.
SAS-1997-UhW #branch #performance- Coalescing Conditional Branches into Efficient Indirect Jumps (GRU, DBW), pp. 315–329.
STOC-1997-NisanB #concurrent #pointer- Pointer Jumping Requires Concurrent Read (NN, ZBY), pp. 549–558.
DLT-1997-TipleaM #petri net- Jumping Petri Nets — Specific Properties (FLT, EM), pp. 461–476.
ICPR-1996-HuangHH #adaptation #estimation #performance #video- Adaptive early jump-out technique for fast motion estimation in video coding (HCH, YPH, WLH), pp. 864–868.
PLILP-1995-DawsonRR #design #implementation #logic programming #performance #source code- Design and Implementation of Jump Tables for Fast Indexing of Logic Programs (SD, CRR, IVR), pp. 133–150.
PLDI-1994-Agrawal #on the #slicing #source code- On Slicing Programs with Jump Statements (HA), pp. 302–312.
PLDI-1993-GroveT #case study #constant #implementation #interprocedural- Interprocedural Constant Propagation: A Study of Jump Function Implementations (DG, LT), pp. 90–99.
PLDI-1992-MuellerW #replication- Avoiding Unconditional Jumps by Code Replication (FM, DBW), pp. 322–330.
LFP-1988-FelleisenWFD #continuation #semantics- Abstract Continuations: A Mathematical Semantics for Handling Full Jumps (MF, MW, DPF, BFD), pp. 52–62.
ICALP-1977-SavitchV #linear #multi #simulation #turing machine- Linear Time Simulation of Multihead Turing Machines with Head-to-Head Jumps (WJS, PMBV), pp. 453–464.
STOC-1973-Greibach #context-free grammar #polynomial- Jump PDA’s, Deterministic Context-Free Languages Principal AFDLs and Polynomial Time Recognition-Extended Abstract (SAG), pp. 20–28.