14 papers:
DHM-HM-2015-KitajimaKMMMH #analysis #comprehension #process- Process Analysis of Manufacturing of Sewing Scissors by All Forging Process and Understanding of Its Sharpness (YK, KK, MM, KM, YM, HH), pp. 124–132.
KEOD-2014-Exman #named- Opinion-Ontologies — Short and Sharp (IE), pp. 454–458.
ICML-c3-2013-DurrantK #bound #classification #fault- Sharp Generalization Error Bounds for Randomly-projected Classifiers (RJD, AK), pp. 693–701.
ICPR-2012-KumarCD #documentation #estimation #image- Sharpness estimation for document and scene images (JK, FC, DSD), pp. 3292–3295.
ICPR-2012-YanXY0 #image #novel- Image super-resolution based on a novel edge sharpness prior (QY, YX, XY, KC), pp. 1056–1059.
SAC-2008-GoldsztejnMR #algorithm #approximate #performance #quantifier- An efficient algorithm for a sharp approximation of universally quantified inequalities (AG, CM, MR), pp. 134–139.
ICALP-2007-FellowsFHV #graph- Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs (MRF, GF, DH, SV), pp. 340–351.
STOC-2004-GoelRK #geometry #graph #random- Sharp thresholds For monotone properties in random geometric graphs (AG, SR, BK), pp. 580–586.
CHI-2004-McCarthySM #video- Sharp or smooth?: comparing the effects of quantization vs. frame rate for streamed video (JDM, MAS, DM), pp. 535–542.
SOSP-2003-FuCCSV #architecture #named- SHARP: an architecture for secure resource peering (YF, JSC, BNC, SS, AV), pp. 133–148.
STOC-2001-AchlioptasBM #complexity #proving- A sharp threshold in proof complexity (DA, PB, MSOM), pp. 337–346.
STOC-2001-BorgsCP #clustering #integer #problem #scalability- Sharp threshold and scaling window for the integer partitioning problem (CB, JTC, BP), pp. 330–336.
KDD-1998-Domingos- Occam’s Two Razors: The Sharp and the Blunt (PMD), pp. 37–43.
DAC-1981-ChibaOKNIK #layout #named- SHARPS: A hierarchical layout system for VLSI (TC, NO, TK, IN, TI, SK), pp. 820–827.