19 papers:
ICDAR-2013-FornesOL #image #multi- Show-Through Cancellation and Image Enhancement by Multiresolution Contrast Processing (AF, XO, JL), pp. 200–204.
SAC-2013-LimaBM- Broadcast cancellation in search mechanisms (RL, CB, HM), pp. 548–553.
ICALP-v1-2011-Varadaraja #approximate #problem- Buyback Problem — Approximate Matroid Intersection with Cancellation Costs (ABV), pp. 379–390.
DAC-2010-YangLW #complexity #fault #named- ECR: a low complexity generalized error cancellation rewiring scheme (XY, TKL, YLW), pp. 511–516.
ICPR-2010-OudaTN- Tokenless Cancelable Biometrics Scheme for Protecting Iris Codes (OO, NT, TN), pp. 882–885.
ICPR-2010-WangH #multi #random #recognition #using- Cancelable Face Recognition Using Random Multiplicative Transform (YW, DH), pp. 1261–1264.
HPCA-2010-QureshiFL #performance- Improving read performance of Phase Change Memories via Write Cancellation and Write Pausing (MKQ, MF, LALM), pp. 1–11.
PADL-2009-SuleimanM #concurrent #implementation #parallel #prolog #thread- Implementing Thread Cancellation in Multithreaded Prolog Systems (AS, JM), pp. 122–136.
LATA-2008-CainORT #automation- Automatic Presentations for Cancellative Semigroups (AJC, GPO, NR, RMT), pp. 149–159.
ICGT-2008-Aalst #consistency #verification #workflow- Discovery, Verification and Conformance of Workflows with Cancellation (WMPvdA), pp. 18–37.
ICPR-2008-ThomasRCB #analysis #comparative- Comparative analysis of registration based and registration free methods for cancelable fingerprint biometrics (AOT, NKR, JHC, RMB), pp. 1–4.
LATA-2007-FrancezK #automaton- Pushdown automata with cancellation and commutation-augmented pregroups grammars (NF, MK), pp. 7–26.
ICPR-v4-2006-RathaCBC #case study- Cancelable Biometrics: A Case Study in Fingerprints (NKR, JHC, RMB, SC), pp. 370–373.
DATE-DF-2004-KruppMO #model checking #refinement- Formal Refinement and Model Checking of an Echo Cancellation Unit (AK, WM, IO), pp. 102–107.
ICPR-v3-2004-SavvidesKK04a #recognition- Cancelable Biometric Filters for Face Recognition (MS, BVKVK, PKK), pp. 922–925.
DAC-2003-RenG #performance- Synthesizing optimal filters for crosstalk-cancellation for high-speed buses (JR, MRG), pp. 592–597.
CADE-1996-GanzingerW #monad #proving #theorem proving- Theorem Proving in Cancellative Abelian Monoids (Extended Abstract) (HG, UW), pp. 388–402.
STOC-1988-GoldbergT #low cost- Finding Minimum-Cost Circulations by Canceling Negative Cycles (AVG, RET), pp. 388–397.
ICALP-1984-RestivoR #formal method #permutation- Cancellation, Pumping and Permutation in Formal Languages (AR, CR), pp. 414–422.