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:
set (8)
model (7)
data (7)
analysi (6)
base (5)

Stem hit$ (all stems)

51 papers:

SIGMODSIGMOD-2015-PengW #probability #query
k-Hit Query: Top-k Query with Probabilistic Utility Function (PP, RCWW), pp. 577–592.
ICALPICALP-v1-2015-GiannopoulouJLS #complexity #kernel
Uniform Kernelization Complexity of Hitting Forbidden Minors (ACG, BMPJ, DL, SS), pp. 629–641.
HCIDHM-HM-2015-ChottikamponMMM #process
Improvement of Needle Bar in Textile Machine by Hitting Process (KC, SM, HM, RM, HN, HH), pp. 235–244.
RecSysRecSys-2015-JannachLK #continuation #generative #music
Beyond “Hitting the Hits”: Generating Coherent Music Playlist Continuations with the Right Tracks (DJ, LL, IK), pp. 187–194.
STOCSTOC-2014-ForbesSS #algebra #branch #multi #order #set #source code
Hitting sets for multilinear read-once algebraic branching programs, in any order (MAF, RS, AS), pp. 867–875.
CIKMCIKM-2014-ChenHH #named #predict #video
Clairvoyant: An Early Prediction System For Video Hits (HC, QH, LH), pp. 2054–2056.
DATEDATE-2013-El-NacouziAPZJM #detection #scalability
A dual grain hit-miss detector for large die-stacked DRAM caches (MEN, IA, MP, JZ, NDEJ, AM), pp. 89–92.
STOCSTOC-2013-AgrawalSS
Quasi-polynomial hitting-set for set-depth-Δ formulas (MA, CS, NS), pp. 321–330.
STOCSTOC-2012-AgrawalSSS #bound
Jacobian hits circuits: hitting-sets, lower bounds for depth-D occur-k formulas & depth-3 transcendence degree-k circuits (MA, CS, RS, NS), pp. 599–614.
CIKMCIKM-2012-DybalaRAS #analysis #comparative #generative #ranking
Data filtering in humor generation: comparative analysis of hit rate and co-occurrence rankings as a method to choose usable pun candidates (PD, RR, KA, KS), pp. 2587–2590.
ICDARICDAR-2011-ZhouCWGL #database #empirical #evaluation
An Empirical Evaluation on HIT-OR3C Database (SZ, QC, XW, XG, HL), pp. 1150–1154.
ICEISICEIS-v2-2011-LiOAK #fault #identification #modelling #network #using
Patterns Identification for Hitting Adjacent Key Errors Correction using Neural Network Models (JL, KO, MSA, HBK), pp. 5–12.
SIGIRSIGIR-2011-KazaiKKM #comparative #crowdsourcing #design #evaluation #ranking
Crowdsourcing for book search evaluation: impact of hit design on comparative system ranking (GK, JK, MK, NMF), pp. 205–214.
ESEC-FSEESEC-FSE-2011-RahmanPHBD #question
BugCache for inspections: hit or miss? (FR, DP, AH, ETB, PTD), pp. 322–331.
DATEDATE-2010-HuangCLH #robust
A robust ADC code hit counting technique (JLH, KYC, MHL, XLH), pp. 1749–1754.
KDDKDD-2009-DengLK #algorithm #graph
A generalized Co-HITS algorithm and its application to bipartite graphs (HD, MRL, IK), pp. 239–248.
SIGIRSIGIR-2009-PesericoP #convergence #rank
Score and rank convergence of HITS (EP, LP), pp. 770–771.
SACSAC-2009-HijikataHON #algorithm #analysis #using
HITS algorithm improvement using anchor-related text extracted by DOM structure analysis (YH, BQH, MO, SN), pp. 1691–1698.
DACDAC-2008-ReyNKKAHCS #question
DFM in practice: hit or hype? (JCR, NSN, ABK, FK, RA, CH, LC, VS), pp. 898–899.
ICALPICALP-A-2008-BlaserHS #set
Asymptotically Optimal Hitting Sets Against Polynomials (MB, MH, DS), pp. 345–356.
CSCWCSCW-2008-MorrisTB #collaboration #personalisation #web
Enhancing collaborative web search with personalization: groupization, smart splitting, and group hit-highlighting (MRM, JT, SB), pp. 481–484.
CIKMCIKM-2008-MeiZC #query #using
Query suggestion using hitting time (QM, DZ, KWC), pp. 469–478.
HCIHCI-IPT-2007-BartneckAK #interface #rating
Hit Me Baby One More Time: A Haptic Rating Interface (CB, PA, TK), pp. 743–747.
CIKMCIKM-2007-Najork #effectiveness
Comparing the effectiveness of hits and salsa (MN), pp. 157–164.
SIGIRSIGIR-2007-JurczykA #analysis #ranking
Hits on question answer portals: exploration of link analysis for author ranking (PJ, EA), pp. 845–846.
SIGIRSIGIR-2007-MizzaroR #analysis #evaluation #information retrieval #network
Hits hits TREC: exploring IR evaluation results with network analysis (SM, SR), pp. 479–486.
SIGIRSIGIR-2007-NajorkZT #how #question #web
Hits on the web: how does it compare? (MN, HZ, MJT), pp. 471–478.
SACSAC-2007-SchusterS #documentation #estimation #natural language #query #random #web
NL sampler: random sampling of web documents based on natural language with query hit estimation (DS, AS), pp. 812–818.
ECIRECIR-2006-SongXSWM #web
Exploring URL Hit Priors for Web Search (RS, GX, SS, JRW, WYM), pp. 277–288.
ICPRICPR-v3-2006-LouJ #adaptation #classification #nearest neighbour #novel
Novel Adaptive Nearest Neighbor Classifiers Based On Hit-Distance (ZL, ZJ), pp. 87–90.
ICPRICPR-v3-2006-ZhangDC #analysis #detection #game studies
Ball Hit Detection in Table Tennis Games Based on Audio Analysis (BZ, WD, LC), pp. 220–223.
SIGIRSIGIR-2006-KurlandL #clustering #exclamation #modelling
Respect my authority!: HITS without hyperlinks, utilizing cluster-based language models (OK, LL), pp. 83–90.
KDDKDD-2005-NorenOB #database #detection #safety
A hit-miss model for duplicate detection in the WHO drug safety database (GNN, RO, AB), pp. 459–468.
PADLPADL-2005-BaileyS #constraints #satisfiability #set #using
Discovery of Minimal Unsatisfiable Subsets of Constraints Using Hitting Set Dualization (JB, PJS), pp. 174–186.
STOCSTOC-2004-LovaszV
Hit-and-run from a corner (LL, SV), pp. 310–314.
HPCAHPCA-2004-LiuSK #memory management
Organizing the Last Line of Defense before Hitting the Memory Wall for CMP (CL, AS, MTK), pp. 176–185.
CHICHI-2002-ZhaiSA #learning
Movement model, hits distribution and learning in virtual keyboarding (SZ, AES, JA), pp. 17–24.
SIGIRSIGIR-2002-DingHHZS #analysis #framework #rank
PageRank, HITS and a unified framework for link analysis (CHQD, XH, PH, HZ, HDS), pp. 353–354.
RERE-2002-CrookILN #anti #requirements #security
Security Requirements Engineering: When Anti-Requirements Hit the Fan (RC, DCI, LL, BN), pp. 203–205.
SIGIRSIGIR-2001-MillerRS #algorithm #matrix #using
Modifications of Kleinberg’s HITS Algorithm Using Matrix Exponentiation and WebLog Records (JCM, GR, FS), pp. 444–445.
SIGIRSIGIR-1999-Eastman #internet #precise
30, 000 Hits may be Better than 300: Precision Anomalies in Internet Searches (poster abstract) (CME), pp. 313–314.
ICSMEICSM-1998-JonesKMPS #evolution #modelling #quality
Hitting the Moving Target: Trials and Tribulations of Modeling Quality in Evolving Software Systems (WDJ, TMK, JCM, TTP, GES), pp. 66–67.
ICSMEICSM-1998-KhoshgoftaarA #quality #question
Can a Software Quality Model Hit a Moving Target? (TMK, EBA), pp. 68–70.
ICALPICALP-1996-AndreevCR #set
Hitting Sets Derandomize BPP (AEA, AEFC, JDPR), pp. 357–368.
ICDARICDAR-v1-1995-LiangLY #query
False hits of tri-syllabic queries in a Chinese signature file (TL, SYL, WPY), pp. 159–162.
CIKMCIKM-1994-RoseG #classification #database
Hierarchical Classification as an Aid to Database and Hit-List Browsing (JRR, JG), pp. 408–414.
ICSEICSE-1994-Curtis #process
A Process for Hitting Paydirt (BC), p. 369.
STOCSTOC-1993-LinialLSZ #combinator #performance #set
Efficient construction of a small hitting set for combinatorial rectangles in high dimension (NL, ML, MES, DZ), pp. 258–267.
VLDBVLDB-1990-DanDY #data access
The Effect of Skewed Data Access on Buffer Hits and Data Contention an a Data Sharing Environment (AD, DMD, PSY), pp. 419–431.
VLDBVLDB-1985-Zlatuska #database #functional #perspective
Hit Data Model Data Bases from the Functional Point of View (JZ), pp. 470–477.
DACDAC-1983-TsukizoeSKF
MACH : a high-hitting pattern checker for VLSI mask data (AT, JS, TK, HF), pp. 726–731.

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.