25 papers:
- ICALP-v1-2015-NayyeriS #distance
- Computing the Fréchet Distance Between Polygons with Holes (AN, AS), pp. 997–1009.
- CASE-2014-KanagarajPL #algorithm #optimisation #process
- Application of a hybridized cuckoo search-genetic algorithm to path optimization for PCB holes drilling process (GK, SGP, WCEL), pp. 373–378.
- DATE-2014-ZhangWSX #clustering
- Lifetime holes aware register allocation for clustered VLIW processors (XZ, HW, HS, JX), pp. 1–4.
- PLDI-2013-GaoSBMBL #runtime #smarttech #using
- Using managed runtime systems to tolerate holes in wearable memories (TG, KS, SMB, KSM, DB, JRL), pp. 297–308.
- CSCW-2013-GaoHZ #how #network #social
- Closure vs. structural holes: how social network information and culture affect choice of collaborators (GG, PJH, CZ), pp. 5–18.
- CASE-2012-KimKS #algorithm #detection #recognition #using
- Hole detection algorithm for square peg-in-hole using force-based shape recognition (YLK, BSK, JBS), pp. 1074–1079.
- ICPR-2012-HeCS #algorithm #component
- A new algorithm for labeling connected-components and calculating the Euler number, connected-component number, and hole number (LH, YC, KS), pp. 3099–3102.
- PLDI-2011-SrivastavaBMS #api #detection #implementation #multi #policy #security #using
- A security policy oracle: detecting security holes using multiple API implementations (VS, MDB, KSM, VS), pp. 343–354.
- AFL-2011-Blanchet-SadriNT #on the #word
- On Operations Preserving Primitivity of Partial Words with One Hole (FBS, SN, AT), pp. 93–107.
- LATA-2011-Blanchet-SadriBZ #word
- Unary Pattern Avoidance in Partial Words Dense with Holes (FBS, KB, AZ), pp. 155–166.
- SAC-2010-MiaoOWS #distributed #network #using
- Coverage-hole trap model in target tracking using distributed relay-robot network (HM, CCO, XW, CS), pp. 1299–1304.
- LATA-2009-Blanchet-SadriABM #how #question #word
- How Many Holes Can an Unbordered Partial Word Contain? (FBS, EA, CB, RM), pp. 176–187.
- HCD-2009-YambalM #experience #user interface
- Plugging the Holes: Increasing the Impact of User Experience Evaluations (SSY, SM), pp. 147–156.
- HIMI-DIE-2009-ShinPC #bound #detection
- Virtual Convex Polygon Based Hole Boundary Detection and Time Delay Based Hole Detour Scheme in WSNs (IS, NDP, HC), pp. 619–627.
- ISSTA-2009-AdlerFKPRSUZ #analysis #string #test coverage #using
- Advanced code coverage analysis using substring holes (YA, EF, MK, DP, OR, MS, SU, AZ), pp. 37–46.
- SEFM-2008-Giacobazzi08a #obfuscation
- Hiding Information in Completeness Holes: New Perspectives in Code Obfuscation and Watermarking (RG), pp. 7–18.
- DATE-2005-MellorWM #uml #why
- Why Systems-on-Chip Needs More UML like a Hole in the Head (SJM, JRW, CM), pp. 834–835.
- VLDB-2005-BuLN #summary
- MDL Summarization with Holes (SB, LVSL, RTN), pp. 433–444.
- CHI-2004-LecuyerBE #interface #pseudo
- Feeling bumps and holes without a haptic interface: the perception of pseudo-haptic textures (AL, JMB, LE), pp. 239–246.
- ICPR-v4-2004-MarkouS #feature model
- Feature Selection based on a Black Hole Model of Data Reorganization (MM, SS), pp. 565–568.
- DAC-2002-LachishMUZ #analysis #functional
- Hole analysis for functional coverage data (OL, EM, SU, AZ), pp. 807–812.
- ICALP-2000-AtseriasGG #principle #proving
- Monotone Proofs of the Pigeon Hole Principle (AA, NG, RG), pp. 151–162.
- IFL-1998-Reid #implementation
- Putting the Spine Back in the Spineless Tagless G-Machine: An Implementation of Resumable Black-Holes (AR), pp. 186–199.
- POPL-1998-Minamide #data type #functional #representation
- A Functional Representation of Data Structures with a Hole (YM), pp. 75–84.
- ICALP-1982-Lingas #power of
- The Power of Non-Rectilinear Holes (AL), pp. 369–383.