Stem all$ (all stems)

275 papers:

DAC-2015-DingCZ #algorithm #invariant #performance

An efficient shift invariant rasterization algorithm for all-angle mask patterns in ILT (YD, CCNC, XZ), p. 6.

DATE-2015-AmirhosseinRBCM #power management

An all-digital spike-based ultra-low-power IR-UWB dynamic average threshold crossing scheme for muscle force wireless transmission (MSA, PMR, AB, MC, MM, DD, GM), pp. 1479–1484.

SIGMOD-2015-PantelaI

One Loop Does Not Fit All (SP, SI), pp. 2073–2074.

VLDB-2015-Balazinska15a #big data #data analysis #industrial #problem #question

Big Data Research: Will Industry Solve all the Problems? (MB), pp. 2053–2064.

VLDB-2015-ConsensFKP #bisimulation #query #summary

S+EPPs: Construct and Explore Bisimulation Summaries, plus Optimize Navigational Queries; all on Existing SPARQL Systems (MPC, VF, SK, GP), pp. 2028–2039.

ITiCSE-2015-Soyslo #algorithm #student

From Algorithmic to Computational Thinking: On the Way for Computing for all Students (MMS), p. 1.

LATA-2015-DaiW #algorithm #parallel #random #sequence

A Parallel Algorithm for Finding All Minimal Maximum Subsequences via Random Walk (HKD, ZW), pp. 133–144.

ICFP-2015-Sheeran #design #functional #hardware #programming #years after

Functional programming and hardware design: still interesting after all these years (MS), p. 165.

CHI-2015-FrenchSBH #ambiguity #how #lens

Is This How We (All) Do It?: Butler Lies and Ambiguity Through a Broader Lens (MF, MES, JPB, JTH), pp. 4079–4082.

CHI-2015-JohnsonNW #all about #case study #experience #game studies #video

All about that Base: Differing Player Experiences in Video Game Genres and the Unique Case of MOBA Games (DJ, LEN, PW), pp. 2265–2274.

CHI-2015-LiaoFM #all about

It Is All About Perspective: An Exploration of Mitigating Selective Exposure with Aspect Indicators (QVL, WTF, SSM), pp. 1439–1448.

CHI-2015-LucaHZH #authentication #comprehension #exclamation #smarttech #towards

I Feel Like I’m Taking Selfies All Day!: Towards Understanding Biometric Authentication on Smartphones (ADL, AH, EvZ, HH), pp. 1411–1414.

DHM-HM-2015-KitajimaKMMMH #analysis #comprehension #process

Process Analysis of Manufacturing of Sewing Scissors by All Forging Process and Understanding of Its Sharpness (YK, KK, MM, KM, YM, HH), pp. 124–132.

DUXU-DD-2015-CyprianoP #design #interactive #process #prototype #testing

Prototyping and Testing Throughout all the Design Process as a Methodology for Developing Interaction Design Projects (LC, MP), pp. 157–166.

ICEIS-v2-2015-SarinhoLS #dataset #linked data #open data #question

Can You Find All the Data You Expect in a Linked Dataset? (WTS, BFL, DS), pp. 648–655.

Onward-2015-AfroozehI #parsing

One parser to rule them all (AA, AI), pp. 151–170.

POPL-2015-HinzeWG #morphism #recursion

Conjugate Hylomorphisms — Or: The Mother of All Structured Recursion Schemes (RH, NW, JG), pp. 527–538.

SAC-2015-MottaMSMPC #3d #image #re-engineering

All-in-focus imaging technique used to improve 3D retinal fundus image reconstruction (DM, LdM, ACdS, RM, AP, LAVdC), pp. 26–31.

SAC-2015-TodaT #performance #satisfiability

BDD construction for all solutions SAT and efficient caching mechanism (TT, KT), pp. 1880–1886.

SPLC-2015-CordyDGGH #product line #specification

All-at-once-synthesis of controllers from scenario-based product line specifications (MC, JMD, JG, EG, PH), pp. 26–35.

CADE-2015-HouGT #automation #logic #proving #theorem proving

Automated Theorem Proving for Assertions in Separation Logic with All Connectives (ZH, RG, AT), pp. 501–516.

DocEng-2014-HailpernVD14a #ll #named

Truncation: all the news that fits we’ll print (JMH, NDV, MD), pp. 165–174.

PODS-2014-Cohen #analysis #graph #sketching

All-distances sketches, revisited: HIP estimators for massive graphs analysis (EC), pp. 88–99.

SIGMOD-2014-HoweFFFKR #database #education #question

Should we all be teaching “intro to data science” instead of “intro to databases”? (BH, MJF, JF, JF, TK, RR), pp. 917–918.

SIGMOD-2014-MuhlbauerRSRK0

One DBMS for all: the brawny few and the wimpy crowd (TM, WR, RS, AR, AK, TN), pp. 697–700.

VLDB-2014-GeertsMPS #exclamation #open source

That’s All Folks! LLUNATIC Goes Open Source (FG, GM, PP, DS), pp. 1565–1568.

CSEET-2014-FranklBK14a #collaboration #education #re-engineering #social

Win-for-all in software engineering education: Balancing social dilemmas to foster collaboration (GF, SB, BK), pp. 163–167.

ITiCSE-2014-EdwardsS #question #student #testing

Do student programmers all tend to write the same software tests? (SHE, ZS), pp. 171–176.

ITiCSE-2014-Katai14c #algorithm #perspective

Algorithmic thinking for ALL: a motivational perspective (ZK), p. 353.

ITiCSE-2014-RodgerBHMMOOW #weaving

Weaving computing into all middle school disciplines (SHR, DB, MH, DM, MM, EO, BO, EW), pp. 207–212.

ESOP-2014-CockxPD #independence #similarity

Overlapping and Order-Independent Patterns — Definitional Equality for All (JC, FP, DD), pp. 87–106.

STOC-2014-KumarS #all about #reduction

The limits of depth reduction for arithmetic formulas: it’s all about the top fan-in (MK, SS), pp. 136–145.

STOC-2014-Williams14a #complexity #performance

Faster all-pairs shortest paths via circuit complexity (RW), pp. 664–673.

AFL-2014-CevorovaJMPS #automaton

Operations on Automata with All States Final (KC, GJ, PM, MP, JS), pp. 201–215.

ICALP-v1-2014-DemaineDFPSWW #assembly #simulation

One Tile to Rule Them All: Simulating Any Tile Assembly System with a Single Universal Tile (EDD, MLD, SPF, MJP, RTS, AW, DW), pp. 368–379.

ICALP-v1-2014-GilbertLPS

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

ICALP-v2-2014-GogaczM #decidability #termination

All-Instances Termination of Chase is Undecidable (TG, JM), pp. 293–304.

CHI-2014-LinderSK

Everyday ideation: all of my ideas are on pinterest (RL, CS, AK), pp. 2411–2420.

CSCW-2014-MarlowD #design #development #network #social

From rookie to all-star: professional development in a graphic design social networking site (JM, LD), pp. 922–933.

CSCW-2014-WongG #years after

Support for deictic pointing in CVEs: still fragmented after all these years (NW, CG), pp. 1377–1387.

HCI-TMT-2014-TombergL #case study #design #education #modelling

Teaching Design for All Through Empathic Modeling: A Case Study in Tallinn University (VT, ML), pp. 259–269.

LCT-NLE-2014-SiimanCP

Digital Literacy for All Through Integrative STEM (LAS, CMPC, MP), pp. 119–127.

CIKM-2014-KangKL #automation #owl #performance

A Meta-reasoner to Rule Them All: Automated Selection of OWL Reasoners Based on Efficiency (YBK, SK, YFL), pp. 1935–1938.

KEOD-2014-FreibergHP #knowledge-based #novel #paradigm

Clarification KBS as Consultation-Justification Mash Ups — Proposing a Novel Paradigm for All-in-One Knowledge-based Systems (MF, FH, FP), pp. 168–175.

SAC-2014-LoulergueRTLH #parallel #problem

Formal derivation and extraction of a parallel program for the all nearest smaller values problem (FL, SR, JT, JL, ZH), pp. 1577–1584.

SAC-2014-WangW #network

Wavelength resources based lightpath-level active rerouting in all-optical WDM networks (SWW, CYW), pp. 495–500.

SLE-2014-Ridge #combinator #context-free grammar #parsing #performance #using

Simple, Efficient, Sound and Complete Combinator Parsing for All Context-Free Grammars, Using an Oracle (TR), pp. 261–281.

ASPLOS-2014-JungCSK #array #named #performance

Triple-A: a Non-SSD based autonomic all-flash array for high performance storage systems (MJ, WC, JS, MTK), pp. 441–454.

OSDI-2014-PillaiCAAAA #complexity #file system

All File Systems Are Not Created Equal: On the Complexity of Crafting Crash-Consistent Applications (TSP, VC, RA, SAK, ACAD, RHAD), pp. 433–448.

IJCAR-2014-BerdineB #refinement #smt

Computing All Implied Equalities via SMT-Based Partition Refinement (JB, NB), pp. 168–183.

RTA-TLCA-2014-StefanescuCMMSR #logic #reachability

All-Path Reachability Logic (AS, SC, RM, BMM, TFS, GR), pp. 425–440.

TAP-2014-BardinCDK #automation #testing #tool support

An All-in-One Toolkit for Automated White-Box Testing (SB, OC, MD, NK), pp. 53–60.

DATE-2013-VenkatesanSRR #energy #named #performance #using

DWM-TAPESTRI — an energy efficient all-spin cache using domain wall shift based writes (RV, MS, KR, AR), pp. 1825–1830.

VLDB-2013-BrunatoB #learning #optimisation

Learning and Intelligent Optimization (LION): One Ring to Rule Them All (MB, RB), pp. 1176–1177.

ICALP-v1-2013-GolovachHKV #algorithm #incremental #polynomial #set

An Incremental Polynomial Time Algorithm to Enumerate All Minimal Edge Dominating Sets (PAG, PH, DK, YV), pp. 485–496.

CHI-2013-KulkarniC #case study #social

All the news that’s fit to read: a study of social annotations for news reading (CK, EC), pp. 2407–2416.

CHI-2013-LugerMR #complexity

Consent for all: revealing the hidden complexity of terms and conditions (EL, SM, TR), pp. 2687–2696.

CHI-2013-RauARR #design #interactive #learning #why

Why interactive learning environments can have it all: resolving design conflicts between competing goals (MAR, VA, NR, SR), pp. 109–118.

DUXU-WM-2013-BucchianicoCP #analysis #communication #towards #visual notation

Branding “for All”: Toward the Definition of Inclusive Toolkits of Analysis and Visual Communication for Brand Identities (GDB, SC, SP), pp. 23–29.

HCI-UC-2013-KohPC #people #question

Do All People Enjoy the Benefits from Technology Innovation? (YJK, JHP, BDC), pp. 402–410.

CIKM-2013-GanuM #multi #web

One size does not fit all: multi-granularity search of web forums (GG, AM), pp. 9–18.

KDD-2013-TangZM #modelling #multi #topic

One theme in all views: modeling consensus topics in multiple contexts (JT, MZ, QM), pp. 5–13.

KDD-2013-WangMP #metric #scalability #similarity

Scalable all-pairs similarity search in metric spaces (YW, AM, SP), pp. 829–837.

Onward-2013-WurthingerWWSDHRSW #virtual machine

One VM to rule them all (TW, CW, AW, LS, GD, CH, GR, DS, MW), pp. 187–204.

ESEC-FSE-2013-BlincoeVD #coordination #dependence #identification

Do all task dependencies require coordination? the role of task properties in identifying critical coordination needs in software projects (KB, GV, DD), pp. 213–223.

CADE-2013-Filliatre #logic

One Logic to Use Them All (JCF), pp. 1–20.

VMCAI-2013-AbdullaHH

All for the Price of Few (PAA, FH, LH), pp. 476–495.

DATE-2012-KotiyalTR #design

Mach-Zehnder interferometer based design of all optical reversible binary adder (SK, HT, NR), pp. 721–726.

SIGMOD-2012-ZhuLZZY #named #similarity

TreeSpan: efficiently computing similarity all-matching (GZ, XL, KZ, WZ, JXY), pp. 529–540.

VLDB-2012-MetwallyF #framework #multi #named #pipes and filters #scalability #similarity

V-SMART-Join: A Scalable MapReduce Framework for All-Pair Similarity Joins of Multisets and Vectors (AM, CF), pp. 704–715.

ITiCSE-2012-DennyLT #fault #syntax

All syntax errors are not equal (PD, ALR, EDT), pp. 75–80.

ITiCSE-2012-Gibson #algorithm #education #graph

Teaching graph algorithms to children of all ages (JPG), pp. 34–39.

PLDI-2012-GazzilloG #c #named #parsing #preprocessor

SuperC: parsing all of C by taming the preprocessor (PG, RG), pp. 323–334.

CSCW-2012-EhrlichC #analysis #communication #development #distributed #multi #performance

All-for-one and one-for-all?: a multi-level analysis of communication patterns and individual performance in geographically distributed software development (KE, MC), pp. 945–954.

CIKM-2012-HaiCC #mining

One seed to find them all: mining opinion features via association (ZH, KC, GC), pp. 255–264.

OSDI-2012-Kapritsos0QCAD #all about #manycore #replication

All about Eve: Execute-Verify Replication for Multi-Core Servers (MK, YW, VQ, AC, LA, MD), pp. 237–250.

CAV-2012-SinhaSCS

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

CASE-2011-WangZW #petri net

Extracting all minimal siphons from maximal unmarked siphons in manufacturing-oriented Petri nets (SW, MZ, CW), pp. 399–404.

DAC-2011-OnaissiTLN #analysis #approach #performance

A fast approach for static timing analysis covering all PVT corners (SO, FT, JL, FNN), pp. 777–782.

DATE-2011-WangCC #self

An all-digital built-in self-test technique for transfer function characterization of RF PLLs (PYW, HMC, KTC), pp. 359–364.

HT-2011-Gayo-Avello

All liaisons are dangerous when all your friends are known to us (DGA), pp. 171–180.

HT-2011-Rowberry #hypermedia #question

Vladimir Nabokov’s pale fire: the lost “father of all hypertext demos”? (SR), pp. 319–324.

ITiCSE-2011-PauHGW #case study #exclamation #experience #programming #student

Female students’ experiences of programming: it’s not all bad! (RP, WH, MG, JW), pp. 323–327.

FoSSaCS-2011-BokerK #automaton

Co-Büching Them All (UB, OK), pp. 184–198.

STOC-2011-GentryW

Separating succinct non-interactive arguments from all falsifiable assumptions (CG, DW), pp. 99–108.

CIAA-2011-JezM #automaton #performance

Computing All ℓ-Cover Automata Fast (AJ, AM), pp. 203–214.

IDGD-2011-HaiS #design #education #social

Design for All: Social Innovation and Service Design Education and Practice in China (JH, KWMS), pp. 514–523.

ICEIS-v4-2011-DavisC11a #data transformation #logic #metadata #modelling

Variant Logic Meta-data Management for Model Driven Applications — Allows Unlimited End User Configuration and Customisation of All Meta-data EIS Application Features (JD, EC), pp. 395–400.

CIKM-2011-PobleteGMJ #twitter

Do all birds tweet the same?: characterizing twitter around the world (BP, ROGG, MM, AJ), pp. 1025–1030.

CIKM-2011-WuQD #owl #pipes and filters #using

Finding all justifications of OWL entailments using TMS and MapReduce (GW, GQ, JD), pp. 1425–1434.

MLDM-2011-JoutsijokiJ #classification #image

Comparing the One-vs-One and One-vs-All Methods in Benthic Macroinvertebrate Image Classification (HJ, MJ), pp. 399–413.

POPL-2011-AhmedFSW

Blame for all (AA, RBF, JGS, PW), pp. 201–214.

PPoPP-2011-XiangBBDC #composition #modelling #profiling

All-window profiling and composable models of cache sharing (XX, BB, TB, CD, TMC), pp. 91–102.

ICST-2011-SmithW #detection #heuristic #sql #using #web

Using SQL Hotspots in a Prioritization Heuristic for Detecting All Types of Web Application Vulnerabilities (BHS, LW), pp. 220–229.

SAT-2011-CreignouOS #csp

Enumerating All Solutions of a Boolean CSP by Non-decreasing Weight (NC, FO, JS), pp. 120–133.

ECSA-2010-Kruchten #architecture #question

Where Did All This Good Architectural Knowledge Go? (PK), pp. 5–6.

DATE-2010-Sangiovanni-Vincentelli

All things are connected (ALSV), p. 1.

SIGMOD-2010-ZhangHOS #distance #edit distance #named #similarity #string

Bed-tree: an all-purpose index structure for string similarity search based on edit distance (ZZ, MH, BCO, DS), pp. 915–926.

CSMR-2010-NadiHM #predict #set #using

Does the Past Say It All? Using History to Predict Change Sets in a CMDB (SN, RCH, SM), pp. 97–106.

ICSM-2010-OlbrichCS #case study #evolution #open source #smell

Are all code smells harmful? A study of God Classes and Brain Classes in the evolution of three open source systems (SMO, DC, DIKS), pp. 1–10.

LATA-2010-NagyO

CD-Systems of Stateless Deterministic R(1)-Automata Accept All Rational Trace Languages (BN, FO), pp. 463–474.

CHI-2010-HeGH #design #energy #feedback

One size does not fit all: applying the transtheoretical model to energy feedback technology design (HAH, SG, EMH), pp. 927–936.

CIKM-2010-ZaragozaCB #question #ranking #web

Web search solved?: all result rankings the same? (HZ, BBC, RABY), pp. 529–538.

ICPR-2010-Liu10a #classification #prototype #retrieval

One-Vs-All Training of Prototype Classifier for Pattern Classification and Retrieval (CLL), pp. 3328–3331.

RE-2010-MahauxHM #requirements

Making It all Up: Getting in on the Act to Improvise Creative Requirements (MM, PH, NAMM), pp. 375–376.

SAC-2010-BaudetD #algorithm #permutation

An improved algorithm to enumerate all traces that sort a signed permutation by reversals (CB, ZD), pp. 1521–1525.

ASPLOS-2010-KirmanM #power management #using

A power-efficient all-optical on-chip interconnect using wavelength-based oblivious routing (NK, JFM), pp. 15–28.

HPCA-2010-RomanescuLSB #protocol

UNified Instruction/Translation/Data (UNITD) coherence: One protocol to rule them all (BFR, ARL, DJS, AB), pp. 1–12.

DAC-2009-LevitanC #parallel

Massively parallel processing: it’s déjà vu all over again (SPL, DMC), pp. 534–538.

DAC-2009-OnaissiHN #optimisation #process

Clock skew optimization via wiresizing for timing sign-off covering all process corners (SO, KRH, FNN), pp. 196–201.

PODS-2009-AtallahQ #nondeterminism

Computing all skyline probabilities for uncertain data (MJA, YQ), pp. 279–287.

ITiCSE-2009-HuangB #approach #question

A unified approach to introductory computer science: can one size fit all? (TH, AB), pp. 253–257.

ESOP-2009-DemangeS

All Secrets Great and Small (DD, DS), pp. 207–221.

TACAS-2009-ManoliosT

All-Termination(T) (PM, AT), pp. 398–412.

CHI-2009-VoidaG #game studies

Wii all play: the console game as a computational meeting place (AV, SG), pp. 1559–1568.

HCI-VAD-2009-Ficarra #interactive

Virtual Classroom and Communicability: Empathy and Interaction for All (FVCF), pp. 58–67.

ICEIS-J-2009-NerisB #approach #interface

Interfaces for All: A Tailoring-Based Approach (VPdAN, MCCB), pp. 928–939.

OOPSLA-2009-LeeHGM #debugging

Debug all your code: portable mixed-environment debugging (BL, MH, RG, KSM), pp. 207–226.

TOOLS-EUROPE-2009-KastnerATKB #approach #correctness #independence #product line

Guaranteeing Syntactic Correctness for All Product Line Variants: A Language-Independent Approach (CK, SA, ST, MK, DSB), pp. 175–194.

PADL-2009-CostaR

One Table Fits All (JC, RR), pp. 195–208.

HPCA-2009-HiltonNR #named

iCFP: Tolerating all-level cache misses in in-order processors (ADH, SN, AR), pp. 431–442.

HPDC-2009-YiMEJT #abstraction #clustering #manycore #parallel

Harnessing parallelism in multicore clusters with the all-pairs and wavefront abstractions (LY, CM, SJE, KJ, DT), pp. 1–10.

CSL-2009-HorbachW #induction #query

Deciding the Inductive Validity of FOR ALL THERE EXISTS * Queries (MH, CW), pp. 332–347.

HT-2008-StefanoneLR #web

We’re all stars now: reality television, web 2.0, and mediated identities (MS, DL, DR), pp. 107–112.

VLDB-2008-SidirourgosGKNM #data transformation #rdf

Column-store support for RDF data management: not all swans are white (LS, RG, MLK, NN, SM), pp. 1553–1563.

FoSSaCS-2008-Parys #commutative #equation #finite

Systems of Equations Satisfied in All Commutative Finite Semigroups (PP), pp. 261–272.

SAS-2008-SeidlFP #equation #polynomial

Analysing All Polynomial Equations in ℤ₂ᵂ (HS, AF, MP), pp. 299–314.

STOC-2008-KawarabayashiM #graph #linear #morphism

Graph and map isomorphism and all polyhedral embeddings in linear time (KiK, BM), pp. 471–480.

ICALP-A-2008-RodittyS #fault #sublinear

All-Pairs Shortest Paths with a Sublinear Additive Error (LR, AS), pp. 622–633.

ICALP-C-2008-HochS #on the

On the Strength of the Concatenated Hash Combiner When All the Hash Functions Are Weak (JJH, AS), pp. 616–630.

CSCW-2008-DuganGMDBM #all about #online

It’s all “about you”: diversity in online profiles (CD, WG, MJM, JMD, BB, DRM), pp. 703–706.

CIKM-2008-BischoffFNP #question

Can all tags be used for search? (KB, CSF, WN, RP), pp. 193–202.

ICML-2008-BarrettN #learning #multi #policy

Learning all optimal policies with multiple criteria (LB, SN), pp. 41–47.

ICML-2008-LongS #classification #random

Random classification noise defeats all convex potential boosters (PML, RAS), pp. 608–615.

PPoPP-2008-DingC #concurrent #profiling

All-window profiling of concurrent executions (CD, TMC), pp. 265–266.

PPoPP-2008-Mellor-Crummey #question #thread

Where will all the threads come from? (JMMC), pp. 259–260.

ICST-2008-MouyMWG #generative #testing

Generation of All-Paths Unit Test with Function Calls (PM, BM, NW, PLG), pp. 32–41.

TestCom-FATES-2008-Yasuda #development #network

All-IP Based Ultra 3G Network/Service Development in a Competitive Market (YY), pp. 1–4.

VMCAI-2008-PnueliS

All You Need Is Compassion (AP, YS), pp. 233–247.

CASE-2007-CheongS #independence

Computing All Independent Form-Closure Grasp Regions of a Rectilinear Polyhedron (JSC, AFvdS), pp. 288–294.

DATE-2007-YeGM #interactive

Interactive presentation: An FPGA based all-digital transmitter with radio frequency output for software defined radio (ZY, JG, GM), pp. 21–26.

SIGMOD-2007-LiuMQYRWLHZ #development #evaluation #named #scalability

AllInOneNews: development and evaluation of a large-scale news metasearch engine (KLL, WM, JQ, CTY, VVR, ZW, YL, HH, HZ), pp. 1017–1028.

ITiCSE-2007-Kuyl #question

Where have all the computer scientists gone? (CvdK), p. 2.

STOC-2007-Chan #algorithm #graph

More algorithms for all-pairs shortest paths in weighted graphs (TMC), pp. 590–598.

STOC-2007-GilbertSTV #algorithm #performance #sketching

One sketch for all: fast algorithms for compressed sensing (ACG, MJS, JAT, RV), pp. 237–246.

STOC-2007-VassilevskaWY #graph

All-pairs bottleneck paths for general graphs in truly sub-cubic time (VV, RW, RY), pp. 585–589.

ICFP-2007-CouttsLS

Stream fusion: from lists to streams to nothing at all (DC, RL, DS), pp. 315–326.

ILC-2007-Sperber #all about #lessons learnt #process

It’s all about being right: lessons from the R6RS process (MS), p. 7.

REFSQ-2007-LaukaitisV #development #information management #natural language

Integrating All Stages of Information Systems Development by Means of Natural Language Processing (AL, OV), pp. 218–231.

ITiCSE-2006-Gal-EzerT #algebra #how #question #regular expression

Algebraic characterization of regular languages: how to cope with all these equivalences? (JGE, MBT), p. 325.

ESOP-2006-FluetMA #linear

Linear Regions Are All You Need (MF, GM, AJA), pp. 7–21.

STOC-2006-Shapira #all about #combinator #graph

A combinatorial characterization of the testable graph properties: it’s all about regularity (NA, EF, IN, AS), pp. 251–260.

CSCW-2006-WilsonGF #collaboration #scalability

Not all sharing is equal: the impact of a large display on small group collaborative work (SMW, JG, JF), pp. 25–28.

ICPR-v4-2006-LiaoS #classification

Classification of Audio Signals in All-Night Sleep Studies (WHL, YSS), pp. 302–305.

RE-2006-Dick #requirements

A Requirements Guide For All (REGAL): An INCOSE Initiative (JD), p. 264.

ISSTA-2006-BellOW #debugging

Looking for bugs in all the right places (RMB, TJO, EJW), pp. 61–72.

TACAS-2005-JinHS #analysis #performance

Efficient Conflict Analysis for Finding All Satisfying Assignments of a Boolean Circuit (HJ, HH, FS), pp. 287–300.

STOC-2005-BojanczykC #automaton #regular expression

Tree-walking automata do not recognize all regular languages (MB, TC), pp. 234–243.

STOC-2005-Thorup #worst-case

Worst-case update times for fully-dynamic all-pairs shortest paths (MT), pp. 112–119.

ICALP-2005-SpalekS #quantum

All Quantum Adversary Methods Are Equivalent (RS, MS), pp. 1299–1311.

CIKM-2005-Ahonen-Myka #mining #sequence #set #word

Mining all maximal frequent word sequences in a set of sentences (HAM), pp. 255–256.

MoDELS-2005-CraneD #modelling #uml

UML Vs. Classical Vs. Rhapsody Statecharts: Not All Models Are Created Equal (MLC, JD), pp. 97–112.

MoDELS-2005-Tolvanen #modelling

Keynote Address II: Domain-Specific Modeling: No One Size Fits All (JPT), p. 279.

MoDELS-2005-CraneD #modelling #uml

UML Vs. Classical Vs. Rhapsody Statecharts: Not All Models Are Created Equal (MLC, JD), pp. 97–112.

MoDELS-2005-Tolvanen #modelling

Keynote Address II: Domain-Specific Modeling: No One Size Fits All (JPT), p. 279.

RE-2005-FanmuyPRDBWB #question #requirements

Are Requirements Engineering best practices the same for all industries? (GF, FP, JR, JD, SB, MW, PB), p. 448.

RE-2005-Jean-BaptisteSF #requirements

Sharing Methodological Knowledge with REGAL: “Requirements Engineering Guide for All” (LHJB, CS, GF), pp. 461–462.

SAT-2005-LiffitonS #on the #satisfiability

On Finding All Minimally Unsatisfiable Subformulas (MHL, KAS), pp. 173–186.

DAC-2004-RawatJJDGPMHS

Were the good old days all that good?: EDA then and now (SR, WHJJ, JAD, DG, POP, HDM, CH, JS), p. 543.

DATE-v1-2004-LiHS #novel #performance #satisfiability

A Novel SAT All-Solutions Solver for Efficient Preimage Computation (BL, MSH, SS), pp. 272–279.

STOC-2004-ChekuriKS #multi #problem

The all-or-nothing multicommodity flow problem (CC, SK, FBS), pp. 156–165.

ICALP-2004-ArgeMT #algorithm #graph #memory management

External Memory Algorithms for Diameter and All-Pairs Shortest-Paths on Sparse Graphs (LA, UM, LT), pp. 146–157.

ICALP-2004-KalyanasundaramV

Fairness to All While Downsizing (BK, MV), pp. 819–830.

ICPR-v4-2004-IwaseS #detection #image #parallel

Parallel Tracking of All Soccer Players by Integrating Detected Positions in Multiple View Images (SI, HS), pp. 751–754.

ICSE-2004-BlackMK #modelling #reduction #testing

Bi-Criteria Models for All-Uses Test Suite Reduction (JB, EM, DRK), pp. 106–115.

TestCom-2004-LiWY #multi #testing

Testing Multi Input/Output Transition System with All-Observer (ZL, JW, XY), pp. 95–111.

DAC-2003-SaifhashemiP #abstraction #framework #modelling

Verilog HDL, powered by PLI: a suitable framework for describing and modeling asynchronous circuits at all levels of abstraction (AS, HP), pp. 330–333.

PLDI-2003-DorRS #c #detection #named #towards

CSSV: towards a realistic tool for statically detecting all buffer overflows in C (ND, MR, SS), pp. 155–167.

STOC-2003-BansalP #scheduling

Server scheduling in the Lp norm: a rising tide lifts all boat (NB, KP), pp. 242–250.

STOC-2003-DemetrescuI #approach

A new approach to dynamic all pairs shortest paths (CD, GFI), pp. 159–166.

PPDP-2003-BandaSW #satisfiability #set

Finding all minimal unsatisfiable subsets (MJGdlB, PJS, JW), pp. 32–43.

SAC-2003-Ortega-BinderbergeCM #evaluation #feedback #multi #performance #retrieval

Efficient Evaluation of Relevance Feedback for Multidimensional All-pairs Retrieval (MOB, KC, SM), pp. 847–852.

CSL-2003-EiterM #abduction #generative #query

Generating All Abductive Explanations for Queries on Propositional Horn Theories (TE, KM), pp. 197–211.

SAT-2003-PorschenRS #algorithm #linear #problem #satisfiability

Linear Time Algorithms for Some Not-All-Equal Satisfiability Problems (SP, BR, ES), pp. 172–187.

DATE-2002-Essi #all about #implementation

IP is All About Implementation and Customer Satisfaction (VPEJ), p. 132.

DATE-2002-LeeCDGM #algorithm #detection #fault #multi #testing

A New ATPG Algorithm to Limit Test Set Size and Achieve Multiple Detections of All Faults (SL, BC, JD, MRG, MRM), pp. 94–99.

ITiCSE-2002-SchepM #case study #experience #programming #using

Experiences with using robots in an all-female programming class (MS, NM), p. 241.

ESOP-2002-HuIT #cumulative #parallel

An Accumulative Parallel Skeleton for All (ZH, HI, MT), pp. 83–97.

STOC-2002-AchlioptasM #graph

Almost all graphs with average degree 4 are 3-colorable (DA, CM), pp. 199–208.

STOC-2002-BaswanaHS #algorithm #maintenance #transitive

Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths (SB, RH, SS), pp. 117–123.

STOC-2002-Umans #generative #pseudo

Pseudo-random generators for all hardnesses (CU), pp. 627–634.

ICALP-2002-DemetrescuI #bound #trade-off

Improved Bounds and New Trade-Offs for Dynamic All Pairs Shortest Paths (CD, GFI), pp. 633–643.

ICALP-2002-Pettie #algorithm #graph #performance

A Faster All-Pairs Shortest Path Algorithm for Real-Weighted Sparse Graphs (SP), pp. 85–97.

RE-2002-DarimontDRR #requirements

Requirements Engineering with Grail/Kaos: Tell the Requirements, All the Requirements, and Nothing Else but the Requirement (RD, ED, JLR, AR), p. 299.

DATE-2001-LockCM #framework #programmable #question

The programmable platform: does one size fit all? (AL, RC, HM), pp. 226–227.

CSEET-2001-GrothR #all about #education #process #re-engineering

It’s All about Process: Project Oriented Teaching of Software Engineering (DPG, ELR), pp. 7–17.

ITiCSE-2001-Kaczmarczyk #assessment #distance #education #student #why

Accreditation and student assessment in distance education: why we all need to pay attention (LCK), pp. 113–116.

ICALP-2001-BorosEGKM #generative #integer #linear #on the

On Generating All Minimal Integer Solutions for a Monotone System of Linear Inequalities (EB, KME, VG, LK, KM), pp. 92–103.

ICALP-2001-MargaraS #decidability #graph #network

Decidable Properties of Graphs of All-Optical Networks (LM, JS), pp. 518–529.

ICALP-2001-Tiskin

All-Pairs Shortest Paths Computation in the BSP Model (AT), pp. 178–189.

DATE-2000-SuCHCL #metric

All Digital Built-in Delay and Crosstalk Measurement for On-Chip Buses (CS, YTC, MJH, GNC, CLL), pp. 527–531.

ICALP-2000-MargaraS #network #problem

Wavelength Assignment Problem on All-Optical Networks with k Fibres per Link (LM, JS), pp. 768–779.

ICALP-2000-SantisCP #proving

Necessary and Sufficient Assumptions for Non-iterative Zero-Knowledge Proofs of Knowledge for All NP Relations (ADS, GDC, GP), pp. 451–462.

WLC-2000-AlmeidaE #finite #pseudo

Semidirect Products With the Pseudovariety of All Finite Groups (JA, APE), pp. 1–21.

CAiSE-2000-EbnerK

Tracing All Around (GE, HK), pp. 355–368.

ICPR-v1-2000-NicolescuM #named #video

GlobeAll: Panoramic Video for an Intelligent Room (MN, GGM), pp. 1823–1826.

ITiCSE-1999-DeeR #approach #education #learning

ACOM (“computing for all”): an integrated approach to the teaching and learning of information technology (HD, PR), p. 195.

STOC-1999-RazRV #fault

Extracting all the Randomness and Reducing the Error in Trevisan’s Extractors (RR, OR, SPV), pp. 149–158.

STOC-1999-Zwick

All Pairs Lightest Shortest Paths (UZ), pp. 61–69.

FM-v1-1999-Wang #automation #pointer #process #verification

Automatic Verification of Pointer Data-Structure Systems for All Numbers of Processes (FW), pp. 328–347.

HCI-CCAD-1999-Andre #multi #personalisation #towards

Towards personalized multimedia presentation systems for all (EA), pp. 873–877.

HCI-CCAD-1999-ArnoldV #approach

Broad spectrum approach and information society for all (AGA, LJV), pp. 757–761.

HCI-CCAD-1999-Burmester #design #people #requirements #user interface

Consumer electronics user interfaces for all. Design on the basis of the special requirements of elderly people (MB), pp. 942–946.

HCI-CCAD-1999-Carbonell #multi #named

Multimodality: a primary requisite for achieving an information society for all (NC), pp. 898–902.

HCI-CCAD-1999-Fanshawe

Making it easy for all (DGJF), pp. 947–951.

HCI-CCAD-1999-StephanidisSEA #design #policy

Policy perspectives on “design for all” (CS, GS, PLE, DA), pp. 868–872.

HCI-CCAD-1999-Vanderdonckt #web

Commercial web sites made accessible for all (JV), pp. 838–842.

HCI-CCAD-1999-Weber #challenge #design #human-computer #sketching

Design for all — a sketch of challenges for HCI designers (HW), pp. 777–781.

PADL-1999-CadoliPSV #execution #named #problem #specification

NP-SPEC: An Executable Specification Language for Solving All Problems in NP (MC, LP, AS, DV), pp. 16–30.

HPCA-1999-YangW #network #performance

Efficient All-to-All Broadcast in All-Port Mesh and Torus Networks (YY, JW), pp. 290–299.

ITiCSE-1998-SelbyY #education #programming #student

The teaching of programming (poster): changing the delivery to meet all students’ needs (LS, AY), p. 305.

ICALP-1998-Gargano #network

Limited Wavelength Conversion in All-Optical Tree Networks (LG), pp. 544–555.

CSCW-1998-Grinter #named

Recomposition: Putting It All Back Together Again (REG), pp. 393–402.

ICPR-1998-CaiL #algorithm

A new thresholding algorithm based on all-pole model (JC, ZQL), pp. 34–36.

ICPR-1998-ChaudhuriG #automation #detection #documentation #image #word

Automatic detection of italic, bold and all-capital words in document images (BBC, UG), pp. 610–612.

TOOLS-ASIA-1998-BlasbandR #quantifier

All-Purpose Quantifiers (DB, JCR), pp. 8–17.

FSE-1998-NaumovichA #algorithm #data flow #detection #parallel

A Conservative Data Flow Algorithm for Detecting All Pairs of Statement That May Happen in Parallel (GN, GSA), pp. 24–34.

ISSTA-1998-YangSP #parallel #source code

All-du-path Coverage for Parallel Programs (CSDY, ALS, LLP), pp. 153–162.

JICSLP-1998-FonsecaCD #execution #logic programming #named #parallel #source code #visualisation

VisAll: A Universal Tool to Visualise Parallel Execution of Logic Programs (NAF, VSC, IdCD), pp. 100–114.

ITiCSE-1997-BerghelNSTT #design #education

You learned all you need to design educational software design in kindergarten (panel) (HB, CAN, ES, HGT, JT), p. 139.

STOC-1997-LoH #robust

All of Us are Smarter Than Any of Us: Wait-Free Hierarchies are not Robust (WKL, VH), pp. 579–588.

ICALP-1997-BartalL #network #online

On-Line Routing in All-Optical Networks (YB, SL), pp. 516–526.

HCI-CC-1997-JoynerSS #evaluation

The Context of Co-operative Working-Generic Issues, and all Evaluation of Some Software for Co-operative Working in a Manufacturing Engineering Engineering Environment (SMJ, CES, MAS), pp. 297–300.

HCI-CC-1997-Stary #design #evaluation #user interface

The Role of Design and Evaluation Principles for User Interfaces for All (CS), pp. 477–480.

HCI-CC-1997-Stephanidis #generative #towards

Towards the Next Generation of UIST: Developing for all Users (CS), pp. 473–476.

HCI-SEC-1997-ItogaKL #approach #database #nondeterminism #object-oriented #retrieval

All Object-Oriented Uncertainty Retrieval Approach for Graphics Databases (SYI, XK, YL), pp. 683–686.

HPCA-1997-YuanMG #algorithm #distributed #multi #network

Distributed Path Reservation Algorithms for Multiplexed All-Optical Interconnection Networks (XY, RGM, RG), pp. 38–47.

PPoPP-1997-LimCCE #communication #performance

Performance Implications of Communication Mechanisms in All-Software Global Address Space Systems (BHL, CCC, GC, TvE), pp. 230–239.

SOSP-1997-AndersonBDGHLSVWW #profiling #question

Continuous Profiling: Where Have All the Cycles Gone? (JAMA, LMB, JD, SG, MRH, STL, RLS, MTV, CAW, WEW), pp. 1–14.

ISSTA-1996-MarreB

Unconstrained Duals and Their Use in Achieving All-Uses Coverage (MM, AB), pp. 147–157.

SIGMOD-1995-French #architecture #database

“One Size Fits All” Database Architectures Do Not Work for DDS (CDF), pp. 449–450.

STOC-1995-Karger #approximate #network #polynomial #problem #random #reliability

A randomized fully polynomial time approximation scheme for the all terminal network reliability problem (DRK), pp. 11–17.

SOSP-1995-JohnsonKW #distributed #memory management #named

CRL: High-Performance All-Software Distributed Shared Memory (KLJ, MFK, DAW), pp. 213–228.

LICS-1995-KupfermanP

Once and For All (OK, AP), pp. 25–35.

PLDI-1994-AustinBS #array #detection #fault #performance #pointer

Efficient Detection of All Pointer and Array Access Errors (TMA, SEB, GSS), pp. 290–301.

STOC-1994-RaghavanU #network #performance

Efficient routing in all-optical networks (PR, EU), pp. 134–143.

ISSTA-1994-Forgacs #fault

The All Program Functions Criterion for Revealing Computation Errors (Abstract) (IF), p. 198.

WSA-1993-BruynoogheC #correctness

Freeness, Sharing, Linearity and Correctness — All at Once (MB, MC), pp. 153–164.

FPCA-1993-SheardF

A Fold for All Seasons (TS, LF), pp. 233–242.

HPDC-1993-Pramanick #distributed #problem

Distributed Computing Solutions to the All-Pairs Shortest Path Problem (IP), pp. 196–203.

CAV-1993-Peled #model checking #using

All from One, One for All: on Model Checking Using Representatives (DP), pp. 409–423.

STOC-1992-Seidel #on the #problem

On the All-Pairs-Shortest-Path Problem (RS), pp. 745–749.

KR-1992-Lakemeyer

All You Ever Wanted to Know about Tweety (But Were Afraid to Ask) (GL), pp. 639–648.

WSA-1991-Chin #deforestation #first-order #functional #source code

Generalising Deforestation for All First-Order Functional Programs (WNC), pp. 173–181.

TAV-1991-FranklW #comparison #effectiveness

An Experimental Comparison of the Effectiveness of the All-Uses and All-Edges Adequacy Criteria (PGF, SNW), pp. 154–164.

STOC-1990-GilHW #constant

Not All Keys Can Be Hashed in Constant Time (Preliminary Version) (JYG, FMadH, AW), pp. 244–253.

CC-1990-Sassa #compilation #generative #towards

Rie and Jun: Towards the Generation of all Compiler Phases (MS), pp. 56–70.

CAV-1990-MadelaineV #algebra #automaton #process

Finiteness Conditions and Structural Construction of Automata for All Process Algebras (EM, DV), pp. 353–363.

STOC-1989-GoldreichL

A Hard-Core Predicate for all One-Way Functions (OG, LAL), pp. 25–32.

OOPSLA-1989-FentonB #named #object-oriented #simulation

Playground: An Object-Oriented Simulation System With Agent Rules for Children of All Ages (JF, KB), pp. 123–137.

ESEC-1989-AdamsWT #ada

Software Change Dynamics or Half of all Ada Compilations are Redundant (RA, AW, WFT), pp. 203–221.

TAV-1989-BiemanS #testing

Estimating the Number of Test Cases Required to Satisfy the All-du-paths Testing Criterion (JMB, JLS), pp. 179–186.

STOC-1987-Frederickson #approach #graph

A New Approach to All Pairs Shortest Paths in Planar Graphs (Extended Abstract) (GNF), pp. 19–28.

STOC-1986-Ben-OrFKT #algorithm #parallel #performance #polynomial

A Fast Parallel Algorithm for Determining All Roots of a Polynomial with Real Roots (MBO, EF, DK, PT), pp. 340–349.

STOC-1986-GoldwasserK

Almost All Primes Can Be Quickly Certified (SG, JK), pp. 316–329.

ICALP-1986-AverbuchWG #algorithm #classification #polynomial

Classification of all the Minimal Bilinear Algorithms for Computing the Coefficients of the Product of Two Polynomials Modulo a Polynomial (AA, SW, ZG), pp. 31–39.

ICSE-1985-Madhavji #programming

Operations for Programming in the All (NHM), pp. 15–25.

SLP-1985-Naish85 #prolog

All Solutions Predicates in Prolog (LN), pp. 73–77.

ICALP-1984-BlumerBEHM #automaton #linear #online #set #word

Building the Minimal DFA for the Set of all Subwords of a Word On-line in Linear Time (AB, JB, AE, DH, RMM), pp. 109–118.

ICALP-1983-Dehne #algorithm #diagrams #nearest neighbour #on the

On O(N^4) Algorithm to Construct all Voronoi Diagrams for k Nearest Neighbor Searching (FKHAD), pp. 160–172.

STOC-1982-GoldwasserM #encryption #game studies #how #probability

Probabilistic Encryption and How to Play Mental Poker Keeping Secret All Partial Information (SG, SM), pp. 365–377.

DAC-1980-Armstrong #what

A CAD user’s perspective what gets done right wrong and not at all (Position Paper) (RAA), p. 517.

SCC-1979-MiltonKR #compilation #generative

An all(1) compiler generator (DRM, LWK, BRR), pp. 152–157.

ICALP-1979-Deussen #algorithm #parsing

One Abstract Accepting Algorithm for all Kinds of Parsers (PD), pp. 203–217.

ICALP-1974-Mehlhorn #decidability #recursion

The “Almost All” Theory of Subrecursive Degrees is Decidable (KM), pp. 317–325.