Stem veri$ (all stems)

205 papers:

FASE-2015-GomezTSC #modelling #persistent #scalability

Map-Based Transparent Persistence for Very Large Models (AG, MT, GS, JC), pp. 19–34.

ICEIS-v1-2015-OsbornM #scalability #set

The mqr-tree for Very Large Object Sets (WO, MM), pp. 367–373.

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.

SAT-2015-MangalZNN #framework #lazy evaluation #named #satisfiability #scalability

Volt: A Lazy Grounding Framework for Solving Very Large MaxSAT Instances (RM, XZ, AVN, MN), pp. 299–306.

DAC-2014-Rodriguez-NavasSHNLL #approach #automation #functional #safety #specification #verification

Automated Specification and Verification of Functional Safety in Heavy-Vehicles: the VeriSpec Approach (GRN, CCS, HH, MN, OL, HL), p. 4.

DATE-2014-YuSHEAB #estimation #performance #physics

Efficient performance estimation with very small sample size via physical subspace projection and maximum a posteriori estimation (LY, SS, CH, IME, DAA, DSB), pp. 1–6.

SIGMOD-2014-CaiGLPVJ #algorithm #comparison #implementation #machine learning #scalability

A comparison of platforms for implementing and running very large scale machine learning algorithms (ZC, ZJG, SL, LLP, ZV, CMJ), pp. 1371–1382.

VLDB-2015-MozafariSFJM14 #dataset #learning #scalability

Scaling Up Crowd-Sourcing to Very Large Datasets: A Case for Active Learning (BM, PS, MJF, MIJ, SM), pp. 125–136.

TACAS-2014-AngelisFPP #named #source code #verification

VeriMAP: A Tool for Verifying Programs through Transformations (EDA, FF, AP, MP), pp. 568–574.

PLDI-2014-BallBGIKSSV #named #network #source code #towards #verification

VeriCon: towards verifying controller programs in software-defined networks (TB, NB, AG, SI, AK, MS, MS, AV), p. 31.

ICALP-v1-2014-MertziosNRS #interactive #memory management #network

Determining Majority in Networks with Local Interactions and Very Small Local Memory (GBM, SEN, CR, PGS), pp. 871–882.

CIKM-2014-UysalBSS #approximate #database #distance #multi #performance #scalability #using

Efficient Filter Approximation Using the Earth Mover’s Distance in Very Large Multimedia Databases with Feature Signatures (MSU, CB, JS, TS), pp. 979–988.

ICML-c2-2014-AnarakiH #memory management #performance #random

Memory and Computation Efficient PCA via Very Sparse Random Projections (FPA, SMH), pp. 1341–1349.

SIGIR-2014-QianL0H

Co-training on authorship attribution with very fewlabeled examples: methods vs. views (TQ, BL, MZ, GH), pp. 903–906.

REFSQ-2014-VierhauserRG #framework #monitoring #requirements

A Requirements Monitoring Infrastructure for Very-Large-Scale Software Systems (MV, RR, PG), pp. 88–94.

DAC-2013-ZhangYWSX #hardware #named #trust #verification

VeriTrust: verification for hardware trust (JZ, FY, LW, ZS, QX), p. 8.

DATE-2013-LorenteVSPCLD #power management #ram

Combining RAM technologies for hard-error recovery in L1 data caches working at very-low power modes (VL, AV, JS, SP, RC, PL, JD), pp. 83–88.

VLDB-2013-MansourEKAA #named #parallel #scalability #sequence

RACE: A Scalable and Elastic Parallel System for Discovering Repeats in Very Long Sequences (EM, AER, PK, AA, AA), pp. 865–876.

CHI-2013-SchmidtMB #named #scalability

Screenfinity: extending the perception area of content on very large public displays (CS, JM, GB), pp. 1719–1728.

CAiSE-2013-LiverK #information management #scalability

Integrity in Very Large Information Systems — Dealing with Information Risk Black Swans (BL, HK), pp. 641–656.

CIKM-2013-ParkC #algorithm #graph #performance #pipes and filters #scalability

An efficient MapReduce algorithm for counting triangles in a very large graph (HMP, CWC), pp. 539–548.

CIKM-2013-SahliMK #parallel #sequence

Parallel motif extraction from very long sequences (MS, EM, PK), pp. 549–558.

KDD-2013-Vatsavai #approach #learning #multi #using

Gaussian multiple instance learning approach for mapping the slums of the world using very high resolution imagery (RRV), pp. 1419–1426.

RecSys-2013-Aiolli #dataset #performance #recommendation #scalability

Efficient top-n recommendation for very large scale binary rated datasets (FA), pp. 273–280.

SEKE-2013-ChaoY #analysis #order #reachability #scalability

A Best Method to Synthesize Very Large K-th Order Systems without Reachability Analysis (S) (DYC, THY), pp. 417–420.

SAC-2013-BellatrecheBCM #algorithm #clustering #incremental #query

Horizontal partitioning of very-large data warehouses under dynamically-changing query workloads via incremental algorithms (LB, RB, AC, SM), pp. 208–210.

DRR-2012-NagyT #named #performance #verification

VeriClick: an efficient tool for table format verification (GN, MT).

PODS-2012-Mahoney #approximate #data analysis #scalability

Approximate computation and implicit regularization for very large-scale data analysis (MWM), pp. 143–154.

VLDB-2012-AgarwalPMIMS #interactive #query #scalability

Blink and It’s Done: Interactive Queries on Very Large Data (SA, AP, BM, API, SM, IS), pp. 1902–1905.

ITiCSE-2012-Aycock #named #programming

μPython: non-majors programming from the very first lecture (JA), pp. 345–350.

WCRE-2012-AlomariCM #approach #performance #scalability #slicing

A Very Efficient and Scalable Forward Static Slicing Approach (HWA, MLC, JIM), pp. 425–434.

CIKM-2012-AltingovdeBCOSU #query #web

Characterizing web search queries that match very few or no results (ISA, RB, BBC, RO, ES, ÖU), pp. 2000–2004.

ICML-2012-ZhaiTTO

Discovering Support and Affiliated Features from Very High Dimensions (YZ, MT, IWT, YSO), p. 226.

ICPR-2012-ZhangSLZS #image #reduction

Enhancement and noise reduction of very low light level images (XZ, PS, LL, LZ, JS), pp. 2034–2037.

KDD-2012-ShiA #dataset #mobile #recommendation

GetJar mobile application recommendations with very sparse datasets (KS, KA), pp. 204–212.

KDIR-2012-Timonen #categorisation #documentation

Categorization of Very Short Documents (MT), pp. 5–16.

SIGIR-2012-Sun #classification #using #word

Short text classification using very few words (AS), pp. 1145–1146.

SAC-2012-KosinaG #multi #performance #problem

Very Fast Decision Rules for multi-class problems (PK, JG), pp. 795–800.

VLDB-2012-MansourASK11 #named #parallel #performance #string

ERA: Efficient Serial and Parallel Suffix Tree Construction for Very Long Strings (EM, AA, SS, PK), pp. 49–60.

CIKM-2011-TretyakovAGVD #estimation #graph #performance #scalability

Fast fully dynamic landmark-based estimation of shortest path distances in very large graphs (KT, AAC, LGB, JV, MD), pp. 1785–1794.

KDD-2011-CordeiroTTLKF #clustering #dataset #multi #pipes and filters #scalability

Clustering very large multi-dimensional datasets with MapReduce (RLFC, CTJ, AJMT, JL, UK, CF), pp. 690–698.

KDD-2011-GaoLWWL #graph #metadata #ranking #scalability

Semi-supervised ranking on very large graphs with rich metadata (BG, TYL, WW, TW, HL), pp. 96–104.

SIGIR-2011-LvZ #documentation #exclamation

When documents are very long, BM25 fails! (YL, CZ), pp. 1103–1104.

SIGIR-2011-MinackSN #approach #incremental #scalability #set

Incremental diversification for very large sets: a streaming-based approach (EM, WS, WN), pp. 585–594.

DAC-2010-WohlWNG

Fully X-tolerant, very high scan compression (PW, JAW, FN, EG), pp. 362–367.

VLDB-2010-Matsudaira #3d #biology #dataset #scalability

High-End Biological Imaging Generates Very Large 3D+ and Dynamic Datasets (PM), p. 3.

ICFP-2010-StampoulisS #logic #named

VeriML: typed computation of logical terms inside a language with effects (AS, ZS), pp. 333–344.

CIKM-2010-CormodeKW #algorithm #dataset #scalability #set

Set cover algorithms for very large datasets (GC, HJK, AW), pp. 479–488.

CIKM-2010-DeyJ #approach #database #graph #query #reachability #scalability

A hierarchical approach to reachability query answering in very large graph databases (SKD, HMJ), pp. 1377–1380.

ICML-2010-TanWT #dataset #feature model #learning

Learning Sparse SVM for Feature Selection on Very High Dimensional Datasets (MT, LW, IWT), pp. 1047–1054.

ICPR-2010-GuoMR #database #performance #recognition #scalability #using

Cross-Age Face Recognition on a Very Large Database: The Performance versus Age Intervals and Improvement Using Soft Biometric Traits (GG, GM, KR), pp. 3392–3395.

SEKE-2010-TrujilloPP #process

Supporting Software Process Improvement in Very Small Entities through a Template-based Guide (MMT, GEI, FJP, MP), pp. 704–709.

RE-2010-Glinz #lightweight #modelling #requirements

Very Lightweight Requirements Modeling (MG), pp. 385–386.

HPDC-2010-JardakROM #network #parallel #scalability

Parallel processing of data from very large-scale wireless sensor networks (CJ, JR, FO, PM), pp. 787–794.

HPDC-2010-ReinefeldSM #database #heuristic #scalability

Very large pattern databases for heuristic search (AR, TS, RM), pp. 803–809.

ICDAR-2009-ArlandisPU #identification

Identification of Very Similar Filled-in Forms with a Reject Option (JA, JCPC, EU), pp. 246–250.

SIGMOD-2009-NeumannW #graph #rdf #scalability

Scalable join processing on very large RDF graphs (TN, GW), pp. 627–640.

CSEET-2009-MansharamaniBGGKNR #certification #enterprise #performance #scalability

DCPE Rollout: Scaling Performance Engineering Training and Certification across a Very Large Enterprise (RKM, AB, KG, KG, AK, MKN, MR), pp. 263–270.

CHI-2009-BaudischC #interactive

Back-of-device interaction allows creating very small touch devices (PB, GC), pp. 1923–1932.

ICEIS-AIDSS-2009-NebotL #ontology #scalability

Building Tailored Ontologies from Very Large Knowledge Resources (VN, RBL), pp. 144–151.

ICEIS-J-2009-Cuzzocrea #approximate #evaluation #named #probability #query #reduction #scalability

s-OLAP: Approximate OLAP Query Evaluation on Very Large Data Warehouses via Dimensionality Reduction and Probabilistic Synopses (AC), pp. 248–262.

CIKM-2009-BarskySTU #scalability #sequence

Suffix trees for very large genomic sequences (MB, US, AT, CU), pp. 1417–1420.

CIKM-2009-Muntes-MuleroN #dataset #privacy #scalability

Privacy and anonymization for very large datasets (VMM, JN), pp. 2117–2118.

MLDM-2009-BouthinonSV #ambiguity #concept #learning

Concept Learning from (Very) Ambiguous Examples (DB, HS, VV), pp. 465–478.

MLDM-2009-KobayashiS #classification #distributed #linear #representation #using

A Linear Classification Method in a Very High Dimensional Space Using Distributed Representation (TK, IS), pp. 137–147.

SAC-2009-CelikikB #performance #scalability

Fast error-tolerant search on very large texts (MC, HB), pp. 1724–1731.

SAC-2009-KimHJJY #data flow #network #scalability #social #visualisation

Visualization of information flows in a very large social network (SGK, HH, KJ, HJ, HYY), pp. 1841–1842.

SAC-2009-LopesZ #database #named #relational #scalability

HTILDE: scaling up relational decision trees for very large databases (CL, GZ), pp. 1475–1479.

SOSP-2009-GlerumKGAONGLH #debugging #experience #implementation #scalability

Debugging in the (very) large: ten years of implementation and experience (KG, KK, SG, GA, VO, GN, DG, GL, GCH), pp. 103–116.

DATE-2008-MeisterLT #algorithm #component #novel

Novel Pin Assignment Algorithms for Components with Very High Pin Counts (TM, JL, GT), pp. 837–842.

HT-2008-ShiBAG

The very small world of the well-connected (XS, MB, LAA, ACG), pp. 61–70.

SIGMOD-2008-JinXRW #graph #query #reachability #scalability

Efficiently answering reachability queries on very large directed graphs (RJ, YX, NR, HW), pp. 595–608.

VLDB-2008-NathG #maintenance #online #random #scalability

Online maintenance of very large random samples on flash storage (SN, PBG), pp. 970–983.

ICML-2008-WolfeHK #dataset #distributed #scalability

Fully distributed EM for very large datasets (JW, AH, DK), pp. 1184–1191.

ICPR-2008-LeeWN #detection #performance #using

Very fast ellipse detection using GPU-based RHT (JKL, BAW, TSN), pp. 1–4.

ICPR-2008-ZhuBQ #lazy evaluation #learning

Bagging very weak learners with lazy local learning (XZ, CB, WQ), pp. 1–4.

REFSQ-2008-RegnellBW #complexity #question #requirements #scalability

Can We Beat the Complexity of Very Large-Scale Requirements Engineering? (BR, RBS, KW), pp. 123–128.

DATE-2007-RaghavanLJCVC #embedded #power management #symmetry

Very wide register: an asymmetric register file organization for low power embedded processors (PR, AL, MJ, FC, DV, HC), pp. 1066–1071.

DATE-2007-SingheeR #monte carlo #novel #performance #simulation #statistics

Statistical blockade: a novel method for very fast Monte Carlo simulation of rare circuit events, and its application (AS, RAR), pp. 1379–1384.

DocEng-2007-KimYHKK #documentation #modelling #scalability #xml

A document object modeling method to retrieve data from a very large XML document (SMK, SIY, EH, TGK, IKK), pp. 59–68.

ICDAR-2007-WachenfeldFKJ #segmentation

Segmentation of Very Low Resolution Screen-Rendered Text (SW, SF, HUK, XJ), pp. 1153–1157.

SIGMOD-2007-TrisslL #graph #performance #query #scalability

Fast and practical indexing and querying of very large graphs (ST, UL), pp. 845–856.

VLDB-2007-KrompassDKK #scalability

Dynamic Workload Management for Very Large Data Warehouses: Juggling Feathers and Bowling Balls (SK, UD, HAK, AK), pp. 1105–1115.

CSMR-2007-HeymansBW #interactive #migration #scalability #testing

Testing Techniques for the Cross-platform Migration of Very Large Interactive Applications (LH, TVdB, BW), pp. 323–324.

ICEIS-SAIC-2007-PoloniaCO #scalability

A MODEL to Optimize the Use of Imaging Equipment and Human Skills Scattered in Very Large Geographical Areas (DFP, CMAC, JLO), pp. 208–212.

CIKM-2007-AngiulliF #mining #performance

Very efficient mining of distance-based outliers (FA, FF), pp. 791–800.

CIKM-2007-BotelhoZ #scalability #set

External perfect hashing for very large key sets (FCB, NZ), pp. 653–662.

CIKM-2007-ZaragozaRMACA #ranking #wiki

Ranking very many typed entities on wikipedia (HZ, HR, PM, JA, MC, GA), pp. 1015–1018.

KDD-2007-Li #random #reduction

Very sparse stable random projections for dimension reduction in lalpha (0 &lt;alpha<=2) norm (PL0), pp. 440–449.

POPL-2007-AppelMRV #type system

A very modal model of a modern, major, general type system (AWA, PAM, CDR, JV), pp. 109–122.

ICSE-2007-LivieriHMI #analysis #distributed #open source #source code #using #visualisation

Very-Large Scale Code Clone Analysis and Visualization of Open Source Programs Using Distributed CCFinder: D-CCFinder (SL, YH, MM, KI), pp. 106–115.

ASE-2006-NeumullerG #automation #case study #lessons learnt #traceability

Automating Software Traceability in Very Small Companies: A Case Study and Lessons Learned (CN, PG), pp. 145–156.

ICPR-v2-2006-SungZL #learning #scalability #set

Accelerating the SVM Learning for Very Large Data Sets (ES, YZ, XL), pp. 484–489.

ICPR-v3-2006-HalavatiSTCR #approach #novel #performance #recognition #robust #speech #word

A Novel Approach to Very Fast and Noise Robust, Isolated Word Speech Recognition (RH, SBS, HT, AC, MR), pp. 190–193.

ICPR-v3-2006-MalmW #image #reduction #sequence

Motion Dependent Spatiotemporal Smoothing for Noise Reduction in Very Dim Light Image Sequences (HM, EW), pp. 954–959.

KDD-2006-LiHC #random

Very sparse random projections (PL, TH, KWC), pp. 287–296.

SIGIR-2006-ButtcherCL06a #ad hoc #proximity #retrieval #scalability

Term proximity scoring for ad-hoc retrieval on very large text collections (SB, CLAC, BL), pp. 621–622.

ICSE-2006-DhurjatiA #array #bound #c

Backwards-compatible array bounds checking for C with very low overhead (DD, VSA), pp. 162–171.

DATE-2005-WangMDCM #analysis #embedded #energy #process #variability

Systematic Analysis of Energy and Delay Impact of Very Deep Submicron Process Variability Effects in Embedded SRAM Modules (HW, MM, WD, FC, KM), pp. 914–919.

ICDAR-2005-Schambach #performance #recognition #scalability #word

Fast Script Word Recognition with Very Large Vocabulary (MPS), pp. 9–13.

SIGMOD-2005-ShenZH #database #effectiveness #scalability #sequence #towards #video

Towards Effective Indexing for Very Large Video Sequence Database (HTS, BCO, XZ), pp. 730–741.

ICEIS-v2-2005-DoP #dataset #mining #scalability #visualisation

Mining Very Large Datasets with SVM and Visualization (TND, FP), pp. 127–141.

ICML-2005-TsangKL #problem #scalability

Core Vector Regression for very large regression problems (IWT, JTK, KTL), pp. 912–919.

MLDM-2005-Boulle #category theory #scalability

A Grouping Method for Categorical Attributes Having Very Large Number of Values (MB), pp. 228–242.

DATE-DF-2004-PanatoSWJRB #design #multi #pipes and filters

Design of Very Deep Pipelined Multipliers for FPGAs (AP, SVS, FRW, MOJ, RR, SB), pp. 52–57.

SIGMOD-2004-JermainePA #maintenance #online #random #scalability

Online Maintenance of Very Large Random Samples (CJ, AP, SA), pp. 299–310.

PASTE-2004-Godefroid #model checking

Invited Talk: “Model checking” software with VeriSoft (PG), p. 36.

ICALP-2004-IndykLLP #problem

Closest Pair Problems in Very High Dimensions (PI, ML, OL, EP), pp. 782–792.

SIGIR-2004-BeitzelJCGF #analysis #query #scalability #topic #web

Hourly analysis of a very large topically categorized web query log (SMB, ECJ, AC, DAG, OF), pp. 321–328.

SIGIR-2004-Soboroff #documentation #on the #web

On evaluating web search with very few relevant documents (IS), pp. 530–531.

VLDB-2003-LiPHCAAT #scalability #web

CachePortal II: Acceleration of Very Large Scale Data Center-Hosted Database-driven Web Applications (WSL, OP, WPH, KSC, DA, YA, KT), pp. 1109–1112.

VISSOFT-2003-FavreSE #architecture #component #scalability

Exploring the Many Architectures of a Very Large Component-Based Software (JMF, RS, JE), pp. 46–47.

VISSOFT-2003-FavreSE1 #architecture #component #scalability

Exploring the Many Architectures of a Very Large Component-Based Software (JMF, RS, JE), pp. 46–53.

ICEIS-v2-2003-DoP #algorithm #dataset #mining #scalability

Mining Very Large Datasets with Support Vector Machine Algorithms (TND, FP), pp. 140–147.

KDD-2003-KoyuturkG #dataset #framework #named

PROXIMUS: a framework for analyzing very high dimensional discrete-attributed datasets (MK, AG), pp. 147–156.

ICSE-2003-Dingel #reasoning

Computer-Assisted Assume/Guarantee Reasoning with VeriSoft (JD), pp. 138–148.

HPCA-2003-MutluSWP #execution #scalability

Runahead Execution: An Alternative to Very Large Instruction Windows for Out-of-Order Processors (OM, JS, CW, YNP), pp. 129–140.

LCTES-2003-ShaylorSB #architecture #java #virtual machine

A java virtual machine architecture for very small devices (NS, DNS, WRB), pp. 34–41.

PPoPP-2003-Kazar #data mining #mining #performance #scalability

High performance spatial data mining for very large data-sets (BMK), p. 1.

CADE-2003-WaltherS

About VeriFun (CW, SS), pp. 322–327.

DAC-2002-LeeKK #named #verification

VeriCDF: a new verification methodology for charged device failures (JL, KWK, SMK), pp. 874–879.

ITiCSE-2002-Cassel #learning #network

Very active learning of network routing (LNC), p. 195.

TACAS-2002-GodefroidK #algorithm #scalability #search-based #using

Exploring Very Large State Spaces Using Genetic Algorithms (PG, SK), pp. 266–280.

ICSM-2002-Nikora #maintenance

Maintenance Issues for Very Long-Lived Robotic Space Systems (APN), p. 471.

KDD-2002-TuzhilinA #analysis #array #scalability

Handling very large numbers of association rules in the analysis of microarray data (AT, GA), pp. 396–404.

SEKE-2002-Wu #database #information management #scalability

Knowledge discovery in very large databases (XW), p. 15.

DATE-2001-DessoukyKLG #case study #design #reuse

Analog design for reuse — case study: very low-voltage sigma-delta modulator (MD, AK, MML, AG), pp. 353–360.

VLDB-2001-TanSHCR #realtime #scalability

Walking Through a Very Large Virtual Environment in Real-time (LS, JC, ZH, YR, KLT), pp. 401–410.

SIGMOD-2000-Weininger #database #parallel #scalability

Handling Very Large Databases with Informix Extended Parallel Server (AW), pp. 548–549.

ICPR-v1-2000-RomdhaniPG #scalability

A Generic Face Appearance Model of Shape and Texture under Very Large Pose Variations from Profile to Profile Views (SR, AP, SG), pp. 5060–5063.

ICPR-v2-2000-BradleyRF #clustering #database #modelling #scalability #using

Clustering Very Large Databases Using EM Mixture Models (PSB, CR, UMF), pp. 2076–2080.

KDD-2000-Yang #3d #dataset #interactive #relational #scalability

Interactive exploration of very large relational datasets through 3D dynamic projections (LY), pp. 236–243.

KR-2000-DimopoulosNT

Finding Admissible and Preferred Arguments Can be Very Hard (YD, BN, FT), pp. 53–61.

SAC-2000-YunesMS #problem #scalability #scheduling

Solving Very Large Crew Scheduling Problems to Optimality (THY, AVM, CCdS), pp. 446–451.

CAV-2000-HeymanGGS #analysis #parallel #reachability #scalability

Achieving Scalability in Parallel Reachability Analysis of Very Large Circuits (TH, DG, OG, AS), pp. 20–35.

ICDAR-1999-KosmalaWR #clustering #online #recognition #scalability

Advanced State Clustering for Very Large Vocabulary HMM-based On-Line Handwriting Recognition (AK, DW, GR), pp. 442–445.

VLDB-1999-LiRS #algorithm #scalability

Aggregation Algorithms for Very Large Compressed Data Warehouses (JL, DR, JS), pp. 651–662.

ITiCSE-1999-Impagliazzo #architecture #education #scalability #word

Teaching very large instruction word architectures (JI), p. 208.

CHI-1999-GuiardBM #multi #navigation #precise

Navigation as Multiscale Pointing: Extending Fitts’ Model to Very High Precision Tasks (YG, MBL, DM), pp. 450–457.

KDD-1999-ZhangRL #database #estimation #kernel #performance #scalability #using

Fast Density Estimation Using CF-Kernel for Very Large Databases (TZ, RR, ML), pp. 312–316.

TOOLS-EUROPE-1999-EveredM #component #programming

Very High Level Programming with Collection Components (ME, GM), pp. 361–370.

ASE-1998-HaebererM #architecture #concept #development #idea #paradigm

The Very Idea of Software Development Environments: A Conceptual Architecture for the ARTS Environment Paradigm (AMH, TSEM), pp. 260–271.

VLDB-1998-DoDJJR #scalability

Issues in Developing Very Large Data Warehouses (LD, PD, WJ, VJ, DVR), pp. 633–636.

VLDB-1998-SheikholeslamiCZ #approach #clustering #database #multi #named #scalability

WaveCluster: A Multi-Resolution Clustering Approach for Very Large Spatial Databases (GS, SC, AZ), pp. 428–439.

HPCA-1998-LopezMD #concurrent #detection #distributed #network #performance

A Very Efficient Distributed Deadlock Detection Mechanism for Wormhole Networks (PL, JMM, JD), pp. 57–66.

ISMM-1998-HuelsbergenW #concurrent #garbage collection

Very Concurrent Mark-&-Sweep Garbage Collection without Fine-Grain Synchronization (LH, PW), pp. 166–175.

ISSTA-1998-GodefroidHJ #analysis #model checking #monitoring #using

Model Checking Without a Model: An Analysis of the Heart-Beat Monitor of a Telephone Switch Using VeriSoft (PG, RSH, LJJ), pp. 124–133.

DAC-1997-SmailagicSMS #agile #case study #design #off the shelf #prototype #smarttech

Very Rapid Prototyping of Wearable Computers: A Case Study of Custom versus Off-the-Shelf Design Methodologies (AS, DPS, RM, JS), pp. 315–320.

CHI-1997-Pirolli #modelling #scalability

Computational Models of Information Scent-Following in a Very Large Browsable Text Collection (PP), pp. 3–10.

ICML-1997-KollerS #documentation #using #word

Hierarchically Classifying Documents Using Very Few Words (DK, MS), pp. 170–178.

CAV-1997-Godefroid #analysis #automation #concurrent #named

VeriSoft: A Tool for the Automatic Analysis of Concurrent Reactive Software (PG), pp. 476–479.

SIGMOD-1996-ZhangRL #clustering #database #named #performance #scalability

BIRCH: An Efficient Data Clustering Method for Very Large Databases (TZ, RR, ML), pp. 103–114.

VLDB-1996-Hess #database #scalability

Very Large Databases in a Commercial Application Environment (KHH), p. 2.

PLDI-1996-Engler #code generation #named #performance

VCODE: a Retargetable, Extensible, Very Fast Dynamic Code Generation System (DRE), pp. 160–170.

CHI-1996-PirolliSHD #scalability #topic

Scatter/Gather Browsing Communicates the Topic Structure of a Very Large Text Collection (PP, PKS, MAH, CD), pp. 213–220.

ICPR-1996-Schikuta #clustering #named #performance #scalability #set

Grid-clustering: an efficient hierarchical clustering method for very large data sets (ES), pp. 101–105.

ICPR-1996-SkurichinaD #classification

Stabilizing classifiers for very small sample sizes (MS, RPWD), pp. 891–896.

SEKE-1996-RigoutsosD #scalability

The Impact of Hashing Function Choice on the Load Balancing in Very Large Dartasets (IR, AD), pp. 301–308.

VLDB-1995-Madnick #database #scalability #semantics

From VLDB to VMLDB (Very MANY Large Data Bases): Dealing with Large-Scale Semantic Heterogenity (SEM), pp. 11–16.

VLDB-1995-Vaskevitch #database #how #question #scalability

Very Large Databases: How Large, How Different? (DV), pp. 677–685.

SAC-1995-GandolfiGMR #configuration management #design #fuzzy

Design of a VLSI very high speed reconfigurable digital fuzzy processor (EG, AG, MM, MR), pp. 477–481.

SAC-1995-Julstrom #algorithm #problem #search-based

Very greedy crossover in a genetic algorithm for the traveling salesman problem (BAJ), pp. 324–328.

DAC-1994-RiessDJ #clustering #scalability #using

Partitioning Very Large Circuits Using Analytical Placement Techniques (BMR, KD, FMJ), pp. 646–651.

EDAC-1994-BurgunDGPS #complexity #logic #multi #synthesis

Multilevel Logic Synthesis of Very High Complexity Circuits (LB, ND, AG, EP, CS), p. 669.

EDAC-1994-JohanssonVG #performance

“Underground Capacitors” Very Efficient Decoupling for High Performance UHF Signal Processing ICs (TJ, LRV, JMG), p. 655.

EDAC-1994-MichelLSDC #dependence

Taking Advantage of ASICs to Improve Dependability with Very Low Overheads (TM, RL, GS, RD, PC), pp. 14–18.

VLDB-1993-Cohen #database #query #scalability

A Practical Issue Concerning Very Large Data Bases: The Need for Query Governors (GC), pp. 705–706.

DLT-1993-DammHLR #complexity

Deterministic OL Languages are of Very Low Complexity: DOL is in AC0 (CD, MH, KJL, PR), pp. 305–313.

HCI-SHI-1993-ReimersC #database #relational #scalability #user interface

Intelligent User Interface for Very Large Relational Databases (PER, SMC), pp. 134–139.

SIGIR-1993-CuttingKP #constant #documentation #scalability

Constant Interaction-Time Scatter/Gather Browsing of Very Large Document Collections (DRC, DRK, JOP), pp. 126–134.

SIGIR-1993-LinoffS #database #scalability

Compression of Indexes with Full Positional Information in Very Large Text Databases (GL, CS), pp. 88–95.

SIGMOD-1992-MohanN #algorithm #scalability

Algorithms for Creating Indexes for Very Large Tables Without Quiescing Updates (CM, IN), pp. 361–370.

CHI-1992-RiemanDR #bibliography #big data #database #lessons learnt

A visit to a very small database: lessons from managing the review of papers submitted for CHI 1991 (JR, SD, JR), pp. 471–478.

STOC-1991-KedemPRS #parallel #performance

Combining Tentative and Definite Executions for Very Fast Dependable Parallel Computing (Extended Abstract) (ZMK, KVP, AR, PGS), pp. 381–390.

STOC-1990-SchriftS

The Discrete Log is Very Discreet (AWS, AS), pp. 405–415.

GG-1990-BaileyCF #graph #programming #scalability

Programming with Very Large Graphs (DAB, JEC, CDF), pp. 84–97.

VLDB-1988-AgrawalJ #database #performance #scalability

Efficient Search in Very Large Databases (RA, HVJ), pp. 407–418.

VLDB-1988-KentSR #database #multi #scalability

A Superimposed Coding Scheme Based on Multiple Block Descriptor Files for Indexing Very Large Data Bases (AJK, RSD, KR), pp. 351–359.

SIGMOD-1987-HermanGLW #architecture #database #throughput

The Datacycle Architecture for Very High Throughput Database Systems (GEH, GG, KCL, AW), pp. 97–103.

DAC-1986-MiyoshiOSOA #design #logic #scalability #simulation

An extensive logic simulation method of very large scale computer design (MM, YO, AS, NO, NA), pp. 360–365.

DAC-1986-OhnoMYOKI #design #scalability

Principles of design automatioon system for very large scale computer design (YO, MM, NY, TO, TK, KI), pp. 354–359.

DAC-1986-TadaH #performance #scalability

Router system for printed wiring boards of very high-speed, very large-scale computers (TT, AH), pp. 791–797.

DAC-1986-TsuchiyaMITMY #design #logic #scalability

Establishment of higher level logic design for very large scale computer (YT, MM, YI, ET, TM, TY), pp. 366–371.

VLDB-1986-MoriSAI #database #scalability

A Very Large Database System to Serve National Welfare (MM, KS, HA, KI), pp. 496–501.

VLDB-1986-WongL #algorithm #database #scalability

Transposition Algorithms on Very Large Compressed Databases (HKTW, JZL), pp. 304–311.

ESOP-1986-CodognetCF #backtracking #logic programming #source code

A Very Intelligent Backtracking Method for Logic Programs (CC, PC, GF), pp. 315–326.

ICALP-1986-SpirakisT #algorithm #performance

A Very Fast, Practical Algorithm for Finding a Negative Cycle in a Digraph (PGS, AKT), pp. 397–406.

ICLP-1986-RamamohanaraoS86 #database #prolog #scalability

A Superimposed Codeword Indexing Scheme for Very Large Prolog Databases (KR, JS), pp. 569–576.

VLDB-1984-Tagg #automation #database #scalability

End User Access to Very Large Databases in an Automated Office/Workstation Environment (RMT), pp. 272–279.

PODS-1983-Gonnet #database #performance #semistructured data

Unstructured Data Bases or Very Efficient Text Searching (GHG), pp. 117–124.

VLDB-1983-PennyP #novel #scalability

Application of Novel Technologies to the Management of a Very Large Date Base (PP, MP), pp. 20–29.

SCC-1982-RudmikM #compilation #performance #scalability #source code

An Efficient Separate Compilation Strategy for Very Large Programs (AR, BGM), pp. 301–307.

STOC-1981-Leivant #complexity #independence #parametricity #polymorphism #programming language #theorem

The Complexity of Parameter Passing in Polymorphic Procedures (or: Programming Language Theorems Independent of Very Strong Theories) (DL), pp. 38–45.

VLDB-1980-Gotlieb #database #scalability

Some Large Questions about Very Large Data Bases (CCG), pp. 3–7.

DAC-1979-OhnoMS #logic #scalability #using #verification

Logic verification system for very large computers using LSI’s (YO, MM, KS), pp. 367–374.

VLDB-1979-GhoshCMW #database #scalability

Some Very Large Data Bases in Developing Countries (SPG, AFC, IM, GW), pp. 173–182.

SIGIR-1979-Jamieson #implementation #retrieval #scalability #using

The Economic Implementation of Experimental Retrieval Techniques on a Very Large Scale Using an Intelligent Terminal (SHJ), pp. 45–51.

POPL-1979-Fong #automation #source code

Automatic Improvement of Programs in Very High Level Languages (ACF), pp. 21–28.

VLDB-1977-Nickerson #database #memory management #scalability

Some Comments on Human Archival Memory as a Very Large Data Base (RSN), pp. 159–168.

POPL-1977-Fong

Generalized Common Subexpressions in Very High Level Languages (ACF), pp. 48–57.

VLDB-1976-Meltzer #concept #database #scalability

Structure and Redundancy in the Conceptual Schema in the Administration of Very Large Data Bases (HSM), pp. 13–25.

POPL-1976-FongU #induction

Induction Variables in Very High Level Languages (ACF, JDU), pp. 104–112.

VLDB-1975-HealeyH #architecture #database #hardware #scalability

Hardware and System Architecture for a Very Large Database (RH, BH), pp. 520–522.

VLDB-1975-SuL #database #named #scalability

CASSM: A Cellular System for Very Large Data Bases (SYWS, GJL), pp. 456–472.

POPL-1975-Schwartz #automation #data type

Automatic Data Structure Choice in a Language of Very High Level (JTS), pp. 36–40.