BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Used together with:
sweep (15)
garbag (11)
collect (10)
use (9)
time (8)

Stem mark$ (all stems)

84 papers:

CASECASE-2015-HeLG #graph #optimisation
Cycle time optimization of deterministic timed weighted marked graphs (ZH, ZL, AG), pp. 274–279.
ICALPICALP-v1-2015-LiP #fibonacci
Replacing Mark Bits with Randomness in Fibonacci Heaps (JL, JP), pp. 886–897.
HCIDHM-HM-2015-NishimuraK #case study #learning
A Study on Learning Effects of Marking with Highlighter Pen (HN, NK), pp. 357–367.
CASECASE-2014-HeLG #graph #optimisation
Marking optimization of deterministic timed weighted marked graphs (ZH, ZL, AG), pp. 413–418.
LATALATA-2014-BestD #bound #graph #petri net
Characterisation of the State Spaces of Live and Bounded Marked Graph Petri Nets (EB, RRD), pp. 161–172.
ISMMISMM-2013-MorikawaUI #adaptation #garbage collection #lisp
Adaptive scanning reduces sweep time for the Lisp2 mark-compact garbage collector (KM, TU, HI), pp. 15–26.
CHICHI-2012-GuimbretiereN #interactive
Bimanual marking menu for near surface interactions (FG, CN), pp. 825–828.
ICPRICPR-2012-BoresB #monitoring #process
Urban traffic monitoring from aerial LIDAR data with a Two-Level Marked Point Process model (AB, CB), pp. 1379–1382.
ICPRICPR-2012-IshidaKKN #generative #recognition #using
Road marking recognition for map generation using sparse tensor voting (HI, KK, YK, TN), pp. 1132–1135.
RERE-2012-GordonB #case study #multi #requirements
Reconciling multi-jurisdictional legal requirements: A case study in requirements water marking (DGG, TDB), pp. 91–100.
ISMMISMM-2012-IyengarGWM #concurrent #parallel #scalability
Scalable concurrent and parallel mark (BI, EFG, MW, KM), pp. 61–72.
ITiCSEITiCSE-2011-TremblayL
A marking language for the oto assignment marking tool (GT, PL), pp. 148–152.
PLATEAUPLATEAU-2011-KleinschmagerH #case study #how #programming #self
How to rate programming skills in programming experiments?: a preliminary, exploratory, study based on university marks, pretests, and self-estimation (SK, SH), pp. 15–24.
ISMMISMM-2011-VeldemaP #gpu
Iterative data-parallel mark&sweep on a GPU (RV, MP), pp. 1–10.
ECSAECSA-2010-BerrocalGM #design pattern #requirements
Facilitating the Selection of Architectural Patterns by Means of a Marked Requirements Model (JB, JGA, JMM), pp. 384–391.
CASECASE-2010-BorsuYP #automation #detection
Automated surface deformations detection and marking on automotive body panels (VB, AY, PP), pp. 551–556.
ITiCSEITiCSE-2010-AhmadzadehS #eclipse #java #named #plugin #student
JavaMarker: an eclipse plug-in to mark students’ Java exercises (MA, MS), p. 324.
CHICHI-2010-LepinskiGF #design #evaluation #multi
The design and evaluation of multitouch marking menus (GJL, TG, GWF), pp. 2233–2242.
DRRDRR-2009-SmithNL #detection
Mark Detection from Scanned Ballots (EHBS, GN, DPL), pp. 1–10.
ICDARICDAR-2009-XiuLBNS #recognition
Style-Based Ballot Mark Recognition (PX, DPL, HSB, GN, EHBS), pp. 216–220.
ITiCSEITiCSE-2009-ThomasWS #automation #diagrams #tool support
Generalised diagram revision tools with automatic marking (PGT, KGW, NS), pp. 318–322.
ICFPICFP-2009-McCarthy #automation #composition #continuation #rest #web
Automatically RESTful web applications: marking modular serializable continuations (JAM), pp. 299–310.
HCIHCI-VAD-2009-JelinSDMB #education #human-computer #question
HCI Professional Involvement in k-12 Education: On Target or Missing the Mark? (MJ, AS, JD, DM, DB), pp. 111–118.
ICEISICEIS-J-2009-SiepermannS #automation #generative
e-Learning in Logistics Cost Accounting Automatic Generation and Marking of Exercises (MS, CS), pp. 665–676.
SACSAC-2009-FloraTB #forensics #identification #image #using
Forensic bite mark identification using image processing methods (GF, MT, HB), pp. 903–907.
PLDIPLDI-2008-BlackburnM #garbage collection #named #performance
Immix: a mark-region garbage collector with space efficiency, fast collection, and mutator performance (SMB, KSM), pp. 22–32.
ICPRICPR-2008-SmithLN #detection
Ballot mark detection (EHBS, DPL, GN), pp. 1–4.
ISMMISMM-2008-Siebert #garbage collection #parallel
Limits of parallel marking garbage collection (FS), pp. 21–29.
ITiCSEITiCSE-2007-TremblayLS #testing
Extending a marking tool with simple support for testing (GT, LL, AS), p. 313.
CHICHI-2007-RamosB
Pressure marks (GAR, RB), pp. 1375–1384.
SACSAC-2007-DjemaielB
A global marking scheme for tracing cyber attacks (YD, NB), pp. 170–174.
ISMMISMM-2007-GarnerBF #effectiveness #garbage collection
Effective prefetch for mark-sweep garbage collection (RG, SMB, DF), pp. 43–54.
ISMMISMM-2007-StanchinaM #algorithm #implementation #realtime
Mark-sweep or copying?: a “best of both worlds” algorithm and a hardware-supported real-time implementation (SS, MM), pp. 173–182.
ITiCSEITiCSE-2006-GrayH #approach #user interface #visual notation
An introspective approach to marking graphical user interfaces (GRG, CAH), pp. 43–47.
ITiCSEITiCSE-2006-ThomasWS #automation #using
Using patterns in the automatic marking of ER-diagrams (PGT, KGW, NS), pp. 83–87.
TACASTACAS-2006-BrownP #protocol #verification
Easy Parameterized Verification of Biphase Mark and 8N1 Protocols (GMB, LP), pp. 58–72.
DLTDLT-2006-Lakshmanan
End-Marked Maximal Depth-First Contextual Grammars (LK), pp. 339–350.
IFLIFL-2006-Kozsik #proving #type system
Proving Program Properties Specified with Subtype Marks (TK), pp. 163–180.
ICGTICGT-2006-BerwangerJ #automaton #graph
Automata on Directed Graphs: Edge Versus Vertex Marking (DB, DJ), pp. 46–60.
CHICHI-2006-ZhaoAH #multi #using
Zone and polygon menus: using relative position to increase the breadth of multi-stroke marking menus (SZ, MA, KH), pp. 1077–1086.
ICPRICPR-v1-2006-PerrinDZ #2d #3d #assessment #parametricity #process #using
2D and 3D Vegetation Resource Parameters Assessment using Marked Point Processes (GP, XD, JZ), pp. 1–4.
SACSAC-2006-SharminAA #adaptation #middleware #resource management #self #usability #using
Ubicomp assistant: an omnipresent customizable service using MARKS (middleware adaptability for resource discovery, knowledge usability and self-healing) (MS, SA, SIA), pp. 1013–1017.
ISMMISMM-2006-SagonasW
Mark and split (KFS, JW), pp. 29–39.
ITiCSEITiCSE-2005-ThomasWS #automation
Experiments in the automatic marking of ER-diagrams (PGT, KGW, NS), pp. 158–162.
STOCSTOC-2005-AdlerEM #probability #towards
Towards asymptotic optimality in probabilistic packet marking (MA, JE, JM), pp. 450–459.
CEFPCEFP-2005-Kozsik #tutorial #type system
Tutorial on Subtype Marks (TK), pp. 191–222.
CGOCGO-2005-NandivadaD #concurrent
Compile-Time Concurrent Marking Write Barrier Removal (VKN, DD), pp. 37–48.
ITiCSEITiCSE-2004-BlumensteinGNM #analysis #automation #game studies
An experimental analysis of GAME: a generic automated marking environment (MB, SG, AN, VM), pp. 67–71.
KDDKDD-2004-Poole #approach
Estimating the size of the telephone universe: a Bayesian Mark-recapture approach (DP), pp. 659–664.
ASPLOSASPLOS-2004-CherHV #analysis #garbage collection #hardware
Software prefetching for mark-sweep garbage collection: hardware analysis and software redesign (CYC, ALH, TNV), pp. 199–210.
ISMMISMM-2004-OssiaBS #concurrent #garbage collection
Mostly concurrent compaction for mark-sweep GC (YO, OBY, MS), pp. 25–36.
ICDARICDAR-2003-BertucciPM
Text Selection by Structured Light Marking for Hand-held Cameras (EB, MP, MM), p. 555–?.
ICDARICDAR-2003-Kasturi #detection
Detection of Text Marks on Moving Vehicles Vladimir Y. Mariano (RK), pp. 393–397.
ITiCSEITiCSE-2003-Thomas #evaluation
The evaluation of electronic marking of examinations (PT), pp. 50–54.
OOPSLAOOPSLA-2003-AzatchiLPP #garbage collection #on the fly
An on-the-fly mark and sweep garbage collector based on sliding views (HA, YL, HP, EP), pp. 269–281.
OOPSLAOOPSLA-2003-SachindranEM #garbage collection #named #performance
Mark-copy: fast copying GC with less space overhead (NS, JEBM), pp. 326–343.
VLDBVLDB-2002-SchmidtWKCMB #benchmark #data transformation #metric #named #xml
XMark: A Benchmark for XML Data Management (AS, FW, MLK, MJC, IM, RB), pp. 974–985.
ITiCSEITiCSE-2002-HigginsST
The marking system for CourseMaster (CH, PS, AT), pp. 46–50.
STOCSTOC-2002-Adler #probability #trade-off
Tradeoffs in probabilistic packet marking for IP traceback (MA), pp. 407–418.
KDDKDD-2002-BennettME #algorithm #kernel #modelling #named
MARK: a boosting algorithm for heterogeneous kernel models (KPB, MM, MJE), pp. 24–31.
ICLPICLP-2002-DemoenNV #garbage collection #question
Copying Garbage Collection for the WAM: To Mark or Not to Mark? (BD, PLN, RV), pp. 194–208.
GPCESAIG-2001-SasanoHT #generative #multi #performance #problem #source code
Generation of Efficient Programs for Solving Maximum Multi-marking Problems (IS, ZH, MT), pp. 72–91.
SACSAC-2000-Khalili #assembly #using
Using Pads Instead of Fiducial Marks in Vision Assisted Assembly of PCB’s (KK), pp. 5–9.
ITiCSEITiCSE-1999-PrestonS #assessment #online
Improving on-line assessment: an investigation of existing marking methodologies (JAP, RLS), pp. 29–32.
ICSEICSE-1999-NishimatsuJKI #performance #slicing
Call-Mark Slicing: An Efficient and Economical Way of Reducing Slice (AN, MJ, SK, KI), pp. 422–431.
ITiCSEITiCSE-1998-JoyL #assessment #effectiveness #online
Effective electronic marking for on-line assessment (MJ, ML), pp. 134–138.
ISMMISMM-1998-AzaguryKPY #how #set
Combining Card Marking with Remembered Sets: How to Save Scanning Time (AA, EKK, EP, ZY), pp. 10–19.
ISMMISMM-1998-ColnetCZ #algorithm #compilation
Compiler Support to Customize the Mark and Sweep Algorithm (DC, PC, OZ), pp. 154–165.
ISMMISMM-1998-HuelsbergenW #concurrent #garbage collection
Very Concurrent Mark-&-Sweep Garbage Collection without Fine-Grain Synchronization (LH, PW), pp. 166–175.
ISMMISMM-1998-SmithM
Comparing Mostly-Copying and Mark-Sweep Conservative Collection (FS, JGM), pp. 68–78.
ICDARICDAR-v2-1995-LiangAS #approach #segmentation #using
Segmentation of interference marks using morphological approach (SL, MA, MS), pp. 1042–1046.
ISMMIWMM-1995-ArmstrongV #garbage collection #realtime
One Pass Real-Time Generational Mark-Sweep Garbage Collection (JLA, RV), pp. 313–322.
ISMMIWMM-1995-MaedaKITHN #garbage collection #on the fly
On-the-fly Global Garbage Collection Based on Partly Mark-Sweep (MM, HK, YI, TT, AH, JN), pp. 283–296.
ISMMIWMM-1995-Piquer #distributed #garbage collection
Indirect Mark and Sweep: A Distributed GC (JMP), pp. 267–282.
RTARTA-1995-Holmes #equation #proving #recursion #theorem
Disguising Recursively Chained Rewrite Rules as Equational Theorems, as Implemented in the Prover EFTTP Mark 2 (MRH), pp. 432–437.
CHICHI-1994-Kidd94a #information management
The marks are on the knowledge worker (AK), pp. 186–191.
CHICHI-1994-KurtenbachB94a #learning #performance
User learning and performance with marking menus (GK, WB), pp. 258–264.
CHIINTERCHI-1993-KurtenbachB #performance #using
The limits of expert performance using hierarchic marking menus (GK, WB), pp. 482–487.
POPLPOPL-1992-Edelson #c++
A Mark-and-Sweep Collector for C++ (DRE), pp. 51–58.
ICTSSIWPTS-1991-HeZL #design
A Bench Mark on the Design of Ferry Based Test Systems (CSH, HXZ, FL), pp. 119–130.
HTECHT-1990-IrlerB #hypermedia
Non-Intrusive Hypertext Anchors and Individual Colour Markings (WJI, GB), pp. 261–273.
LISPLFP-1990-Zorn #garbage collection
Comparing Mark-and-Sweep and Stop-and-Copy Garbage Collection (BGZ), pp. 87–98.
PODSPODS-1984-Lipski #algebra #on the #relational
On Relational Algebra with Marked Nulls (WLJ), pp. 201–203.
POPLPOPL-1983-BackMR #algorithm #graph #performance
Derivation of Efficient DAG Marking Algorithms (RJB, HM, KJR), pp. 20–27.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.