Stem near$ (all stems)

237 papers:

DAC-2015-Engblom #integration #using

Virtual to the (near) end: using virtual platforms for continuous integration (JE), p. 6.

DAC-2015-WangH0LL #logic #memory management #named

ProPRAM: exploiting the transparent logic resources in non-volatile memory for near data computing (YW, YH, LZ, HL, XL), p. 6.

HT-2015-Laouris #hybrid

The Near Future is Hybrid (YL), p. 1.

PODS-2015-AcharyaDHLS #algorithm #approximate #performance

Fast and Near-Optimal Algorithms for Approximating Distributions by Histograms (JA, ID, CH, JZL, LS), pp. 249–263.

SIGMOD-2015-BabarinsaI #database #named

JAFAR: Near-Data Processing for Databases (OOB, SI), pp. 2069–2070.

SIGMOD-2015-MeglerM

Demonstrating “Data Near Here”: Scientific Data Search (VMM, DM), pp. 1075–1080.

SIGMOD-2015-TangSX #approach

Influence Maximization in Near-Linear Time: A Martingale Approach (YT, YS, XX), pp. 1539–1554.

VLDB-2015-LiuDMM #named #realtime

FLORIN — A System to Support (Near) Real-Time Applications on User Generated Content on Daily News (QL, ECD, AM, WM), pp. 1944–1955.

STOC-2015-AbdullahV #bound #difference

A Directed Isoperimetric Inequality with application to Bregman Near Neighbor Lower Bounds (AA, SV), pp. 509–518.

STOC-2015-AndoniR #approximate

Optimal Data-Dependent Hashing for Approximate Near Neighbors (AA, IR), pp. 793–801.

STOC-2015-ChawlaMSY #algorithm #clustering #graph

Near Optimal LP Rounding Algorithm for CorrelationClustering on Complete and Complete k-partite Graphs (SC, KM, TS, GY), pp. 219–228.

STOC-2015-KawarabayashiT #graph

Deterministic Global Minimum Cut of a Simple Graph in Near-Linear Time (KiK, MT), pp. 665–674.

STOC-2015-ZhuO #convergence #performance

Nearly-Linear Time Positive LP Solver with Faster Convergence Rate (ZAZ, LO), pp. 229–236.

ICALP-v1-2015-KannanM0 #complexity #graph #query

Near-Linear Query Complexity for Graph Inference (SK, CM, HZ), pp. 773–784.

ICALP-v1-2015-Sanyal #bound #fourier

Near-Optimal Upper Bound on Fourier Dimension of Boolean Functions in Terms of Fourier Sparsity (SS), pp. 1035–1045.

ICALP-v2-2015-BhattacharyaHHK #maintenance

Maintaining Near-Popular Matchings (SB, MH, CCH, TK, LW), pp. 504–515.

CHI-2015-WinklerGLHSDR #security #smarttech

Glass Unlock: Enhancing Security of Smartphone Unlocking through Leveraging a Private Near-eye Display (CW, JG, ADL, GH, PS, DD, ER), pp. 1407–1410.

ICML-2015-ChangYXY #detection #semantics #using

Complex Event Detection using Semantic Saliency and Nearly-Isotonic SVM (XC, YY, EPX, YY), pp. 1348–1357.

ICML-2015-HegdeIS #framework

A Nearly-Linear Time Framework for Graph-Structured Sparsity (CH, PI, LS), pp. 928–937.

KDD-2015-MitzenmacherPPT #clique #detection #network #scalability

Scalable Large Near-Clique Detection in Large-Scale Networks via Sampling (MM, JP, RP, CET, SCX), pp. 815–824.

PPDP-2015-RivasJS #monad

From monoids to near-semirings: the essence of MonadPlus and alternative (ER, MJ, TS), pp. 196–207.

ASPLOS-2015-FletcherRKDD #ram #recursion #verification

Freecursive ORAM: [Nearly] Free Recursion and Integrity Verification for Position-based Oblivious RAM (CWF, LR, AK, MvD, SD), pp. 103–116.

HPCA-2015-FarahaniAMK #architecture #memory management #named #standard

NDA: Near-DRAM acceleration architecture leveraging commodity DRAM devices and standard memory modules (AFF, JHA, KM, NSK), pp. 283–295.

PPoPP-2015-AcharyaB #locality #modelling #parallel

PLUTO+: near-complete modeling of affine transformations for parallelism and locality (AA, UB), pp. 54–64.

RTA-2015-Czajka #confluence #orthogonal #term rewriting

Confluence of nearly orthogonal infinitary term rewriting systems (LC), pp. 106–126.

DATE-2014-GemmekeSSRCA #memory management

Resolving the memory bottleneck for single supply near-threshold computing (TG, MMS, JS, PR, FC, DA), pp. 1–6.

DATE-2014-SilvanoPXS #architecture #manycore

Voltage island management in near threshold manycore architectures to mitigate dark silicon (CS, GP, SX, ISS), pp. 1–6.

SIGMOD-2014-TangXS #complexity #performance

Influence maximization: near-optimal time complexity meets practical efficiency (YT, XX, YS), pp. 75–86.

VLDB-2014-GuptaYGKCLWDKABHCSJSGVA #named #realtime #scalability

Mesa: Geo-Replicated, Near Real-Time, Scalable Data Warehousing (AG, FY, JG, AK, KC, KL, SW, SGD, ARK, AA, SB, MH, JC, MS, DJ, JS, AG, SV, DA), pp. 1259–1270.

STOC-2014-CohenKMPPRX #linear

Solving SDD linear systems in nearly mlog1/2n time (MBC, RK, GLM, JWP, RP, AR, SCX), pp. 343–352.

STOC-2014-RudraW

Every list-decodable code for high noise has abundant near-optimal rate puncturings (AR, MW), pp. 764–773.

ICALP-v1-2014-GilbertLPS

For-All Sparse Recovery in Near-Optimal Time (ACG, YL, EP, MJS), pp. 538–550.

ICALP-v1-2014-HajiaghayiLP #algorithm #online #problem

Near-Optimal Online Algorithms for Prize-Collecting Steiner Problems (MH, VL, DP), pp. 576–587.

ICALP-v1-2014-HegdeIS #linear #modelling

Nearly Linear-Time Model-Based Compressive Sensing (CH, PI, LS), pp. 588–599.

ICALP-v2-2014-Ghaffari #approximate #distributed #set

Near-Optimal Distributed Approximation of Minimum-Weight Connected Dominating Set (MG), pp. 483–494.

DUXU-TMT-2014-IioIM #database #design #user interface

The Database on Near-Future Technologies for User Interface Design from SciFi Movies (JI, SI, HM), pp. 572–579.

CIKM-2014-ChatzistergiouV #clustering #data type #heuristic #performance

Fast Heuristics for Near-Optimal Task Allocation in Data Stream Processing over Clusters (AC, SDV), pp. 1579–1588.

ICML-c1-2014-JainT #bound #independence #learning

(Near) Dimension Independent Risk Bounds for Differentially Private Learning (PJ, AGT), pp. 476–484.

ICML-c1-2014-Shrivastava0 #performance #permutation

Densifying One Permutation Hashing via Rotation for Fast Near Neighbor Search (AS, PL), pp. 557–565.

ICML-c2-2014-ChenGH

Near-Optimal Joint Object Matching via Convex Relaxation (YC, LJG, QXH), pp. 100–108.

ICML-c2-2014-SinglaBBKK #education

Near-Optimally Teaching the Crowd to Classify (AS, IB, GB, AK, AK), pp. 154–162.

ICPR-2014-DhamechaSSV #effectiveness #on the

On Effectiveness of Histogram of Oriented Gradient Features for Visible to Near Infrared Face Matching (TID, PS, RS, MV), pp. 1788–1793.

ICPR-2014-LiuLS #documentation #image #novel

Novel Global and Local Features for Near-Duplicate Document Image Matching (LL, YL, CYS), pp. 4624–4629.

ICPR-2014-NegrelPG #image #learning #metric #performance #reduction #retrieval #using

Efficient Metric Learning Based Dimension Reduction Using Sparse Projectors for Image Near Duplicate Retrieval (RN, DP, PHG), pp. 738–743.

KDD-2014-FangP #algorithm #linear #performance

Fast DTT: a near linear algorithm for decomposing a tensor into factor tensors (XF, RP), pp. 967–976.

KDD-2014-HerodotouDBOF #locality #network #realtime #scalability

Scalable near real-time failure localization of data center networks (HH, BD, SB, GO, PF), pp. 1689–1698.

KR-2014-Herzig #logic

Belief Change Operations: A Short History of Nearly Everything, Told in Dynamic Logic of Propositional Assignments (AH).

HPCA-2014-KarpuzcuAK #named #towards

Accordion: Toward soft Near-Threshold Voltage Computing (URK, IA, NSK), pp. 72–83.

RTA-TLCA-2014-Statman #λ-calculus

Near Semi-rings and λ Calculus (RS), pp. 410–424.

DATE-2013-De #design

Near-threshold voltage design in nanoscale CMOS (VD), p. 612.

DATE-2013-KodakaTSYKTXSUTMM #manycore #power management #predict

A near-future prediction method for low power consumption on a many-core processor (TK, AT, SS, AY, TK, TT, HX, TS, HU, JT, TM, NM), pp. 1058–1059.

DocEng-2013-WilliamsG #detection #library

Near duplicate detection in an academic digital library (KW, CLG), pp. 91–94.

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-LiuLSX #documentation #image #modelling #retrieval #word

Modeling Local Word Spatial Configurations for Near Duplicate Document Image Retrieval (LL, YL, CYS, JX), pp. 235–239.

VLDB-2013-DuttaNB #approach #approximate #data type #detection #streaming

Streaming Quotient Filter: A Near Optimal Approximate Duplicate Detection Approach for Data Streams (SD, AN, SKB), pp. 589–600.

ICSM-2013-SahaRS #analysis #evolution #named

gCad: A Near-Miss Clone Genealogy Extractor to Support Clone Evolution Analysis (RKS, CKR, KAS), pp. 488–491.

STOC-2013-KelnerOSZ #algorithm #combinator

A simple, combinatorial algorithm for solving SDD systems in nearly-linear time (JAK, LO, AS, ZAZ), pp. 911–920.

ICALP-v1-2013-WeimannY #approximate #graph #linear

Approximating the Diameter of Planar Graphs in Near Linear Time (OW, RY), pp. 828–839.

CHI-2013-LiangCCPCLYC13a #interactive #named

GaussBits: magnetic tangible bits for portable and occlusion-free near-surface interactions (RHL, KYC, LWC, CXP, MYC, RHL, DNY, BYC), pp. 1391–1400.

DHM-HB-2013-RichterZF #dependence

Temporal Dependence of Trapezius Muscle Activation during Sustained Eye-Lens Accommodation at Near (HOR, CZ, MF), pp. 269–275.

HCI-IMT-2013-KarunanayakaSENG #interface

Magnetic Field Based Near Surface Haptic and Pointing Interface (KK, SS, CPE, RN, GP), pp. 601–609.

CIKM-2013-FerenceLJY

Spatial search for K diverse-near neighbors (GF, WCL, HJJ, DNY), pp. 19–28.

ECIR-2013-IgnatovKC #approach #detection

Near-Duplicate Detection for Online-Shops Owners: An FCA-Based Approach (DII, AVK, YC), pp. 722–725.

ICML-c1-2013-ChenK #adaptation #learning #optimisation

Near-optimal Batch Mode Active Learning and Adaptive Submodular Optimization (YC, AK), pp. 160–168.

ICML-c1-2013-KumarLVV #bound

Near-Optimal Bounds for Cross-Validation via Loss Stability (RK, DL, SV, AV), pp. 27–35.

ICML-c1-2013-KumarSK #algorithm #matrix #performance

Fast Conical Hull Algorithms for Near-separable Non-negative Matrix Factorization (AK, VS, PK), pp. 231–239.

ICML-c3-2013-ZhangYJLH #bound #kernel #learning #online

Online Kernel Learning with a Near Optimal Sparsity Bound (LZ, JY, RJ, ML, XH), pp. 621–629.

HPCA-2013-KarpuzcuSKT #energy #named #towards

EnergySmart: Toward energy-efficient manycores for Near-Threshold Computing (URK, AAS, NSK, JT), pp. 542–553.

HPCA-2013-MahmoodKH #adaptation #architecture #named #scalability

Macho: A failure model-oriented adaptive cache architecture to enable near-threshold voltage scaling (TM, SK, SH), pp. 532–541.

CAV-2013-ChakrabortyMV #generative #satisfiability #scalability

A Scalable and Nearly Uniform Generator of SAT Witnesses (SC, KSM, MYV), pp. 608–623.

DAC-2012-ChangH #power management

Near-threshold operation for power-efficient computing?: it depends.. (LC, WH), pp. 1159–1163.

DAC-2012-ChenHKYW #low cost

Age-based PCM wear leveling with nearly zero search cost (CHC, PCH, TWK, CLY, CYMW), pp. 453–458.

DAC-2012-CropPC #detection #logic #throughput #using

Regaining throughput using completion detection for error-resilient, near-threshold logic (JC, RP, PC), pp. 974–979.

DAC-2012-KaulAHAKB #challenge #design

Near-threshold voltage (NTV) design: opportunities and challenges (HK, MA, SH, AA, RK, SB), pp. 1153–1158.

DAC-2012-LinWYSCP #configuration management

Near-optimal, dynamic module reconfiguration in a photovoltaic system to combat partial shading effects (XL, YW, SY, DS, NC, MP), pp. 516–521.

DAC-2012-PinckneySDFMSB #performance

Assessing the performance limits of parallelized near-threshold computing (NRP, KS, RGD, DF, TNM, DS, DB), pp. 1147–1152.

DAC-2012-SeoDWPCMBM #architecture #process

Process variation in near-threshold wide SIMD architectures (SS, RGD, MW, YP, CC, SAM, DB, TNM), pp. 980–987.

DAC-2012-SeversonYD #performance #question #reduction

Not so fast my friend: is near-threshold computing the answer for power reduction of wireless devices? (MS, KY, YD), pp. 1164–1166.

ICSM-2012-AlalfiCDSS #clone detection #detection #modelling

Models are code too: Near-miss clone detection for Simulink models (MHA, JRC, TRD, MS, AS), pp. 295–304.

SCAM-2012-Bazrafshan #evolution

Evolution of Near-Miss Clones (SB), pp. 74–83.

STOC-2012-AlonMS #graph #scalability

Nearly complete graphs decomposable into large induced matchings and their applications (NA, AM, BS), pp. 1079–1090.

STOC-2012-DeDFS #approximate #parametricity #problem

Nearly optimal solutions for the chow parameters problem and low-weight approximation of halfspaces (AD, ID, VF, RAS), pp. 729–746.

STOC-2012-HassaniehIKP #fourier

Nearly optimal sparse fourier transform (HH, PI, DK, EP), pp. 563–578.

STOC-2012-SharathkumarA #algorithm #approximate #geometry

A near-linear time ε-approximation algorithm for geometric bipartite matching (RS, PKA), pp. 385–394.

ICALP-v1-2012-BaronOV #black box

Nearly Simultaneously Resettable Black-Box Zero Knowledge (JB, RO, IV), pp. 88–99.

CHI-2012-GuimbretiereN #interactive

Bimanual marking menu for near surface interactions (FG, CN), pp. 825–828.

ICML-2012-Araya-LopezBT #using

Near-Optimal BRL using Optimistic Local Transitions (MAL, OB, VT), p. 70.

ICPR-2012-AotoTSMY #estimation #using

Position estimation of near point light sources using a clear hollow sphere (TA, TT, TS, YM, NY), pp. 3721–3724.

ICPR-2012-MartinezS #monitoring #using

Breath rate monitoring during sleep using near-ir imagery and PCA (MM, RS), pp. 3472–3475.

ICPR-2012-MolnarKJ #multi

A multi-layer phase field model for extracting multiple near-circular objects (CM, ZK, IJ), pp. 1427–1430.

ICPR-2012-VitaladevuniCPN #detection #documentation #image #using

Detecting near-duplicate document images using interest point matching (SNPV, FC, RP, PN), pp. 347–350.

ICPR-2012-ZhaoYXJ #learning

A near-optimal non-myopic active learning method (YZ, GY, XX, QJ), pp. 1715–1718.

KDD-2012-PhamP #algorithm #approximate #detection

A near-linear time approximation algorithm for angle-based outlier detection in high-dimensional data (NP, RP), pp. 877–885.

SAC-2012-ZibranR #ide #realtime

IDE-based real-time focused search for near-miss clones (MFZ, CKR), pp. 1235–1242.

LICS-2012-BartoKW #bound #constraints

Near Unanimity Constraints Have Bounded Pathwidth Duality (LB, MK, RW), pp. 125–134.

CASE-2011-KaoZCHWLWWC #constraints

Near optimal furnace tool allocation with batching and waiting time constraints (YTK, SCZ, SCC, JHH, PW, PBL, SW, FW, JC), pp. 108–113.

DAC-2011-WangXAP #classification #learning #policy #power management #using

Deriving a near-optimal power management policy using model-free reinforcement learning and Bayesian classification (YW, QX, ACA, MP), pp. 41–46.

DATE-2011-RahmanTS #reduction

Power reduction via near-optimal library-based cell-size selection (MR, HT, CS), pp. 867–870.

ICSM-2011-SahaRS #automation #framework

An automatic framework for extracting and classifying near-miss clone genealogies (RKS, CKR, KAS), pp. 293–302.

WCRE-2011-UddinRSH #detection #effectiveness #on the #scalability

On the Effectiveness of Simhash for Detecting Near-Miss Clones in Large Scale Software Systems (MSU, CKR, KAS, AH), pp. 13–22.

STOC-2011-LeeS #bound

Near-optimal distortion bounds for embedding doubling spaces into L1 (JRL, AS), pp. 765–772.

STOC-2011-Woodruff #approximate #black box #protocol

Near-optimal private approximation protocols via a black box transformation (DPW), pp. 735–744.

ICALP-v2-2011-HalldorssonM #bound #distributed #scheduling

Nearly Optimal Bounds for Distributed Wireless Scheduling in the SINR Model (MMH, PM), pp. 625–636.

CHI-2011-HirshfieldGHHRWWJ #functional #interface #testing #usability

This is your brain on interfaces: enhancing usability testing with functional near-infrared spectroscopy (LMH, RG, SHH, SWH, MR, RW, TW, RJKJ), pp. 373–382.

CIKM-2011-SoodL #detection #probability #using

Probabilistic near-duplicate detection using simhash (SS, DL), pp. 1117–1126.

HPCA-2011-AnsariFGM #design #named #polymorphism #robust

Archipelago: A polymorphic cache design for enabling robust near-threshold operation (AA, SF, SG, SAM), pp. 539–550.

DATE-2010-PakerEB #algorithm #architecture #low cost #multi #standard

A low cost multi-standard near-optimal soft-output sphere decoder: Algorithm and architecture (ÖP, SE, AB), pp. 1402–1407.

SIGMOD-2010-WangWLWWLTXL #dataset #detection #named

MapDupReducer: detecting near duplicates over massive datasets (CW, JW, XL, WW, HW, HL, WT, JX, RL), pp. 1119–1122.

STOC-2010-BurgisserC #equation #polynomial #problem

Solving polynomial equations in smoothed polynomial time and a near solution to smale’s 17th problem (PB, FC), pp. 503–512.

STOC-2010-DeV #quantum

Near-optimal extractors against quantum storage (AD, TV), pp. 161–170.

STOC-2010-KollaMST

Subgraph sparsification and nearly optimal ultrasparsifiers (AK, YM, AS, SHT), pp. 57–66.

ICALP-v1-2010-Woodruff #polynomial

Additive Spanners in Nearly Quadratic Time (DPW), pp. 463–474.

ECIR-2010-KimCLL #detection #effectiveness #image #named #sequence #using

BASIL: Effective Near-Duplicate Image Detection Using Gene Sequence Alignment (HsK, HWC, JL, DL), pp. 229–240.

ICML-2010-BshoutyL #clustering #linear #using

Finding Planted Partitions in Nearly Linear Time using Arrested Spectral Clustering (NHB, PML), pp. 135–142.

ICML-2010-NegahbanW #estimation #matrix #rank #scalability

Estimation of (near) low-rank matrices with noise and high-dimensional scaling (SN, MJW), pp. 823–830.

ICML-2010-SzitaS #bound #complexity #learning #modelling

Model-based reinforcement learning with nearly tight exploration complexity bounds (IS, CS), pp. 1031–1038.

ICPR-2010-AngGLLNC #human-computer #interface

A Brain-Computer Interface for Mental Arithmetic Task from Single-Trial Near-Infrared Spectroscopy Brain Signals (KKA, CG, KL, JQL, SN, BC), pp. 3764–3767.

ICPR-2010-BalujaC #learning #performance #retrieval

Beyond “Near Duplicates”: Learning Hash Codes for Efficient Similar-Image Retrieval (SB, MC), pp. 543–547.

ICPR-2010-ChenF #graph #learning

Semi-supervised Graph Learning: Near Strangers or Distant Relatives (WC, GF), pp. 3368–3371.

ICPR-2010-HaindlH10a

Near-Regular BTF Texture Model (MH, MH), pp. 2114–2117.

ICPR-2010-HarmanciH #adaptation #image #query

Content Adaptive Hash Lookups for Near-Duplicate Image Search by Full or Partial Image Queries (OH, IH), pp. 1582–1585.

ICPR-2010-IdeSDTM #classification #video

Classification of Near-Duplicate Video Segments Based on Their Appearance Patterns (II, YS, DD, TT, HM), pp. 3129–3133.

SIGIR-2010-HajishirziYK #adaptation #detection #learning #similarity

Adaptive near-duplicate detection via similarity learning (HH, WtY, AK), pp. 419–426.

DATE-2009-DemangelFDCW #architecture

A generic architecture of CCSDS Low Density Parity Check decoder for near-earth applications (FD, NF, ND, FC, CW), pp. 1242–1245.

DATE-2009-RealVD #correlation #using

Enhancing correlation electromagnetic attack using planar near-field cartography (DR, FV, MD), pp. 628–633.

VLDB-2009-ChenBN #evolution #maintenance #mining #named #performance #web

NEAR-Miner: Mining Evolution Associations of Web Site Directories for Efficient Maintenance of Web Archives (LC, SSB, WN), pp. 1150–1161.

ICSM-2009-Roy #analysis #detection

Detection and analysis of near-miss software clones (CKR), pp. 447–450.

STOC-2009-AndoniO #approximate #distance #edit distance

Approximating edit distance in near-linear time (AA, KO), pp. 199–204.

STOC-2009-BernsteinK

A nearly optimal oracle for avoiding failed vertices and edges (AB, DRK), pp. 101–110.

STOC-2009-Blais #testing

Testing juntas nearly optimally (EB), pp. 151–158.

STOC-2009-FriedrichS #random

Near-perfect load balancing by randomized rounding (TF, TS), pp. 121–130.

FM-2009-McIverMM #probability #security

Security, Probability and Nearly Fair Coins in the Cryptographers’ Café (AM, LM, CM), pp. 41–71.

CHI-2009-HirshfieldSGKJSF #adaptation #functional #interface #metric #testing #usability

Brain measurement for usability testing and adaptive interfaces: an example of uncovering syntactic workload with functional near infrared spectroscopy (LMH, ETS, AG, JK, RJKJ, AS, SF), pp. 2185–2194.

HIMI-II-2009-FurukawaO #analysis

A Proposal of Collection and Analysis System of Near Miss Incident in Nursing Duties (AF, YO), pp. 497–502.

HIMI-II-2009-SawaragiIHN #approach #identification #using

Identifying Latent Similarities among Near-Miss Incident Records Using a Text-Mining Method and a Scenario-Based Approach (TS, KI, YH, HN), pp. 594–603.

ICML-2009-KolterN #polynomial

Near-Bayesian exploration in polynomial time (JZK, AYN), pp. 513–520.

DATE-2008-LiBXNPC #architecture #detection #optimisation #parallel #programmable

Optimizing Near-ML MIMO Detector for SDR Baseband on Parallel Programmable Architectures (ML, BB, WX, DN, LVdP, FC), pp. 444–449.

DATE-2008-PradhanV #performance #synthesis #using

Fast Analog Circuit Synthesis Using Sensitivity Based Near Neighbor Searches (AP, RV), pp. 523–526.

PODS-2008-SozioNW #network #peer-to-peer #replication

Near-optimal dynamic replication in unstructured peer-to-peer networks (MS, TN, GW), pp. 281–290.

SIGMOD-2008-LiuPRY #algorithm #data type #evaluation

Near-optimal algorithms for shared filter evaluation in data stream systems (ZL, SP, AR, HY), pp. 133–146.

VLDB-2008-GolabKKSY #dependence #functional #generative #on the

On generating near-optimal tableaux for conditional functional dependencies (LG, HJK, FK, DS, BY), pp. 376–390.

ICPC-2008-RoyC08a #detection #flexibility #named #normalisation #pretty-printing #using

NICAD: Accurate Detection of Near-Miss Intentional Clones Using Flexible Pretty-Printing and Code Normalization (CKR, JRC), pp. 172–181.

CHI-2008-HsiehLHK #communication #using

Using tags to assist near-synchronous communication (GH, JL, SEH, RK), pp. 223–226.

CIKM-2008-HuangWL #detection #precise

Achieving both high precision and high recall in near-duplicate detection (LH, LW, XL), pp. 63–72.

ICPR-2008-TombariMSA #effectiveness #realtime

Near real-time stereo based on effective cost aggregation (FT, SM, LdS, EA), pp. 1–4.

KDD-2008-ParikhS #detection #query #realtime #scalability

Scalable and near real-time burst detection from eCommerce queries (NP, NS), pp. 972–980.

SIGIR-2008-TheobaldSP #detection #named #performance #robust #scalability #web

SpotSigs: robust and efficient near duplicate detection in large web collections (MT, JS, AP), pp. 563–570.

CGO-2008-KoesG #graph

Near-optimal instruction selection on dags (DRK, SCG), pp. 45–54.

PODS-2007-ChierichettiPRSTU #clustering

Finding near neighbors through cluster pruning (FC, AP, PR, MS, AT, EU), pp. 103–112.

VLDB-2007-ShenZHSZ #detection #named #realtime #video

UQLIPS: A Real-time Near-duplicate Video Clip Detection System (HTS, XZ, ZH, JS, XZ), pp. 1374–1377.

HCI-AS-2007-KimuraTHTAOT #analysis #approach #using

The Analysis of Near-Miss Cases Using Data-Mining Approach (MK, KT, TH, YT, TA, MO, FT), pp. 474–483.

HIMI-MTT-2007-NagaiEK #comprehension #process #using

Measuring Brain Activities Related to Understanding Using Near-Infrared Spectroscopy (NIRS) (MN, NE, TK), pp. 884–893.

HIMI-MTT-2007-OmoriHMCT #process

Brain Activities Related to Legibility of Text, Studied by Means of Near Infrared Spectroscopy (MO, SH, MM, MC, HT), pp. 894–902.

SIGIR-2007-Potthast #detection #similarity #wiki

Wikipedia in the pocket: indexing technology for near-duplicate detection and high similarity search (MP), p. 909.

STOC-2006-CharikarMM #algorithm #game studies

Near-optimal algorithms for unique games (MC, KM, YM), pp. 205–214.

STOC-2006-LeviRS #algorithm #modelling #probability

Provably near-optimal sampling-based algorithms for Stochastic inventory control models (RL, RR, DBS), pp. 739–748.

CIAA-2006-Tischler #automaton #finite #random #refinement #video

Refinement of Near Random Access Video Coding with Weighted Finite Automata (GT), pp. 46–57.

ICALP-v1-2006-BlellochDHRSS #parametricity #re-engineering

Fixed Parameter Tractability of Binary Near-Perfect Phylogenetic Tree Reconstruction (GEB, KD, EH, RR, RS, SS), pp. 667–678.

ICALP-v1-2006-HeZ #graph

Nearly Optimal Visibility Representations of Plane Graphs (XH, HZ), pp. 407–418.

ICPR-v2-2006-YangQHE #adaptation #geometry #image #recognition #retrieval #using

Near-Duplicate Image Recognition and Content-based Image Retrieval using Adaptive Hierarchical Geometric Centroids (MY, GQ, JH, DE), pp. 958–961.

ICPR-v3-2006-HenriquesBGCA

Searching for Similarities in Nearly Periodic Signals With Application to ECG Data Compression (JH, MB, PG, PC, MA), pp. 942–945.

SIGIR-2006-Henzinger #algorithm #evaluation #scalability #web

Finding near-duplicate web pages: a large-scale evaluation of algorithms (MRH), pp. 284–291.

SIGIR-2006-YangC #clustering #detection

Near-duplicate detection by instance-level constrained clustering (HY, JPC), pp. 421–428.

HPCA-2006-Prvulovic #concurrent #detection #effectiveness #named

CORD: cost-effective (and nearly overhead-free) order-recording and data race detection (MP), pp. 232–243.

LCTES-2006-KulkarniWTD #optimisation #order

In search of near-optimal optimization phase orderings (PAK, DBW, GST, JWD), pp. 83–92.

ICML-2005-GuestrinKS #process

Near-optimal sensor placements in Gaussian processes (CG, AK, APS), pp. 265–272.

MLDM-2005-ZhaoG #automation #recognition

An Automatic Face Recognition System in the Near Infrared Spectrum (SZ, RRG), pp. 437–444.

SAC-2005-Ferrer-TroyanoAS #data type #incremental #learning

Incremental rule learning based on example nearness from numerical data streams (FJFT, JSAR, JCRS), pp. 568–572.

STOC-2004-SpielmanT #algorithm #clustering #graph #linear

Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems (DAS, SHT), pp. 81–90.

CIAA-2004-FrishertW #automaton #regular expression

Combining Regular Expressions with (Near-)Optimal Brzozowski Automata (MF, BWW), pp. 319–320.

ICPR-v1-2004-ColemanSH #design #scalability

A Systematic Design Procedure for Scalable Near-Circular Laplacian of Gaussian Operators (SAC, BWS, MGH), pp. 700–703.

ICPR-v3-2004-ChambonC #algorithm #robust #towards

Towards Correlation-Based Matching Algorithms that are Robust Near Occlusions (SC, AC), pp. 20–23.

KDD-2004-KolczCA #detection #robust

Improved robustness of signature-based near-replica detection via lexicon randomization (AK, AC, JA), pp. 605–610.

PODS-2003-HeerenJP #using

Optimal indexing using near-minimal space (CH, HVJ, LP), pp. 244–251.

STOC-2003-AnshelevichDTW #design #network

Near-optimal network design with selfish agents (EA, AD, ÉT, TW), pp. 511–520.

KDD-2003-BayS #linear #mining

Mining distance-based outliers in near linear time with randomization and a simple pruning rule (SDB, MS), pp. 29–38.

PODS-2002-ChenC #clustering #multi #query

From Discrepancy to Declustering: Near optimal multidimensional declustering strategies for range queries (CMC, CTC), pp. 29–38.

STOC-2002-GilbertGIMS #fourier

Near-optimal sparse fourier representations via sampling (ACG, SG, PI, SM, MS), pp. 152–161.

STOC-2002-GoldbergKP #complexity #random

The complexity of choosing an H-colouring (nearly) uniformly at random (LAG, SK, MP), pp. 53–62.

STOC-2002-GuruswamiI #linear

Near-optimal linear-time codes for unique decoding and new list-decodable codes over smaller alphabets (VG, PI), pp. 812–821.

ICPR-v2-2002-YangDD #parametricity

Near-Optimal Regularization Parameters for Applications in Computer Vision (CY, RD, LSD), pp. 569–573.

ICPR-v4-2002-KolesnikovF #algorithm #approximate #performance

A Fast Near-Optimal Algorithm for Approximation of Polygonal Curves (AK, PF), pp. 335–338.

STOC-2001-MolloyR #graph

Colouring graphs when the number of colours is nearly the maximum degree (MM, BAR), pp. 462–470.

CIKM-2001-HsuLC #algorithm #generative #multi #source code

A Near Optimal Algorithm for Generating Broadcast Programs on Multiple Channels (CHH, GL, ALPC), pp. 303–309.

KDD-2001-DingHZ #component #graph #web

A spectral method to separate disconnected and nearly-disconnected web graph components (CHQD, XH, HZ), pp. 275–280.

SIGMOD-2000-RiedelFGN #data mining #for free #mining

Data Mining on an OLTP System (Nearly) for Free (ER, CF, GRG, DN), pp. 13–21.

STOC-2000-LiMW #multi #polynomial

Near optimal multiple alignment within a band in polynomial time (ML, BM, LW), pp. 425–434.

STOC-2000-Thorup #graph

Near-optimal fully-dynamic graph connectivity (MT), pp. 343–350.

ICPR-v1-2000-NielsenP #adaptation #problem #representation #segmentation #using

A Solution to the Problem of Segmentation near Edges Using Adaptable Class-Specific Representation (CFN, PJP), pp. 1436–1440.

POPL-2000-ChungMES

Reducing Sweep Time for a Nearly Empty Heap (YCC, SMM, KE, DS), pp. 378–389.

STOC-1999-GuruswamiKRSY #algorithm #approximate #problem

Near-Optimal Hardness Results and Approximation Algorithms for Edge-Disjoint Paths and Related Problems (VG, SK, RR, FBS, MY), pp. 19–28.

IFL-1999-Chitil #deforestation

Type-Inference Based Short Cut Deforestation (Nearly) without Inlining (OC), pp. 19–35.

DAC-1998-Kung #algorithm #library #optimisation #performance

A Fast Fanout Optimization Algorithm for Near-Continuous Buffer Libraries (DSK), pp. 352–355.

DATE-1998-HamiltonO #concurrent #fault #latency

Concurrent Error Recovery with Near-Zero Latency in Synthesized ASICs (SNH, AO), pp. 604–609.

ICML-1998-KearnsM #algorithm #bottom-up #performance

A Fast, Bottom-Up Decision Tree Pruning Algorithm with Near-Optimal Generalization (MJK, YM), pp. 269–277.

ICML-1998-KearnsS #learning

Near-Optimal Reinforcement Learning in Polynominal Time (MJK, SPS), pp. 260–268.

ICPR-1998-HofmanJ #analysis #approach #clustering #performance #robust #using

Robust and efficient cluster analysis using a shared near neighbours approach (IH, RAJ), pp. 243–247.

TOOLS-USA-1998-Li #java #virtual machine

Java Virtual Machine — Present and Near Future (QL), p. 480.

VLDB-1997-KraissW #documentation #migration #predict #scalability

Vertical Data Migration in Large Near-Line Document Archives Based on Markov-Chain Predictions (AK, GW), pp. 246–255.

PLDI-1997-YoungJKS #branch

Near-optimal Intraprocedural Branch Alignment (CY, DSJ, DRK, MDS), pp. 183–193.

STOC-1997-Reif #approximate #constant #evaluation #polynomial

Approximate Complex Polynomial Evaluation in Near Constant Work Per Point (JHR), pp. 30–39.

ECOOP-1997-KrallVH #encoding

Near Optimal Hierarchical Encoding of Types (AK, JV, RNH), pp. 128–145.

STOC-1996-Cesa-BianchiDFS #bound #learning

Noise-Tolerant Learning Near the Information-Theoretic Bound (NCB, ED, PF, HUS), pp. 141–150.

STOC-1996-Karger

Minimum Cuts in Near-Linear Time (DRK), pp. 56–63.

ICALP-1996-Fernandez-BacaL #algorithm #polynomial

A Polynomial-Time Algorithm for Near-Perfect Phylogeny (DFB, JL), pp. 670–680.

ICPR-1996-HuijsmansL #image #performance #retrieval #using

Efficient content-based image retrieval in digital picture collections using projections: (near)-copy location (DPH, MSL), pp. 104–108.

ICPR-1996-OrwellBH #sequence

Ego motion from near-degenerate sequences (JO, JFB, JFH), pp. 412–416.

SAC-1996-BhatiaS #database #image

Near perfect hash table for image databases (SKB, CLS), pp. 442–446.

ICDAR-v1-1995-Summers #classification #documentation

Near-wordless document structure classification (KMS), pp. 462–465.

VLDB-1995-Brin #metric #scalability

Near Neighbor Search in Large Metric Spaces (SB), pp. 574–584.

WCRE-1995-Baker #on the #scalability

On Finding Duplication and Near-Duplication in Large Software Systems (BSB), pp. 86–95.

STOC-1995-EdmondsP #bound

A nearly optimal time-space lower bound for directed st-connectivity on the NNJAG model (JE, CKP), pp. 147–156.

STOC-1994-ChungY #algorithm

A near optimal algorithm for edge separators (preliminary version) (FRKC, STY), pp. 1–8.

STOC-1994-Cohen #approximate

Polylog-time and near-linear work approximation scheme for undirected shortest paths (EC), pp. 16–26.

STOC-1994-PolishchukS #artificial reality #proving

Nearly-linear size holographic proofs (AP, DAS), pp. 194–203.

KR-1994-Selman

Near-Optimal Plans, Tractability, and Reactivity (BS), pp. 521–529.

HCI-ACS-1993-Sundstrom-Frisk

Near-Accidents in the Use of Advanced Medical Equipment (CSF), pp. 821–826.

DAC-1992-ChaudharyP #algorithm #constraints

A Near Optimal Algorithm for Technology Mapping Minimizing Area under Delay Constraints (KC, MP), pp. 492–498.

STOC-1992-BealsS #composition #linear

Structure Forest and Composition Factors for Small Base Groups in Nearly Linear Time (RB, ÁS), pp. 116–125.

STOC-1992-Plaxton #network #sorting

A Hypercubic Sorting Network with Nearly Logarithmic Depth (CGP), pp. 405–416.

ICALP-1992-BroderFSU

Near-perfect Token Distribution (AZB, AMF, ES, EU), pp. 308–317.

DAC-1991-ParkK #automation #performance #scheduling

Fast and Near Optimal Scheduling in Automatic Data Path Aynthesis (ICP, CMK), pp. 680–685.

STOC-1991-ApplegateK #integration

Sampling and Integration of Near Log-Concave functions (DA, RK), pp. 156–163.

STOC-1991-MatiasV #parallel #probability

Converting High Probability into Nearly-Constant Time-with Applications to Parallel Hashing (Extended Abstract) (YM, UV), pp. 307–316.

LOPSTR-1991-Popelinsky #prolog #source code #synthesis #towards

Towards Synthesis of Nearly Pure Prolog Programs (Extende Abstract) (LP), pp. 94–96.

STOC-1990-CypherP #sorting

Deterministic Sorting in Nearly Logarithmic Time on the Hypercube and Related Computers (RC, CGP), pp. 193–203.

CHI-1989-EhrlichBMT #tool support

Tools for supporting cooperative work near and far: highlights from the CSCW conference (SFE, TB, WM, JCT), pp. 353–356.

JICSCP-1988-SmithL88 #interpreter #prolog

A Simple Near-Horn Prolog Interpreter (BTS, DWL), pp. 794–809.

ICALP-1987-LevcopoulosLS #geometry #heuristic

Nearly Optimal Heuristics for Binary Search Trees with Geometric Generalizations (Extended Abstract) (CL, AL, JRS), pp. 376–385.

ICLP-1987-Loveland87 #prolog

Near-Horn PROLOG (DWL), pp. 456–469.

DAC-1986-EnbodyD

Near-optimal n-layer channel routing (RJE, DHCD), pp. 708–714.

DAC-1985-Blanks #polynomial #using

Near-optimal placement using a quadratic objective function (JPB), pp. 609–615.

SIGIR-1984-IofinovaK #database

Situational Nearness in Intellectual Data Bases (MEI, EAK), pp. 301–312.

STOC-1979-Fredman #data type #problem #query

A Near Optimal Data Structure for a Type of Range Query Problem (MLF), pp. 62–66.

POPL-1979-CohenH #attribute grammar #automation #generative

Automatic Generation of Near-Optimal Translators for Noncircular Attribute Grammars (RSC, EH), pp. 121–134.

STOC-1978-Wegener #complexity #polynomial

Switching Functions Whose Monotone Complexity Is Nearly Quadratic (IW), pp. 143–149.

DAC-1973-UlrichB #concurrent #network #simulation

The concurrent simulation of nearly identical digital networks (EGU, TEB), pp. 145–150.