Stem neighborhood$ (all stems)
90 papers:
- CHI-2015-MullerHHW #design
- Practice-based Design of a Neighborhood Portal: Focusing on Elderly Tenants in a City Quarter Living Lab (CM, DH, TH, VW), pp. 2295–2304.
- CHI-2015-PaterMM #online
- This Digital Life: A Neighborhood-Based Study of Adolescents’ Lives Online (JAP, ADM, EDM), pp. 2305–2314.
- CSCW-2015-Erete #behaviour #communication #how #online
- Engaging Around Neighborhood Issues: How Online Communication Affects Offline Behavior (SLE), pp. 1590–1601.
- KDD-2015-SethiYRVR #classification #machine learning #scalability #using
- Scalable Machine Learning Approaches for Neighborhood Classification Using Very High Resolution Remote Sensing Imagery (MS, YY, AR, RRV, SR), pp. 2069–2078.
- SAC-2015-MestrePN #adaptation #pipes and filters
- Adaptive sorted neighborhood blocking for entity matching with MapReduce (DGM, CESP, DCN), pp. 981–987.
- VLDB-2014-QuamarDL #graph #named #scalability
- NScale: Neighborhood-centric Analytics on Large Graphs (AQ, AD, JL), pp. 1673–1676.
- VLDB-2014-SongCY0 #constraints
- Repairing Vertex Labels under Neighborhood Constraints (SS, HC, JXY, LC), pp. 987–998.
- CHI-2014-MasdenGGGE #community #multi #social #social media
- Tensions in scaling-up community social media: a multi-neighborhood study of nextdoor (CAM, CG, REG, EG, WKE), pp. 3239–3248.
- ICEIS-v1-2014-HaddadCSM #algorithm #heuristic #named #parallel #problem #scheduling
- AIV: A Heuristic Algorithm based on Iterated Local Search and Variable Neighborhood Descent for Solving the Unrelated Parallel Machine Scheduling Problem with Setup Times (MNH, LPC, MJFS, NM), pp. 376–383.
- CIKM-2014-HanWP #classification #using
- Within-Network Classification Using Radius-Constrained Neighborhood Patterns (JH, JRW, JP), pp. 1539–1548.
- CIKM-2014-LiuWSM #recommendation
- Exploiting Geographical Neighborhood Characteristics for Location Recommendation (YL, WW, AS, CM), pp. 739–748.
- CIKM-2014-RamadanC #realtime
- Forest-Based Dynamic Sorted Neighborhood Indexing for Real-Time Entity Resolution (BR, PC), pp. 1787–1790.
- ICPR-2014-Gonzalez-CastroDC #adaptation #classification #using
- Pixel Classification Using General Adaptive Neighborhood-Based Features (VGC, JD, VC), pp. 3750–3755.
- ICPR-2014-ZhangLZ
- Transformed Neighborhood Propagation (ZZ, FZL, MBZ), pp. 3792–3797.
- RecSys-2014-AdamopoulosT14a #bias #collaboration #on the #probability #recommendation
- On over-specialization and concentration bias of recommendations: probabilistic neighborhood selection in collaborative filtering systems (PA, AT), pp. 153–160.
- SIGIR-2014-HuSL #predict #rating
- Your neighbors affect your ratings: on geographical neighborhood influence to rating prediction (LH, AS, YL), pp. 345–354.
- SAC-2014-JuniorGM #collaboration #constraints #modelling #personalisation
- Personalized collaborative filtering: a neighborhood model based on contextual constraints (EBSJ, RG, MGM), pp. 919–924.
- CASE-2013-MaHS #grid #network #smarttech
- Transmission power allocation for cooperative relay-based neighborhood area networks for smart grid (KM, GH, CJS), pp. 599–604.
- ICDAR-2013-0001LBP #approximate #documentation #graph #string #visual notation
- Near Convex Region Adjacency Graph and Approximate Neighborhood String Matching for Symbol Spotting in Graphical Documents (AD, JL, HB, UP), pp. 1078–1082.
- ICDAR-2013-GotoIFU #graph #scalability #set #using
- Analyzing the Distribution of a Large-Scale Character Pattern Set Using Relative Neighborhood Graph (MG, RI, YF, SU), pp. 3–7.
- ICALP-v1-2013-SviridenkoW #problem #scalability #set
- Large Neighborhood Local Search for the Maximum Set Packing Problem (MS, JW), pp. 792–803.
- CSCW-2013-BrushJMM
- Digital neighborhood watch: investigating the sharing of camera data amongst neighbors (AJBB, JJ, RM, FM), pp. 693–700.
- CIKM-2013-HanW #graph #mining #scalability
- Mining frequent neighborhood patterns in a large labeled graph (JH, JRW), pp. 259–268.
- ICML-c3-2013-TarlowSCSZ #learning #probability
- Stochastic k-Neighborhood Selection for Supervised and Unsupervised Learning (DT, KS, LC, IS, RSZ), pp. 199–207.
- CASE-2012-BilykM #heuristic #parallel #problem #search-based
- Variable neighborhood search-based subproblem solution procedures for a parallel shifting bottleneck heuristic for complex job shops (AB, LM), pp. 419–424.
- CIKM-2012-KimCS #graph
- Impact neighborhood indexing (INI) in diffusion graphs (JHK, KSC, MLS), pp. 2184–2188.
- CIKM-2012-RenLZZ #collaboration #performance
- The efficient imputation method for neighborhood-based collaborative filtering (YR, GL, JZ, WZ), pp. 684–693.
- CIKM-2012-WuCLXBZ #matrix #probability
- Leveraging tagging for neighborhood-aware probabilistic matrix factorization (LW, EC, QL, LX, TB, LZ), pp. 1854–1858.
- KDD-2012-GleichS #community
- Vertex neighborhoods, low conductance cuts, and good seeds for local community methods (DFG, CS), pp. 597–605.
- KDIR-2012-FormosoFCC #performance #recommendation #using
- Using Neighborhood Pre-computation to Increase Recommendation Efficiency (VF, DF, FC, VC), pp. 333–335.
- MLDM-2012-Herrera-YagueZ #network #predict
- Prediction of Telephone User Attributes Based on Network Neighborhood Information (CHY, PJZ), pp. 645–659.
- RecSys-2012-SchelterBM #pipes and filters #scalability #similarity
- Scalable similarity-based neighborhood methods with MapReduce (SS, CB, VM), pp. 163–170.
- SIGIR-2012-Cleger-TamayoFH #recommendation
- Explaining neighborhood-based recommendations (SCT, JMFL, JFH), pp. 1063–1064.
- PODS-2011-KimelfeldS #constraints
- Finding a minimal tree pattern under neighborhood constraints (BK, YS), pp. 235–246.
- SIGMOD-2011-GaoYJZWY #distance #privacy
- Neighborhood-privacy protected shortest distance computing in cloud (JG, JXY, RJ, JZ, TW, DY), pp. 409–420.
- SIGMOD-2011-KhanLYGCT #graph #network #performance #scalability
- Neighborhood based fast graph search in large networks (AK, NL, XY, ZG, SC, ST), pp. 901–912.
- ICML-2011-QuadriantoL #learning #multi
- Learning Multi-View Neighborhood Preserving Projections (NQ, CHL), pp. 425–432.
- KDD-2011-AoyamaSSU #approximate #graph #performance #similarity
- Fast approximate similarity search based on degree-reduced neighborhood graphs (KA, KS, HS, NU), pp. 1055–1063.
- SAC-2011-ParisiniM #branch #continuation #slicing
- Improving CP-based local branching via sliced neighborhood search (FP, MM), pp. 887–892.
- CGO-2011-KandemirZLY #locality #multi #optimisation
- Neighborhood-aware data locality optimization for NoC-based multicores (MTK, YZ, JL, TY), pp. 191–200.
- ICST-2011-ZimmermannNHPW #dependence #empirical
- An Empirical Study on the Relation between Dependency Neighborhoods and Failures (TZ, NN, KH, RP, LW), pp. 347–356.
- VLDB-2011-WangZTT10 #graph #on the
- On Triangulation-based Dense Neighborhood Graphs Discovery (NW, JZ, KLT, AKHT), pp. 58–68.
- ICML-2010-CostaG #distance #kernel #performance
- Fast Neighborhood Subgraph Pairwise Distance Kernel (FC, KDG), pp. 255–262.
- ICST-2010-KimSGSHN #analysis #automation #debugging #identification
- Automated Bug Neighborhood Analysis for Identifying Incomplete Bug Fixes (MK, SS, CG, HS, MJH, MGN), pp. 383–392.
- SEFM-2009-BresolinGMS #constraints #integer #logic
- Right Propositional Neighborhood Logic over Natural Numbers with Integer Constraints for Interval Lengths (DB, VG, AM, GS), pp. 240–249.
- CIKM-2009-LinLK #named #novel #similarity
- MatchSim: a novel neighbor-based similarity measure with maximum neighborhood matching (ZL, MRL, IK), pp. 1613–1616.
- KDIR-2009-GrosserRC #classification
- Classification by Successive Neighborhood (DG, HR, NC), pp. 288–291.
- RecSys-2009-SchclarTRMA #collaboration #performance
- Ensemble methods for improving the performance of neighborhood-based collaborative filtering (AS, AT, LR, AM, LA), pp. 261–264.
- SAC-2009-OliveiraA #named #protocol
- NECTAR: a DTN routing protocol based on neighborhood contact history (ECRdO, CVNdA), pp. 40–46.
- CIKM-2008-HoweF #collaboration #parametricity
- Re-considering neighborhood-based collaborative filtering parameters in the context of new data (AEH, RDF), pp. 1481–1482.
- ICPR-2008-ChenCW #higher-order #named #performance #using
- HOPS: Efficient region labeling using Higher Order Proxy Neighborhoods (AYCC, JJC, LW), pp. 1–4.
- KDD-2008-Koren #collaboration #multi
- Factorization meets the neighborhood: a multifaceted collaborative filtering model (YK), pp. 426–434.
- SAC-2008-LevadaMTS #estimation #higher-order #parametricity #pseudo
- Spatially non-homogeneous potts model parameter estimation on higher-order neighborhood systems by maximum pseudo-likelihood (ALML, NDAM, AT, DHPS), pp. 1733–1737.
- ASE-2007-HillPV #maintenance
- Exploring the neighborhood with dora to expedite software maintenance (EH, LLP, KVS), pp. 14–23.
- VLDB-2007-LiTJE #on the
- On Dominating Your Neighborhood Profitably (CL, AKHT, WJ, ME), pp. 818–829.
- LATA-2007-Povarov #complexity #regular expression
- Descriptive Complexity of the Hamming Neighborhood of a Regular Language (GP), pp. 509–520.
- OCSC-2007-DayF #analysis #community #concept #named #network #research
- CNA2 — Communications and Community; Neighborhoods and Networks; Action and Analysis: Concepts and Methods for Community Technology Research (PD, CF), pp. 301–314.
- OCSC-2007-GonzalezCK #towards
- Habitat Computing: Towards the Creation of Tech-Enabled Mexican Neighborhoods (VMG, LAC, KLK), pp. 342–351.
- SIGIR-2007-SchockaertC #information retrieval #strict
- Neighborhood restrictions in geographic IR (SS, MDC), pp. 167–174.
- DAC-2006-NelsonBDB #detection #multi #physics
- Multiple-detect ATPG based on physical neighborhoods (JEN, JGB, RD, RD(B), pp. 1099–1102.
- SOFTVIS-2006-ElmqvistT #in a nutshell
- TrustNeighborhoods in a nutshell (NE, PT), pp. 189–190.
- CIKM-2006-AngelovaS #approach #clustering #documentation
- A neighborhood-based approach for clustering of linked document collections (RA, SS), pp. 778–779.
- ICML-2006-WangZ #linear
- Label propagation through linear neighborhoods (FW, CZ), pp. 985–992.
- ICPR-v2-2006-BourgeoisND #visual notation
- Coarse Visual Registration from Closed-Contour Neighborhood Descriptor (SB, SNC, MD), pp. 283–287.
- ICPR-v2-2006-YouZDW #recognition
- Neighborhood Discriminant Projection for Face Recognition (QY, NZ, SD, YW), pp. 532–535.
- ICPR-v3-2006-ZhaoY #graph #incremental #reduction
- Incremental Construction of Neighborhood Graphs for Nonlinear Dimensionality Reduction (DZ, LY), pp. 177–180.
- ICPR-v4-2006-Yang #graph #linear
- Building Connected Neighborhood Graphs for Locally Linear Embedding (LY), pp. 194–197.
- SEKE-2006-Mayer #clustering #effectiveness #performance #random testing #testing
- Efficient and Effective Random Testing based on Partitioning and Neighborhood (JM), pp. 479–484.
- SIGIR-2006-Olsson #analysis #classification #set
- An analysis of the coupling between training set and neighborhood sizes for the kNN classifier (JSO), pp. 685–686.
- ICALP-2005-CzeizlerK #automaton #bound #linear
- A Tight Linear Bound on the Neighborhood of Inverse Cellular Automata (EC, JK), pp. 410–420.
- KDD-2005-Yang #graph
- Building connected neighborhood graphs for isometric data embedding (LY), pp. 722–728.
- ICML-2004-RosalesAF #clustering #learning #using
- Learning to cluster using local neighborhood structure (RR, KA, BJF).
- ICPR-v1-2004-VirmajokiF #algorithm #clustering #divide and conquer #graph
- Divide-and-Conquer Algorithm for Creating Neighborhood Graph for Clustering (OV, PF), pp. 264–267.
- ICPR-v1-2004-Yang04a #distance #estimation #graph
- k-Edge Connected Neighborhood Graph for Geodesic Distance Estimation and Nonlinear Data Projection (LY), pp. 196–199.
- SAC-2004-AdamJA #dataset #detection
- Neighborhood based detection of anomalies in high dimensional spatio-temporal sensor datasets (NRA, VPJ, VA), pp. 576–583.
- ICPR-v2-2002-LalondeG #geometry
- Variable Neighborhood Search for Geometrically Deformable Templates (ML, LG), pp. 689–692.
- ICPR-v2-2002-TruongVD
- Neighborhood Coherence and Edge Based Approaches to Film Scene Extraction (BTT, SV, CD), pp. 350–353.
- ICPR-v4-2002-TamSS #case study #categorisation #comparative #documentation #effectiveness #statistics
- A Comparative Study of Centroid-Based, Neighborhood-Based and Statistical Approaches for Effective Document Categorization (VT, AS, RS), pp. 235–238.
- ICML-2001-SebbanNL #classification
- Boosting Neighborhood-Based Classifiers (MS, RN, SL), pp. 505–512.
- DAC-1999-SalekLP #generative #independence #named #using
- MERLIN: Semi-Order-Independent Hierarchical Buffered Routing Tree Generation Using Local Neighborhood Search (AHS, JL, MP), pp. 472–478.
- CHI-1999-FeketeP #visualisation
- Excentric Labeling: Dynamic Neighborhood Labeling for Data Visualization (JDF, CP), pp. 512–519.
- HT-1998-HirtleSC #clustering #web
- Clusters on the World Wide Web: Creating Neighborhoods of Make-Believe (SCH, MES, GC), pp. 289–290.
- TAGT-1998-Pfaltz
- Neighborhood Expansion Grammars (JLP), pp. 30–44.
- TAGT-1998-SkodinisW
- Neighborhood-Preserving Node Replacements (KS, EW), pp. 45–58.
- ICPR-1998-KangOC #3d #graph #using
- Character grouping technique using 3D neighborhood graphs in raster map (YBK, SYO, HGC), pp. 1092–1094.
- VLDB-1997-EicklerKK
- Finding Data in the Neighborhood (AE, AK, DK), pp. 336–345.
- ICML-1997-Menczer #adaptation #heuristic #named #retrieval
- ARCCHNID: Adaptive Retrieval Agents Choosing Heuristic Neighborhoods (FM), pp. 227–235.
- DAC-1992-HamadaCC #equation #estimation
- A Wire Length Estimation Technique Utilizing Neighborhood Density Equations (TH, CKC, PMC), pp. 57–61.
- STOC-1992-Schulman
- Sample Spaces Uniform on Neighborhoods (LJS), pp. 17–25.
- STOC-1973-WeinerSB #algorithm
- Neighborhood Search Algorithms for Finding Optimal Traveling Salesman Tours Must Be Inefficient (PW, SLS, AB), pp. 207–213.