Stem without$ (all stems)

374 papers:

DocEng-2015-CutterM #documentation #how #mobile #towards

Towards Mobile OCR: How to Take a Good Picture of a Document Without Sight (MPC, RM), pp. 75–84.

PEPM-2015-BahrA #graph #traversal

Generalising Tree Traversals to DAGs: Exploiting Sharing without the Pain (PB, EA), pp. 27–38.

PLDI-2015-MarrSD #metaprogramming #performance #protocol

Zero-overhead metaprogramming: reflection and metaobject protocols fast and without compromises (SM, CS, SD), pp. 545–554.

CSCW-2015-JafarinaimiM

Collective Intelligence or Group Think?: Engaging Participation Patterns in World without Oil (NJ, EMM), pp. 1872–1881.

ICML-2015-GouwsBC #distributed #named #performance #word

BilBOWA: Fast Bilingual Distributed Representations without Word Alignments (SG, YB, GC), pp. 748–756.

KDD-2015-ZhangAYJS #email #information management

Annotating Needles in the Haystack without Looking: Product Information Extraction from Emails (WZ, AA, JY, VJ, AJS), pp. 2257–2266.

ECOOP-2015-Stroustrup #inheritance #object-oriented #programming

Object-Oriented Programming without Inheritance (Invited Talk) (BS), p. 1.

OOPSLA-2015-FelgentreffMBH #constraints #programming language #theorem proving

Checks and balances: constraint solving without surprises in object-constraint programming languages (TF, TDM, AB, RH), pp. 767–782.

SAC-2015-Fournier-VigerZ #mining #named #performance

FOSHU: faster on-shelf high utility itemset mining — with or without negative unit profit (PFV, SZ), pp. 857–864.

ICSE-v1-2015-HerzigGCM #quality #testing

The Art of Testing Less without Sacrificing Quality (KH, MG, JC, BM), pp. 483–493.

ICSE-v2-2015-AndersonHVWCBG #student

CS/SE Instructors Can Improve Student Writing without Reducing Class Time Devoted to Technical Content: Experimental Results (PVA, SH, MAV, DW, MC, JEB, GCG), pp. 455–464.

ASPLOS-2015-SungA #named #performance

DeNovoSync: Efficient Support for Arbitrary Synchronization without Writer-Initiated Invalidations (HS, SVA), pp. 545–559.

PPoPP-2015-TangYKTGC #algorithm #parallel #programming #recursion

Cache-oblivious wavefront: improving parallelism of recursive dynamic programming algorithms without losing cache-efficiency (YT, RY, HK, JJT, PG, RAC), pp. 205–214.

DAC-2014-RenMRZ #fault tolerance #network #using

Fault-tolerant Routing for On-chip Network Without Using Virtual Channels (PR, QM, XR, NZ), p. 6.

SIGMOD-2014-DuttH #estimation #query

Plan bouquets: query processing without selectivity estimation (AD, JRH), pp. 1039–1050.

ITiCSE-2014-Katai14b #named

ALGO-RYTHMICS: science and art without ethnic borders (ZK), p. 329.

PLDI-2014-GreenawayLAK #c #verification

Don’t sweat the small stuff: formal verification of C code without the pain (DG, JL, JA, GK), p. 45.

FM-2014-MarriottC #named

SCJ: Memory-Safety Checking without Annotations (CM, AC), pp. 465–480.

ICFP-2014-CockxDP #pattern matching

Pattern matching without K (JC, DD, FP), pp. 257–268.

ILC-2014-Pfeil #lisp #named

Kilns: A Lisp Without λ (GP), p. 9.

CSCW-2014-GavilanesMQ #bound #communication #social #twitter

Twitter ain’t without frontiers: economic, social, and cultural boundaries in international communication (ROGG, YM, DQ), pp. 1511–1522.

DUXU-TMT-2014-SilvaMLO #quality #usability #user interface

Evaluating Quality and Usability of the User Interface: A Practical Study on Comparing Methods with and without Users (CMS, VM, RL, MLLRO), pp. 318–328.

HCI-AS-2014-CentieiroRDF #interactive

Bet without Looking: Studying Eyes-Free Interaction during Live Sports (PC, TR, AED, DF), pp. 581–592.

ICML-c1-2014-Sohl-DicksteinMD #monte carlo

Hamiltonian Monte Carlo Without Detailed Balance (JSD, MM, MRD), pp. 719–726.

ICML-c2-2014-AminHK #learning

Learning from Contagion (Without Timestamps) (KA, HH, MK), pp. 1845–1853.

ICML-c2-2014-DworkinKN

Pursuit-Evasion Without Regret, with an Application to Trading (LD, MK, YN), pp. 1521–1529.

ICPR-2014-NhatNKYL #music #recognition

Distorted Music Score Recognition without Staffline Removal (VQN, TN, SHK, HJY, GL), pp. 2956–2960.

KEOD-2014-Aalst #mining #people #process #what

No Knowledge Without Processes — Process Mining as a Tool to Find Out What People and Organizations Really Do (WMPvdA), pp. 1–11.

KR-2014-BorgwardtDP #decidability #logic

Decidable Gödel Description Logics without the Finitely-Valued Model Property (SB, FD, RP).

MLDM-2014-Schafer #classification #preprocessor #towards

Towards Time Series Classification without Human Preprocessing (PS), pp. 228–242.

RecSys-2014-CremonesiQ #question #recommendation

Cross-domain recommendations without overlapping data: myth or reality? (PC, MQ), pp. 297–300.

SEKE-2014-JiangWZD #network #online #social

Forwarding Links without Browsing Links in Online Social Networks (JJ, XW, LZ, YD), pp. 636–641.

SIGIR-2014-JayasingheWSC

Extending test collection pools without manual runs (GKJ, WW, MS, JSC), pp. 915–918.

SIGIR-2014-LomakinaPS #web

Web search without “stupid” results (AL, NP, PS), pp. 943–946.

Onward-2014-PhilipsRCM #development #towards #web

Towards Tierless Web Development without Tierless Languages (LP, CDR, TVC, WDM), pp. 69–81.

PPDP-2014-AotoS #induction #proving #theorem

Decision Procedures for Proving Inductive Theorems without Induction (TA, SS), pp. 237–248.

SAC-2014-GeorgiadisP #algorithm #online #problem #scheduling #smarttech

Dealing with storage without forecasts in smart grids: problem transformation and online scheduling algorithm (GG, MP), pp. 518–524.

SLE-2014-KursLN #bound #semiparsing

Bounded Seas — Island Parsing Without Shipwrecks (JK, ML, ON), pp. 62–81.

PPoPP-2014-LuZBW #multi #performance #thread

Efficient deterministic multithreading without global barriers (KL, XZ, TB, XW), pp. 287–300.

CAV-2014-NarodytskaLBRW #game studies

Solving Games without Controllable Predecessor (NN, AL, FB, LR, AW), pp. 533–540.

SAT-2014-JordanKLS #named #parallel #towards

MPIDepQBF: Towards Parallel QBF Solving without Knowledge Sharing (CJ, LK, FL, MS), pp. 430–437.

CASE-2013-GrosbardKTR #composition #network #using

A queuing network model for wafer fabrication using decomposition without aggregation (DG, AK, IT, GR), pp. 717–722.

CASE-2013-LiF #approach #integer #linear #multi #problem #programming #scheduling

A mixed integer linear programming approach for multi-degree cyclic multi-hoist scheduling problems without overlapping (XL, RYKF), pp. 274–279.

CASE-2013-WuCY #analysis #policy #reachability

A control policy for γ-nets without reachability analysis and siphon enumeration (WW, DYC, FY), pp. 1133–1138.

ICDAR-2013-CutterM #documentation #image #realtime

Real Time Camera Phone Guidance for Compliant Document Image Acquisition without Sight (MPC, RM), pp. 408–412.

ICDAR-2013-PantkeMF #evaluation #on the #word

On Evaluation of Segmentation-Free Word Spotting Approaches without Hard Decisions (WP, VM, TF), pp. 1300–1304.

ITiCSE-2013-FarrellFKRH #assessment #online

Capstone project online assessment tool without the paper work (VF, GF, PK, GR, DH), pp. 201–206.

WCRE-2013-SmithsonEAKB #correctness #trade-off

Static binary rewriting without supplemental information: Overcoming the tradeoff between coverage and correctness (MS, KE, KA, AK, RB), pp. 52–61.

ICFP-2013-Krishnaswami #functional #higher-order #programming

Higher-order functional reactive programming without spacetime leaks (NRK), pp. 221–232.

CIKM-2013-Zhang0D #corpus #mining #query

Mining a search engine’s corpus without a query pool (MZ, NZ, GD), pp. 29–38.

ICML-c2-2013-Tran-DinhKC #framework #graph #learning #matrix

A proximal Newton framework for composite minimization: Graph learning without Cholesky decompositions and matrix inversions (QTD, ATK, VC), pp. 271–279.

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.

SIGIR-2013-Soboroff #evaluation #interactive #student #tutorial

Building test collections: an interactive tutorial for students and others without their own evaluation conference series (IS), p. 1132.

ECOOP-2013-AliL #named #program analysis

Averroes: Whole-Program Analysis without the Whole Program (KA, OL), pp. 378–400.

RE-2013-AlspaughS #development #requirements

Ongoing software development without classical requirements (TAA, WS), pp. 165–174.

SAC-2013-NunesP #scheduling #throughput #transaction

Improving transaction abort rates without compromising throughput through judicious scheduling (AN, JP), pp. 493–494.

PPoPP-2013-YanLZ #algorithm #named #performance

StreamScan: fast scan algorithms for GPUs without global barrier synchronization (SY, GL, YZ), pp. 229–238.

CAV-2013-EssenJ #program repair

Program Repair without Regret (CvE, BJ), pp. 896–911.

VMCAI-2013-HeuleLMS

Abstract Read Permissions: Fractional Permissions without the Fractions (SH, KRML, PM, AJS), pp. 315–334.

ASE-2012-SteimannP #refactoring

Refactorings without names (FS, JvP), pp. 290–293.

SIGMOD-2012-HuXCY #authentication #privacy

Authenticating location-based services without compromising location privacy (HH, JX, QC, ZY), pp. 301–312.

SIGMOD-2012-TeubnerWN #automaton #configuration management

Skeleton automata for FPGAs: reconfiguring without reconstructing (JT, LW, CN), pp. 229–240.

STOC-2012-MosselR #theorem

A quantitative gibbard-satterthwaite theorem without neutrality (EM, MZR), pp. 1041–1060.

FLOPS-2012-Uustalu #performance

Explicit Binds: Effortless Efficiency with and without Trees (TU), pp. 317–331.

ICFP-2012-HenryMCM #type system

Typing unmarshalling without marshalling types (GH, MM, EC, PM), pp. 287–298.

CHI-2012-MarkVC #email #empirical #quote

“A pace not dictated by electrons”: an empirical study of work without email (GM, SV, AC), pp. 555–564.

CHI-2012-MasliT #community #online

Evaluating compliance-without-pressure techniques for increasing participation in online communities (MM, LGT), pp. 2915–2924.

CSCW-2012-ZhuKK12a #identification #modelling #online #social

Organizing without formal organization: group identification, goal setting and social modeling in directing online production (HZ, RK, AK), pp. 935–944.

ICEIS-J-2012-QuastHFE #information management #social

Social Information Systems: Agility Without Chaos (MQ, MJH, JMF, JE), pp. 55–71.

CIKM-2012-HagenPBS #query #segmentation #towards

Towards optimum query segmentation: in doubt without (MH, MP, AB, BS), pp. 1015–1024.

CIKM-2012-LiuQ #generative #mining

Mining high utility itemsets without candidate generation (ML, JFQ), pp. 55–64.

ICML-2012-BachrachGMG #adaptation #crowdsourcing #how #testing #visual notation

How To Grade a Test Without Knowing the Answers — A Bayesian Graphical Model for Adaptive Crowdsourcing and Aptitude Testing (YB, TG, TM, JG), p. 108.

ICPR-2012-LiangM #multi #segmentation

Object segmentation in multiple views without camera calibration (QL, ZM), pp. 890–893.

ICPR-2012-UlmB #clustering #online #robust

Robust online trajectory clustering without computing trajectory distances (MU, NB), pp. 2270–2273.

SIGIR-2012-JiangWLAW #alias #approach #detection #learning #similarity #string #towards

Towards alias detection without string similarity: an active learning based approach (LJ, JW, PL, NA, MW), pp. 1155–1156.

SIGIR-2012-KoumpouriS #effectiveness #feedback #query #retrieval

Queries without clicks: evaluating retrieval effectiveness based on user feedback (AK, VS), pp. 1133–1134.

OOPSLA-2012-KumarFBGT

Work-stealing without the baggage (VK, DF, SMB, DG, OT), pp. 297–314.

ICSE-2012-PradelG #automation #debugging #detection #generative #mining #specification #testing

Leveraging test generation and specification mining for automated bug detection without false positives (MP, TRG), pp. 288–298.

ASPLOS-2012-LinWLZ #named #power management #smarttech #using

Reflex: using low-power processors in smartphones without knowing them (FXL, ZW, RL, LZ), pp. 13–24.

ISMM-2012-InoueN #hardware #identification #java #source code

Identifying the sources of cache misses in Java programs without relying on hardware counters (HI, TN), pp. 133–142.

OSDI-2012-RenzelmannKS #named #testing

SymDrive: Testing Drivers without Devices (MJR, AK, MMS), pp. 279–292.

CAV-2012-SinhaSCS

Alternate and Learn: Finding Witnesses without Looking All over (NS, NS, SC, MS), pp. 599–615.

CASE-2011-BroderickAT #detection #formal method #industrial

Anomaly detection without a pre-existing formal model: Application to an industrial manufacturing system (JAB, LVA, DMT), pp. 169–174.

CASE-2011-LiuFOCK #visual notation

Weld pool visual sensing without external illumination (JL, ZF, SIO, KHC, JKK), pp. 145–150.

ICDAR-2011-Baird #documentation #modelling #recognition

Document Recognition without Strong Models (HSB), pp. 414–423.

VLDB-2011-HaasMST #modelling

Data is Dead... Without What-If Models (PJH, PPM, PGS, WCT), pp. 1486–1489.

VLDB-2011-TzoumasDJ #estimation #independence #lightweight #modelling #visual notation

Lightweight Graphical Models for Selectivity Estimation Without Independence Assumptions (KT, AD, CSJ), pp. 852–863.

ESOP-2011-BrauerK #quantifier #synthesis

Transfer Function Synthesis without Quantifier Elimination (JB, AK), pp. 97–115.

FM-2011-Dunne #csp #termination

Termination without √ in CSP (SD), pp. 278–292.

CHI-2011-BragdonK #gesture #scalability

Gesture select: : acquiring remote targets on large displays without pointing (AB, HSK), pp. 187–196.

CHI-2011-MiyataF #documentation #identification

Document area identification for extending books without markers (AM, KF), pp. 3189–3198.

CIKM-2011-DongZCZZLWO #database #mining #named #performance

e-NSP: efficient negative sequential pattern mining based on identified positive patterns without database rescanning (XD, ZZ, LC, YZ, CZ, JL, WW, YO), pp. 825–830.

CIKM-2011-KargarA #network #social

Discovering top-k teams of experts with/without a leader in social networks (MK, AA), pp. 985–994.

ICML-2011-ChakrabortyS #learning

Structure Learning in Ergodic Factored MDPs without Knowledge of the Transition Function’s In-Degree (DC, PS), pp. 737–744.

KDD-2011-WangLZ #analysis #keyword #rating

Latent aspect rating analysis without aspect keyword supervision (HW, YL, CZ), pp. 618–626.

OOPSLA-2011-WuHIN #java #performance #scalability

Reducing trace selection footprint for large-scale Java applications without performance loss (PW, HH, HI, TN), pp. 789–804.

SAC-2011-MunizL #encryption #on the #protocol #recognition

On the (im)possibility of perennial message recognition protocols without public-key cryptography (MGM, PL), pp. 1510–1515.

ICSE-2011-KazmanBIM #architecture #evaluation #experience #grid #smarttech

Architecture evaluation without an architecture: experience with the smart grid (RK, LB, JI, GAM), pp. 663–670.

HPDC-2011-Chen

Algorithm-based recovery for iterative methods without checkpointing (ZC), pp. 73–84.

PPoPP-2011-Ding #concurrent #parallel #programming

Two examples of parallel programming without concurrency constructs (PP-CC) (CD), pp. 299–300.

CADE-2011-BaaderBBM #concept #logic #unification

Unification in the Description Logic EL without the Top Concept (FB, TBN, SB, BM), pp. 70–84.

ICTSS-2011-Walkinshaw #black box #specification #test coverage #testing

Assessing Test Adequacy for Black-Box Systems without Specifications (NW), pp. 209–224.

LICS-2011-MadelaineM #first-order #logic #similarity

A Tetrachotomy for Positive First-Order Logic without Equality (FRM, BM), pp. 311–320.

VMCAI-2011-Bradley #model checking #satisfiability

SAT-Based Model Checking without Unrolling (ARB), pp. 70–87.

VLDB-2010-DittrichQJKSS

Hadoop++: Making a Yellow Elephant Run Like a Cheetah (Without It Even Noticing) (JD, JAQR, AJ, YK, VS, JS), pp. 518–529.

STOC-2010-Ajtai

Oblivious RAMs without cryptogrpahic assumptions (MA), pp. 181–190.

STOC-2010-CardinalFJJM #algorithm #sorting

Sorting under partial information (without the ellipsoid algorithm) (JC, SF, GJ, RMJ, JIM), pp. 359–368.

STOC-2010-DodisPT

Changing base without losing space (YD, MP, MT), pp. 593–602.

FLOPS-2010-AltenkirchDLO #dependent type #named

ΠΣ: Dependent Types without the Sugar (TA, NAD, AL, NO), pp. 40–55.

ICALP-v1-2010-GrandoniR #design #network #problem

Network Design via Core Detouring for Problems without a Core (FG, TR), pp. 490–502.

ICALP-v2-2010-ChalopinD #mobile

Rendezvous of Mobile Agents without Agreement on Local Orientation (JC, SD), pp. 515–526.

ICFP-2010-MorrisJ #programming

Instance chains: type class programming without overlapping instances (JGM, MPJ), pp. 375–386.

CIKM-2010-MoonDJLZ #behaviour #ranking

User behavior driven ranking without editorial judgments (TM, GD, SJ, CL, ZZ), pp. 1473–1476.

ICML-2010-ZhangS #reduction

Projection Penalties: Dimension Reduction without Loss (YZ, JGS), pp. 1223–1230.

ICPR-2010-GaschlerBH #3d #re-engineering

Epipolar-Based Stereo Tracking Without Explicit 3D Reconstruction (AG, DB, GDH), pp. 1755–1758.

ECOOP-2010-RenggliGN #tool support

Embedding Languages without Breaking Tools (LR, TG, ON), pp. 380–404.

POPL-2010-SiekW

Threesomes, with and without blame (JGS, PW), pp. 365–376.

SAC-2010-Brunthaler #performance

Efficient inline caching without dynamic translation (SB), pp. 2155–2156.

SAC-2010-Pamies-JuarezL #maintenance #reliability

Maintaining data reliability without availability in P2P storage systems (LPJ, PGL), pp. 684–688.

CSL-2010-MartinM #complexity #first-order #logic #similarity

The Complexity of Positive First-Order Logic without Equality II: The Four-Element Case (BM, JM), pp. 426–438.

DATE-2009-SauvageGDMN #constraints

Successful attack on an FPGA-based WDDL DES cryptoprocessor without place and route constraints (LS, SG, JLD, YM, MN), pp. 640–645.

ICDAR-2009-EynardE #documentation #recognition #word

Italic or Roman: Word Style Recognition without A Priori Knowledge for Old Printed Documents (LE, HE), pp. 823–827.

VLDB-2009-MishimaN #database #middleware #named #replication

Pangea: An Eager Database Replication Middleware guaranteeing Snapshot Isolation without Modification of Database Servers (TM, HN), pp. 1066–1077.

VLDB-2009-MozafariZ #classification #naive bayes #privacy

Publishing Naive Bayesian Classifiers: Privacy without Accuracy Loss (BM, CZ), pp. 1173–1185.

ICALP-v1-2009-ArackaparambilBC #functional #monitoring

Functional Monitoring without Monotonicity (CA, JB, AC), pp. 95–106.

LATA-2009-AbdullaDB #comparison #petri net

A Language-Based Comparison of Extensions of Petri Nets with and without Whole-Place Operations (PAA, GD, LVB), pp. 71–82.

FM-2009-Tonetta #abstraction #model checking

Abstract Model Checking without Computing the Abstraction (ST), pp. 89–105.

CHI-2009-IsbisterH #challenge #design #evaluation #human-computer #on the

On being supple: in search of rigor without rigidity in meeting new design and evaluation challenges for HCI practitioners (KI, KH), pp. 2233–2242.

CHI-2009-NewtonKM #comparison #online #word

Autism online: a comparison of word usage in bloggers with and without autism spectrum disorders (ATN, ADIK, DNM), pp. 463–466.

HCD-2009-PohlmeyerBWM #approach #experience #user interface

The Value of Answers without Question[s]: A Qualitative Approach to User Experience and Aging (AEP, LTMB, HW, JM), pp. 894–903.

HCI-AUII-2009-VerhoefLBOZC #word

Bio-sensing for Emotional Characterization without Word Labels (TV, CLL, AB, FRO, TvdZ, FC), pp. 693–702.

EDOC-2009-Vaucouleur #enterprise

Customizable and Upgradable Enterprise Systems without the Crystal Ball Assumption (SV), pp. 203–212.

CIKM-2009-Duan #privacy

Privacy without noise (YD), pp. 1517–1520.

ECIR-2009-Efron #aspect-oriented #multi #query #using

Using Multiple Query Aspects to Build Test Collections without Human Relevance Judgments (ME), pp. 276–287.

ICML-2009-HuangS #learning #linear #sequence

Learning linear dynamical systems without sequence information (TKH, JGS), pp. 425–432.

OOPSLA-2009-MalayeriA #inheritance #multi #named

CZ: multiple inheritance without diamonds (DM, JA), pp. 21–40.

ASPLOS-2009-MytkowiczDHS #exclamation

Producing wrong data without doing anything obviously wrong! (TM, AD, MH, PFS), pp. 265–276.

CC-2009-Padioleau #c #c++ #parsing #preprocessor

Parsing C/C++ Code without Pre-processing (YP), pp. 109–125.

LCTES-2009-StotzerL #scheduling

Modulo scheduling without overlapped lifetimes (ES, ELL), pp. 1–10.

ICST-2009-LeitnerPMMO #effectiveness #on the

On the Effectiveness of Test Extraction without Overhead (AL, AP, SM, BM, MO), pp. 416–425.

ICST-2009-MurphySK #ml #runtime #testing #using

Using JML Runtime Assertion Checking to Automate Metamorphic Testing in Applications without Test Oracles (CM, KS, GEK), pp. 436–445.

ISSTA-2009-MurphySK #automation #source code #testing

Automatic system testing of programs without test oracles (CM, KS, GEK), pp. 189–200.

LICS-2009-MadelaineM #complexity #first-order #logic #similarity

The Complexity of Positive First-order Logic without Equality (FRM, BM), pp. 429–438.

CASE-2008-PaekL #clustering #scheduling #strict #tool support

Optimal scheduling of dual-armed cluster tools without swap restriction (JHP, TEL), pp. 103–108.

FLOPS-2008-Kobayashi08a #backtracking #continuation

A New Translation for Semi-classical Theories — Backtracking without CPS (SK), pp. 210–223.

ICALP-A-2008-BodlaenderDFH #kernel #on the #polynomial #problem

On Problems without Polynomial Kernels (Extended Abstract) (HLB, RGD, MRF, DH), pp. 563–574.

ICALP-C-2008-CanettiEGL #how

How to Protect Yourself without Perfect Shredding (RC, DE, SG, DYL), pp. 511–523.

CSCW-2008-IgnatPON #collaboration #multi #privacy

Providing awareness in multi-synchronous collaboration without compromising privacy (CLI, SP, GO, MCN), pp. 659–668.

CIKM-2008-LinL #clique #mining #performance

Fast spatial co-location mining without cliqueness checking (ZL, SL), pp. 1461–1462.

ICPR-2008-ChenJ #3d #estimation #information retrieval

3D gaze estimation with a single camera without IR illumination (JC, QJ), pp. 1–4.

ICPR-2008-El-ZehiryE #constraints

Agraph cut based active contour without edges with relaxed homogeneity constraint (NYEZ, AE), pp. 1–4.

SIGIR-2008-QiD #classification #web

Classifiers without borders: incorporating fielded text from neighboring web pages (XQ, BDD), pp. 643–650.

SIGIR-2008-TanWC #detection #sentiment #using

Combining learn-based and lexicon-based techniques for sentiment detection without using labeled examples (ST, YW, XC), pp. 743–744.

ISMM-2008-GormanH #hardware

Supporting superpage allocation without additional hardware support (MG, PH), pp. 41–50.

PPoPP-2008-NishtalaAC #communication #layout #performance

Performance without pain = productivity: data layout and collective communication in UPC (RN, GA, CC), pp. 99–110.

ICLP-2008-Niemela #programming #set

Answer Set Programming without Unstratified Negation (IN), pp. 88–92.

DAC-2007-Rabaey #design #legacy

Design without Borders — A Tribute to the Legacy of A. Richard Newton (JMR).

DATE-2007-MoonBP #approach #composition #equivalence

A compositional approach to the combination of combinational and sequential equivalence checking of circuits without known reset states (IHM, PB, CP), pp. 1170–1175.

DRR-2007-HarringtonW #documentation

Presentation of structured documents without a style sheet (SJH, EW).

SIGMOD-2007-AnciauxBBPS #named #query

GhostDB: querying visible and hidden data without leaks (NA, MB, LB, PP, DS), pp. 677–688.

FoSSaCS-2007-BreugelSW #approximate #behaviour #probability #pseudo

Approximating a Behavioural Pseudometric Without Discount for Probabilistic Systems (FvB, BS, JW), pp. 123–137.

TACAS-2007-AbdullaDHR #model checking #performance #transducer #verification

Regular Model Checking Without Transducers (On Efficient Verification of Parameterized Systems) (PAA, GD, NBH, AR), pp. 721–736.

ICALP-2007-ChandranGS #random

Ring Signatures of Sub-linear Size Without Random Oracles (NC, JG, AS), pp. 423–434.

ICALP-2007-MillerPS #scalability

Size Competitive Meshing Without Large Angles (GLM, TP, DS), pp. 655–666.

LATA-2007-Domosi #automaton #network

Automata Networks without any Letichevsky Criteria (PD), pp. 237–248.

ICFP-2007-Herman #functional #how

Functional pearl: the great escape or, how to jump the border without getting caught (DH), pp. 157–164.

CHI-2007-HurstHM #detection

Dynamic detection of novice vs. skilled use without a task model (AH, SEH, JM), pp. 271–280.

CHI-2007-KristenssonZ #gesture #using

Command strokes with and without preview: using pen gestures on keyboard for command selection (POK, SZ), pp. 1137–1146.

ICEIS-J-2007-ArjunanWKNY #recognition #using

Recognition of Human Voice Utterances from Facial Surface EMG without Using Audio Signals (SPA, HW, DKK, GRN, WCY), pp. 366–378.

ICML-2007-LiLL #learning #scalability

Large-scale RLSC learning without agony (WL, KHL, KSL), pp. 529–536.

ICML-2007-Yairi #locality #reduction

Map building without localization by dimensionality reduction techniques (TY), pp. 1071–1078.

SAC-2007-XianhuaJX #performance #reduction

Efficient code size reduction without performance loss (LX, ZJ, CX), pp. 666–672.

MBT-2007-RaimondiPB #model checking #testing

Testing Planning Domains (without Model Checkers) (FR, CP, GB), pp. 113–125.

CBSE-2006-AttieLPC #behaviour #component #design #explosion #verification

Behavioral Compatibility Without State Explosion: Design and Verification of a Component-Based Elevator Control System (PCA, DHL, AP, HC), pp. 33–49.

VLDB-2006-MoerkotteN #algorithm #analysis #generative #programming

Analysis of Two Existing and One New Dynamic Programming Algorithm for the Generation of Optimal Bushy Join Trees without Cross Products (GM, TN), pp. 930–941.

VLDB-2006-MokbelCA #privacy #query

The New Casper: Query Processing for Location Services without Compromising Privacy (MFM, CYC, WGA), pp. 763–774.

PLDI-2006-LauAHC #online #optimisation #performance #using

Online performance auditing: using hot optimizations without getting burned (JL, MA, MH, BC), pp. 239–251.

CIAA-2006-YangXSP #hybrid #quantum #synthesis

Universality of Hybrid Quantum Gates and Synthesis Without Ancilla Qudits (GY, FX, XS, MAP), pp. 279–280.

ICALP-v2-2006-WikstromG #adaptation

An Adaptively Secure Mix-Net Without Erasures (DW, JG), pp. 276–287.

FM-2006-Kassios #dependence #strict

Dynamic Frames: Support for Framing, Dependencies and Sharing Without Restrictions (ITK), pp. 268–283.

CHI-2006-NekrasovskiBMGM #bibliography #evaluation #navigation #perspective

An evaluation of pan & zoom and rubber sheet navigation with and without an overview (DN, AB, JM, FG, TM), pp. 11–20.

CIKM-2006-BartoliniCP #named

SaLSa: computing the skyline without scanning the whole sky (IB, PC, MP), pp. 405–414.

CIKM-2006-KimC #concept #mining #named #similarity #taxonomy

CP/CV: concept similarity mining without frequency information from domain describing taxonomies (JWK, KSC), pp. 483–492.

ECIR-2006-SanJuanI #clustering #documentation

Phrase Clustering Without Document Context (ES, FIS), pp. 496–500.

ICPR-v1-2006-MoritaniHS #feature model #realtime

Real-Time Object Tracking without Feature Extraction (TM, SH, KS), pp. 747–750.

ICPR-v1-2006-ZuwalaR #information management

Browsing graphics without prior knowledge (DZ, JR), pp. 735–738.

ICPR-v4-2006-AndersenJM #estimation

Estimation of Dynamic Light Changes in Outdoor Scenes Without the use of Calibration Objects (MSA, TJ, CBM), pp. 91–94.

KR-2006-DuboisGK #abduction #probability

Probabilistic Abduction without Priors (DD, AG, GKI), pp. 420–430.

SEKE-2006-RatanotayanonKS #agile #documentation

After the Scrum: Twenty Years of Working without Documentation (SR, JK, SES), pp. 194–199.

SIGIR-2006-KurlandL #clustering #exclamation #modelling

Respect my authority!: HITS without hyperlinks, utilizing cluster-based language models (OK, LL), pp. 83–90.

ECOOP-2006-SkotiniotisPL #adaptation #interface #programming

Demeter Interfaces: Adaptive Programming Without Surprises (TS, JP, KJL), pp. 477–500.

CSL-2006-HenzingerP #game studies

Solving Games Without Determinization (TAH, NP), pp. 395–410.

DAC-2005-MonyBPK #proving

Exploiting suspected redundancy without proving it (HM, JB, VP, RK), pp. 463–466.

DAC-2005-Rossi #design #formal method #question #scalability #verification

Can we really do without the support of formal methods in the verification of large designs? (UR), pp. 672–673.

PLDI-2005-HertzFB #garbage collection

Garbage collection without paging (MH, YF, EDB), pp. 143–153.

STOC-2005-DodisS #fault

Correcting errors without leaking partial information (YD, AS), pp. 654–663.

ICALP-2005-GuptaP #probability

Stochastic Steiner Trees Without a Root (AG, MP), pp. 1051–1063.

ICALP-2005-HromkovicS

NFAs With and Without epsilon-Transitions (JH, GS), pp. 385–396.

IFM-2005-BarradasB #fixpoint #semantics

A Fixpoint Semantics of Event Systems With and Without Fairness Assumptions (HRB, DB), pp. 327–346.

CHI-2005-BaudischCHE #named

Snap-and-go: helping users align objects without the modality of traditional snapping (PB, EC, KH, AE), pp. 301–310.

CIKM-2005-MasonL #complexity #named #query #relational #sql

INFER: a relational query language without the complexity of SQL (TM, RL), pp. 241–242.

ECIR-2005-SuomelaK #case study #concept #ontology #query

Ontology as a Search-Tool: A Study of Real Users’ Query Formulation With and Without Conceptual Support (SS, JK), pp. 315–329.

ICML-2005-WolfeJS #learning #predict

Learning predictive state representations in dynamical systems without reset (BW, MRJ, SPS), pp. 980–987.

SIGIR-2005-KurlandL #modelling #rank #ranking #using

PageRank without hyperlinks: structural re-ranking using links induced by language models (OK, LL), pp. 306–313.

SAC-2005-QuagliaR #coordination #persistent #reliability

Reliability in three-tier systems without application server coordination and persistent message queues (FQ, PR), pp. 718–723.

SPLC-2005-ZhangJ #experience #industrial #mobile #performance #product line #reuse

Reuse without Compromising Performance: Industrial Experience from RPG Software Product Line for Mobile Devices (WZ, SJ), pp. 57–69.

DAC-2004-VujkovicWSS #performance

Efficient timing closure without timing driven placement and routing (MV, DW, WS, CS), pp. 268–273.

VLDB-2004-YangL #information management #xml

Secure XML Publishing without Information Leakage in the Presence of Data Inference (XY, CL), pp. 96–107.

TACAS-2004-SuW #analysis #constraints

A Class of Polynomially Solvable Range Constraints for Interval Analysis without Widenings and Narrowings (ZS, DW), pp. 280–295.

STOC-2004-FinocchiI #fault #memory management #sorting

Sorting and searching in the presence of memory faults (without redundancy) (IF, GFI), pp. 101–110.

STOC-2004-PrabhakaranS #security

New notions of security: achieving universal composability without trusted setup (MP, AS), pp. 242–251.

CHI-2004-BaudischG #game studies #multi #named

Multiblending: displaying overlapping windows simultaneously without the drawbacks of alpha blending (PB, CG), pp. 367–374.

CHI-2004-LecuyerBE #interface #pseudo

Feeling bumps and holes without a haptic interface: the perception of pseudo-haptic textures (AL, JMB, LE), pp. 239–246.

ICPR-v1-2004-CaoF #metric #using

Simple Calibration Without Metric Information Using an Isoceles Trapezoid (XC, HF), pp. 104–107.

ICPR-v1-2004-KusachiSIA #detection #image #recognition #robust

Kanji Recognition in Scene Images without Detection of Text Fields — Robust Against Variation of Viewpoint, Contrast, and Background Texture (YK, AS, NI, KA), pp. 457–460.

ICPR-v2-2004-SarkarB #automation

Decoder Banks: Versatility, Automation, and High Accuracy without Supervised Training (PS, HSB), pp. 646–649.

ICPR-v2-2004-ToyamaSM #image #set

Image Mosaicing from a Set of Images Without Configuration Information (FT, KS, JM), pp. 899–902.

ICPR-v3-2004-BoughorbelKAA #energy

Gaussian Energy Functions for Registration without Correspondences (FB, AK, BRA, MAA), pp. 24–27.

ICPR-v3-2004-VosBASMVV #statistics #using

A Statistical Shape Model without Using Landmarks (FV, PWdB, JGMA, GJS, MM, LJvV, AMV), pp. 714–717.

SIGIR-2004-MayfieldM

Triangulation without translation (JM, PM), pp. 490–491.

OOPSLA-2004-BravenboerV #domain-specific language #strict #syntax

Concrete syntax for objects: domain-specific language embedding and assimilation without restrictions (MB, EV), pp. 365–383.

SAC-2004-SeigneurJ #privacy #trust #ubiquitous

Trust enhanced ubiquitous payment without too much privacy loss (JMS, CDJ), pp. 1593–1599.

SAC-2004-ShangSG #generative #mining #sql

SQL based frequent pattern mining without candidate generation (XS, KUS, IG), pp. 618–619.

ISMM-2004-WickF #memory management

Memory accounting without partitions (AW, MF), pp. 120–130.

LCTES-2004-Wasowski

Flattening statecharts without explosions (AW), pp. 257–266.

ITiCSE-2003-Becker03b #student

Assignments that meet the needs of exceptional students without disadvantaging the average (KB), p. 271.

TACAS-2003-McMillanA #abstraction #automation

Automatic Abstraction without Counterexamples (KLM, NA), pp. 2–17.

ICSM-2003-BarrE

Safe Upgrading without Restarting (MB, SE), pp. 129–137.

SAS-2003-Thiemann #continuation #partial evaluation

Continuation-Based Partial Evaluation without Continuations (PT), pp. 366–382.

STOC-2003-Lindell #bound

Bounded-concurrent secure two-party computation without setup assumptions (YL), pp. 683–692.

OOPSLA-2003-BlackburnM #garbage collection #performance

Ulterior reference counting: fast garbage collection without a long wait (SB, KSM), pp. 344–358.

PPDP-2003-AntoyBH

Conditional narrowing without conditions (SA, BB, MH), pp. 20–31.

SAC-2003-HuangXSP #mining

Mining Confident Colocation Rules without A Support Threshold (YH, HX, SS, JP), pp. 497–501.

SAC-2003-WuC #information retrieval #ranking

Methods for Ranking Information Retrieval Systems Without Relevance Judgments (SW, FC), pp. 811–816.

LCTES-2003-DhurjatiKAL #garbage collection #memory management #runtime #safety

Memory safety without runtime checks or garbage collection (DD, SK, VSA, CL), pp. 69–80.

CADE-2003-Nivelle #axiom #first-order #proving

Translation of Resolution Proofs into Short First-Order Proofs without Choice Axioms (HdN), pp. 365–379.

CSL-2003-Korovina #aspect-oriented #similarity

Computational Aspects of σ-Definability over the Real Numbers without the Equality Test (MVK), pp. 330–344.

ASE-2002-GueheneucDJ #dynamic analysis #java #source code

No Java without Caffeine: A Tool for Dynamic Analysis of Java Programs (YGG, RD, NJ), p. 117–?.

ICGT-2002-FernandezM #call-by #graph grammar

Call-by-Value λ-Graph Rewriting Without Rewriting (MF, IM), pp. 75–89.

CHI-2002-ZhengVBOO #process #social #trust

Trust without touch: jumpstarting long-distance trust with initial social activities (JZ, ESV, NB, JSO, GMO), pp. 141–146.

ICPR-v2-2002-BrandtHE #image #on the

On the Alignment of Transmission Electron Microscope Images without Fiducial Markers (SSB, JH, PE), pp. 278–281.

ICPR-v3-2002-KitasakaMHT #3d #automation #image #modelling #using

A Method for Automated Extraction of Aorta and Pulmonary Artery in the Mediastinum Using Medial Line Models from 3D Chest X-ray CT Images without Contrast Materials (TK, KM, JiH, JiT), p. 273–?.

ICPR-v3-2002-LuT #analysis #documentation #image #layout #word

Word Spotting in Chinese Document Images without Layout Analysis (YL, CLT), pp. 57–60.

OOPSLA-2002-KawachiyaKO #java

Lock reservation: Java locks can mostly do without atomic operations (KK, AK, TO), pp. 130–141.

ICSM-2001-OtaniY #component #network #off the shelf

A Customization Method for Network Management Functions without Modification of Off-the-Shelf Components (TO, YY), pp. 460–469.

PLDI-2001-BaconALRS #garbage collection #java #multi

Java without the Coffee Breaks: A Nonintrusive Multiprocessor Garbage Collector (DFB, CRA, HBL, VTR, SES), pp. 92–103.

CIAA-2001-BoigelotL #equation

Counting the Solutions of Presburger Equations without Enumerating Them (BB, LL), pp. 40–51.

ICALP-2001-LiN #generative #performance

Efficient Generation of Plane Triangulations without Repetitions (ZL, SIN), pp. 433–443.

ICFP-2001-DimockWMTW #ml #standard #type safety

Functioning without Closure: Type-Safe Customized Function Representations for Standard ML (AD, IW, RM, FAT, JBW), pp. 14–25.

CIKM-2001-WangHCC #mining

Mining Confident Rules Without Support Requirement (KW, YH, DWLC, FYLC), pp. 89–96.

SIGIR-2001-JinFH #automation #information retrieval #named

Meta-scoring: Automatically Evaluating Term Weighting Schemes in IR without Precision-Recall (RJ, CF, AGH), pp. 83–89.

SIGIR-2001-SoboroffNC #ranking #retrieval

Ranking Retrieval Systems without Relevance Judgments (IS, CKN, PC), pp. 66–73.

OOPSLA-2001-CzajkowskiD #evolution #multi #virtual machine

Multitasking without Compromise: A Virtual Machine Evolution (GC, LD), pp. 125–138.

CSL-2001-Schroder

Life without the Terminal Type (LS), pp. 429–442.

LICS-2001-Salibra #semantics #λ-calculus

A Continuum of Theories of λ Calculus without Semantics (AS), pp. 334–343.

SIGMOD-2000-HanPY #generative #mining

Mining Frequent Patterns without Candidate Generation (JH, JP, YY), pp. 1–12.

ITiCSE-2000-Gerhardt-Powals

Have a great lab without needing roller skates (JGP), p. 182.

WRLA-2000-NakamuraO #evaluation #normalisation #on-demand

The evaluation strategy for head normal form with and without on-demand flags (MN, KO), pp. 212–228.

ICPR-v1-2000-SappaG #bound #fault #image #modelling #optimisation

Modeling Range Images with Bounded Error Triangular Meshes without Optimization (ADS, MAG), pp. 1392–1395.

ICPR-v1-2000-SugayaO #algorithm #integration

Stereo by Integration of Two Algorithms with/without Occlusion Handling (YS, YO), pp. 1109–1113.

OOPSLA-2000-BaconST #java #named

Guava: a dialect of Java without data races (DFB, RES, AT), pp. 382–400.

OOPSLA-2000-RubyL #subclass

Safely creating correct subclasses without seeing superclass code (CR, GTL), pp. 208–228.

TOOLS-ASIA-2000-LiuJC #approach #graph

A Graph-Theoretic Approach for Recognizing the User Interpretation without Conflicts (GL, WJ, ZC), pp. 291–298.

ICRE-2000-AntonA #certification #requirements #what

What Do You Mean I’ve Been Practicing without a License? Certification and Licensing of Requirements Engineering Professionals (AIA, JMA), p. 151.

ICRE-2000-Mead00a #certification #requirements #what

What Do You Mean I’m Practicing without a License? Certification and Licensing of Requirements Engineering Professionals (NRM), p. 152.

DAC-1999-ZhaoM #array #estimation #memory management

Exact Memory Size Estimation for Array Computations without Loop Unrolling (YZ, SM), pp. 811–816.

SIGMOD-1999-AboulnagaC #self

Self-tuning Histograms: Building Histograms Without Looking at Data (AA, SC), pp. 181–192.

TACAS-1999-BiereCCZ #model checking

Symbolic Model Checking without BDDs (AB, AC, EMC, YZ), pp. 193–207.

STOC-1999-AwerbuchALR #migration

Minimizing the Flow Time Without Migration (BA, YA, SL, OR), pp. 198–205.

STOC-1999-SudanTV #generative #pseudo

Pseudorandom Generators Without the XOR Lemma (Extended Abstract) (MS, LT, SPV), pp. 537–546.

FLOPS-1999-AntoyT #higher-order

Typed Higher-Order Narrowing without Higher-Order Strategies (SA, APT), pp. 335–353.

FLOPS-1999-CamaraoF #strict #type inference

Type Inference for Overloading without Restrictions, Declarations or Annotations (CC, LF), pp. 37–52.

ICFP-1999-BentonK #java

Interlanguage Working Without Tears: Blending SML with Java (NB, AK), pp. 126–137.

IFL-1999-Chitil #deforestation

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

CAV-1999-BiereCRZ #model checking #safety #using

Verifiying Safety Properties of a Power PC Microprocessor Using Symbolic Model Checking without BDDs (AB, EMC, RR, YZ), pp. 60–71.

CSL-1999-DiekertG #logic

An Expressively Complete Temporal Logic without Past Tense Operators for Mazurkiewicz Traces (VD, PG), pp. 188–203.

DATE-1998-Eijk #equivalence #traversal

Sequential Equivalence Checking without State Space Traversal (CAJvE), pp. 618–623.

DATE-1998-Lin #compilation #concurrent #performance #runtime #scheduling #source code

Efficient Compilation of Process-Based Concurrent Programs without Run-Time Scheduling (BL), pp. 211–217.

DATE-1998-Mutz #modelling

Register Transfer Level VHDL Models without Clocks (MM), pp. 153–158.

DATE-1998-SungH #hardware

Optimized Timed Hardware Software Cosimulation without Roll-back (WS, SH), pp. 945–946.

SIGMOD-1998-Cohen #database #integration #query #semistructured data #similarity #using

Integration of Heterogeneous Databases Without Common Domains Using Queries Based on Textual Similarity (WWC), pp. 201–212.

ICML-1998-FrankW #generative #optimisation #set

Generating Accurate Rule Sets Without Global Optimization (EF, IHW), pp. 144–151.

TOOLS-USA-1998-Campbell #adaptation #component #reuse

Adaptable Components for Reuse without Rework (GHCJ), p. 362.

SAC-1998-Li98a #algorithm #distributed #online #random

Deterministic and randomized algorithms for distributed on-line task assignment and load balancing without load status information (KL), pp. 613–622.

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.

LICS-1998-Bars #higher-order #logic

Fragments of Existential Second-Order Logic without 0-1 Laws (JMLB), pp. 525–536.

LICS-1998-BorealeS #bisimulation #calculus

Bisimulation in Name-Passing Calculi without Matching (MB, DS), pp. 165–175.

ICDAR-1997-NakagawaHYSHA #database #online #sequence

On-line Handwritten Character Pattern Database Sampled in a Sequence of Sentences without any Writing Instructions (MN, TH, YY, SiS, LH, KA), pp. 376–381.

ICDAR-1997-OgierMLL #analysis #image #reliability #semantics

An Image Interpretation Device cannot be Reliable without any Semantic Coherency Analysis of the Interpretated Objects — Application to French Cadastral Maps (JMO, RM, JL, YL), pp. 532–535.

ICDAR-1997-OzdilV #recognition #segmentation

Optical Character Recognition Without Segmentation (MAÖ, FTYV), pp. 483–486.

VLDB-1997-PoosalaI #estimation #independence

Selectivity Estimation Without the Attribute Value Independence Assumption (VP, YEI), pp. 486–495.

ITiCSE-1997-BifflG #education #project management #quality #re-engineering

Teaching software engineering and project management to 300 participants without drain of quality or intensity (SB, TG), pp. 51–53.

ICFP-1997-Lassila #code generation #confluence #context-sensitive grammar #functional #metaprogramming #optimisation

A Functional Macro Expansion System for Optimizing Code Generation: Gaining Context-Sensitivity without Losing Confluence (EL), p. 315.

HCI-CC-1997-Long #human-computer #question

Twenty-Five Years of HCI: Growth Without Progress? (JL), pp. 197–200.

HCI-SEC-1997-UchiyamaYKT #3d #geometry #interactive

Presentation and Interaction of Virtual 3D Objects Without Geometrical Model (SU, HY, AK, HT), pp. 869–872.

SIGIR-1997-ChenHXGM #retrieval #taxonomy #using

Chinese Text Retrieval Without Using a Dictionary (AC, JH, LX, FCG, JM), pp. 42–49.

ECOOP-1997-Mezini #evolution

Dynamic Object Evolution without Name Collisions (MM), pp. 190–219.

OOPSLA-1997-ZendraCC #compilation #performance

Efficient Dynamic Dispatch without Virtual Function Tables: The SmallEiffel Compiler (OZ, DC, SC), pp. 125–141.

LOPSTR-1997-BossiC #source code

Programs Without Failures (AB, NC), pp. 28–48.

HPCA-1997-MarkatosK #kernel #operating system

User-Level DMA without Operating System Kernel Modification (EPM, MK), pp. 322–331.

HPDC-1997-NetzerX #distributed #game studies #source code

Replaying Distributed Programs without Message Logging (RHBN, YX), pp. 137–147.

DAC-1996-IyerLA #identification

Identifying Sequential Redundancies Without Search (MAI, DEL, MA), pp. 457–462.

VLDB-1996-Ogawa #documentation #effectiveness #performance #ranking #scalability #using

Effective & Efficient Document Ranking without using a Large Lexicon (YO), pp. 192–202.

FME-1996-Clement #abstraction

Data Reification without Explicit Abstraction Functions (TC), pp. 195–213.

FME-1996-Hoare #how #proving #question #reliability

How Did Software Get So Reliable Without Proof? (CARH), pp. 1–17.

CAiSE-1996-BellahsenePT #design #information management

Views for Information System Design without Reorganization (ZB, PP, MT), pp. 496–513.

ICPR-1996-HsiehLFK #algorithm #image #performance

A fast algorithm for image registration without predetermining correspondences (JWH, HYML, KCF, MTK), pp. 765–769.

ICPR-1996-RoyC

Motion without structure (SR, IJC), pp. 728–734.

ICSE-1996-Hoare #how #proving #reliability

The Role of Formal Techniques: Past, Current and Future or How Did Software Get so Reliable without Proof? (Extended Abstract) (CARH), pp. 233–234.

CC-1996-ProebstingW #parsing

One-Pass, Optimal Tree Parsing — With Or Without Trees (TAP, BRW), pp. 294–308.

JICSLP-1996-Ducassen #prolog

Tracing Prolog without a Tracer (Poster Abstract) (MD, JN), p. 534.

ICDAR-v1-1995-MurshedBS #approach #verification

Off-line signature verification, without a priori knowledge of class /spl omega//sub 2/. A new approach (NAM, FB, RS), pp. 191–196.

DLT-1995-Banik #turing machine

Colonies as Systems of Turing Machines Without States (IB), pp. 189–198.

ECOOP-1995-SteyaertM #inheritance

A Marriage of Class- and Object-Based inheritance Without Unwanted Children (PS, WDM), pp. 127–144.

LOPSTR-1995-Leuschel #constraints #deduction

Ecological Partial Deduction: Preserving Characteristic Trees Without Constraints (ML), pp. 1–16.

IWMM-1995-Rojemo #functional #garbage collection #lazy evaluation

Generational Garbage Collection without Temporary Space Leaks for Lazy Functional Languages (NR), pp. 145–162.

ILPS-1995-DimopoulosK #logic programming

Logic Programming without Negation as Failure (YD, ACK), pp. 369–383.

LICS-1995-Lynch

Paramodulation without Duplication (CL), pp. 167–177.

PLDI-1994-HentenryckR #backtracking

Backtracking without Trailing in CLP(R_Lin) (PVH, VR), pp. 349–360.

ICML-1994-SinghJJ #learning #markov #process

Learning Without State-Estimation in Partially Observable Markovian Decision Processes (SPS, TSJ, MIJ), pp. 284–292.

POPL-1994-WeiseCES #dependence #graph #representation

Value Dependence Graphs: Representation without Taxation (DW, RFC, MDE, BS), pp. 297–310.

CADE-1994-BaumgartnerF

Model Elimination Without Contrapositives (PB, UF), pp. 87–101.

STOC-1993-PapadimitriouY #linear #matrix #programming

Linear programming without the matrix (CHP, MY), pp. 121–129.

FPCA-1993-Sparud #garbage collection

Fixing Some Space Leaks without a Garbage Collector (JS), pp. 117–124.

POPL-1993-PierceT #object-oriented #programming #recursion

Object-Oriented Programming without Recursive Types (BCP, DNT), pp. 299–312.

ICSE-1993-BhandariR #comparative #evaluation #feedback

Post-Process Feedback With and Without Attribute Focusing: A Comparative Evaluation (ISB, NR), pp. 89–98.

PPoPP-1993-ChapmanMZ #fortran #performance

High Performance Fortran Without Templates: An Alternative Model for Distribution and Alignment (BMC, PM, HPZ), pp. 92–101.

CAV-1993-WolperL #detection #reliability

Reliable Hashing without Collosion Detection (PW, DL), pp. 59–70.

ICLP-1993-Marien

Findall without findall/3 (AM), pp. 408–423.

PODS-1992-TurekSP #algorithm #concurrent #data type

Locking without Blocking: Making Lock Based Concurrent Data Structure Algorithms Nonblocking (JT, DS, SP), pp. 212–222.

SIGMOD-1992-Bamford #consistency #multi #performance #using

Using Multiversioning to Improve Performance Without Loss of Consistency (RB), p. 164.

SIGMOD-1992-MohanN #algorithm #scalability

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

ESOP-1992-Goldberg #garbage collection #incremental

Incremental Garbage Collection Without Tags (BG), pp. 200–218.

LFP-1992-Bondorf

Improving Binding Times Without Explicit CPS-Conversion (AB), pp. 1–10.

LFP-1992-GoldbergG #garbage collection #polymorphism #re-engineering

Polymorphic Type Reconstruction for Garbage Collection Without Tags (BG, MG), pp. 53–65.

OOPSLA-1992-MyersGZ #declarative #object-oriented #programming #prototype

Declarative Programming in a Prototype-Instance System: Object-Oriented Programming Without Writing Methods (BAM, DAG, BTVZ), pp. 184–200.

LICS-1992-GonthierAL #linear #logic

Linear Logic Without Boxes (GG, MA, JJL), pp. 223–234.

POPL-1991-SitaramF #continuation #modelling

Modeling Continuations without Continuations (DS, MF), pp. 185–196.

ASPLOS-1991-Mellor-CrummeyS

Synchronization without Contention (JMMC, MLS), pp. 269–278.

VLDB-1990-NaughtonR #how

How to Forget the Past Without Repeating It (JFN, RR), pp. 278–289.

LFP-1990-TolmachA #debugging #ml #reverse engineering #standard

Debugging Standard ML Without Reverse Engineering (APT, AWA), pp. 1–12.

CADE-1990-OzturkH #axiom #similarity

Hyper Resolution and Equality Axioms without Function Substitutions (YO, LJH), pp. 456–469.

CAV-1990-CoudertMB #diagrams #verification

Verifying Temporal Properties of Sequential Machines Without Building their State Diagrams (OC, JCM, CB), pp. 23–32.

CLP-1990-Brogi90

AND-Parallelism without Shared Variables (AB), pp. 306–321.

LICS-1990-Courcelle #graph #higher-order #monad #on the #set

On the Expression of Monadic Second-Order Graph Properties Without Quantifications Over Sets of Edges (Extended Abstract) (BC), pp. 190–196.

ICALP-1989-PapadimitriouY

Shortest Paths Without a Map (CHP, MY), pp. 610–620.

CHI-1989-JacksonR #named

Circling: a method of mouse-based selection without button presses (JCJ, RJRH), pp. 161–166.

TAV-1989-Howden #source code #specification #validation

Validating Programs without Specifications (WEH), pp. 2–9.

PODS-1988-LaninS #concurrent #set

Concurrent Set Manipulation without Locking (VL, DS), pp. 211–220.

SIGMOD-1988-KorthS #correctness #formal method

Formal Model of Correctness Without Serializability (HFK, GDS), pp. 379–386.

ICALP-1988-Weijland #logic programming #semantics #source code

Semantics for Logic Programs without Occur Check (WPW), pp. 710–726.

LFP-1988-Bawden #evaluation

Reification without Evaluation (AB), pp. 342–349.

OOPSLA-1988-LaLondeG #backtracking #kernel #smalltalk

Building a Backtracking Facility in Smalltalk Without Kernel Support (WRL, MVG), pp. 105–122.

POPL-1988-HudakY

A Collecting Interpretation of Expressions (Without Powerdomains) (PH, JY), pp. 107–118.

ICALP-1987-ChytilD

Panic Mode without Panic (MC, JD), pp. 260–268.

HCI-CE-1987-Pavard #constraints #design

Design of a Graphic Dialogue Without Syntactic Constraints (BP), pp. 465–472.

POPL-1987-Oles #concurrent #semantics

Semantics for Concurrency without Powerdomains (FJO), pp. 211–222.

SLP-1987-GorlickK87 #prolog #source code

Timing Prolog Programs without Clock (MMG, CK), pp. 426–434.

ICALP-1986-HartmanisH #complexity

Complexity Classes Without Machines: On Complete Languages for UP (JH, LAH), pp. 123–135.

OOPSLA-1986-SamplesUH #named #smalltalk

SOAR: Smalltalk Without Bytecodes (ADS, DU, PNH), pp. 107–118.

CADE-1986-Toyama #equivalence #how #induction #term rewriting

How to Prove Equivalence of Term Rewriting Systems without Induction (YT), pp. 118–127.

LICS-1986-JouannaudK #automation #equation #induction #proving

Automatic Proofs by Induction in Equational Theories Without Constructors (JPJ, EK), pp. 358–366.

LFP-1984-FriedmanW #named

Reification: Reflection without Metaphysics (DPF, MW), pp. 348–355.

SIGMOD-1982-MaierRSSW #independence #logic #query #relational #towards

Toward Logical Data Independence: A Relational Query Language Without Relations (DM, DR, SCS, JS, DSW), pp. 51–60.

SIGMOD-1981-Sagiv #question #using

Can We Use the Universal Instance Assumption Without Using Nulls? (YS), pp. 108–120.

POPL-1981-Pratt #decidability #logic

Program Logic Without Binding is Decidable (VRP), pp. 159–163.

LISP-1980-CampbellF #lisp

Symbolic Computing with and without Lisp (JC, JPF), pp. 1–5.

CADE-1980-Guguen #algebra #how #induction

How to Prove Algebraic Inductive Hypotheses Without Induction (JAG), pp. 356–373.

CADE-1980-Noll #how

A Note on Resolution: How to Get Rid of Factoring without Loosing Completeness (HN), pp. 250–263.

POPL-1976-LaLonde #lr #on the #parsing #reduction

On Directly Constructing LR(k) Parsers Without Chain Reductions (WRL), pp. 127–133.

STOC-1975-EhrenfeuchtR75a #combinator #interactive #on the

On the (Combinatorial) Structure of L Languages without Interactions (AE, GR), pp. 137–144.

DAC-1971-HarrisonO #analysis #logic #simulation

Race analysis of digital systems without logic simulation (RAH, DJO), pp. 82–94.

SOSP-1971-Easton #process

Process Synchronization without Long-Term Interlock (WBE), pp. 95–100.