Stem easi$ (all stems)

116 papers:

CHI-2015-ZezschwitzLJH

Easy to Draw, but Hard to Trace?: On the Observability of Grid-based (Un)lock Patterns (EvZ, ADL, PJ, HH), pp. 2339–2342.

DUXU-DD-2015-Robier #experience

Innovation, Exceptional Experience and Sustainable Success Made Easy: The NI© Needs Innovation Model (JR), pp. 348–355.

DUXU-UI-2015-BendoukhaMB #workflow

Building Cloud-Based Scientific Workflows Made Easy: A Remote Sensing Application (SB, DM, HB), pp. 277–288.

SPLC-2015-LiangGCR #analysis #feature model #modelling #satisfiability #scalability

SAT-based analysis of large real-world feature models is easy (JH(L, VG, KC, VR), pp. 91–100.

ASE-2014-Voronkov

Keynote talk: EasyChair (AV), pp. 3–4.

PEPM-2014-AdamsFM #exclamation #optimisation #scrap your boilerplate

Optimizing SYB is easy! (MDA, AF, JPM), pp. 71–82.

CHI-2014-BurszteinMFBMJ

Easy does it: more usable CAPTCHAs (EB, AM, CF, SB, JCM, DJ), pp. 2637–2646.

CHI-2014-YangW #named #specification #web

Panelrama: enabling easy specification of cross-device web applications (JY, DW), pp. 2783–2792.

RecSys-2014-LoniS #library #named #recommendation

WrapRec: an easy extension of recommender system libraries (BL, AS), pp. 377–378.

ICLP-J-2014-LagerW #logic programming #named #web

Pengines: Web Logic Programming Made Easy (TL, JW), pp. 539–552.

CASE-2013-RossanoMHMF #concept #industrial #perspective #programming

Easy robot programming concepts: An industrial perspective (GFR, CM, MH, SM, TAF), pp. 1119–1126.

VLDB-2013-SarwatAM #database #recommendation #relational

A RecDB in Action: Recommendation Made Easy in Relational Databases (MS, JLA, MFM), pp. 1242–1245.

VLDB-2013-ZhongH #graph #parallel

Parallel Graph Processing on Graphics Processors Made Easy (JZ, BH), pp. 1270–1273.

ICFP-2013-DunfieldK #bidirectional #morphism #polymorphism #rank

Complete and easy bidirectional typechecking for higher-rank polymorphism (JD, NRK), pp. 429–442.

CHI-2013-XiaoHH13a #ad hoc #agile #interactive #named

WorldKit: rapid and easy creation of ad-hoc interactive applications on everyday surfaces (RX, CH, SEH), pp. 879–888.

HCI-UC-2013-FurukawaN #navigation

A Pedestrian Navigation Method for User’s Safe and Easy Wayfinding (HF, YN), pp. 156–165.

ICEIS-v3-2013-Traverson #architecture #enterprise #exclamation #integration

EASI! Enterprise Architecture for Seamless Integration (BT), pp. 231–235.

SIGIR-2013-TrieschniggTH #named

SearchResultFinder: federated search made easy (DT, KTKJ, DH), pp. 1113–1114.

SAC-2013-FurtadoC #hybrid #middleware #network

Sensor streams middleware for easy configuration and processing in hybrid sensor network (PF, JC), pp. 1499–1504.

ESEC-FSE-2013-Terekhov

Good technology makes the difficult task easy (AT), pp. 683–686.

HT-2012-DinhNT #effectiveness #network #question #social

Cheap, easy, and massively effective viral marketing in social networks: truth or fiction? (TND, DTN, MTT), pp. 165–174.

SIGMOD-2012-ChengQR #big data #data analysis #named

GLADE: big data analytics made easy (YC, CQ, FR), pp. 697–700.

SIGMOD-2012-MohanTSSC #data analysis #named #privacy

GUPT: privacy preserving data analysis made easy (PM, AT, ES, DS, DEC), pp. 349–360.

VLDB-2012-LiuTP

MapReduce-based Dimensional ETL Made Easy (XL, CT, TBP), pp. 1882–1885.

FoSSaCS-2012-GorinS

Narcissists Are Easy, Stepmothers Are Hard (DG, LS), pp. 240–254.

WCRE-2012-TrudelFNMO #c

C to O-O Translation: Beyond the Easy Stuff (MT, CAF, MN, BM, MO), pp. 19–28.

ICPR-2012-YamazoeHMY

Easy depth sensor calibration (HY, HH, IM, YY), pp. 465–468.

ASPLOS-2012-HongCSO #analysis #domain-specific language #graph #named #performance

Green-Marl: a DSL for easy and efficient graph analysis (SH, HC, ES, KO), pp. 349–362.

CSL-2012-Brault-Baron #query

A Negative Conjunctive Query is Easy if and only if it is β-Acyclic (JBB), pp. 137–151.

STOC-2011-DobzinskiFK #correlation

Optimal auctions with correlated bidders are easy (SD, HF, RDK), pp. 129–138.

STOC-2011-Haeupler #network

Analyzing network coding gossip made easy (BH), pp. 293–302.

SFM-2011-Moschitti #automation #kernel #learning #modelling

Kernel-Based Machines for Abstract and Easy Modeling of Automatic Learning (AM), pp. 458–503.

HCI-MIIE-2011-AoyagiOIS #behaviour #communication

Proposal of a Method for Promotion of Continuous Pro-Environmental Behavior with Easy Communication (SA, TO, HI, HS), pp. 465–473.

CADE-2011-Ranta #logic #what

Translating between Language and Logic: What Is Easy and What Is Difficult (AR), pp. 5–25.

ICST-2011-HeamN #data type #generative #named #random #recursion #testing

Seed: An Easy-to-Use Random Generator of Recursive Data Structures for Testing (PCH, CN), pp. 60–69.

DATE-2010-MoyerKCRHT #assembly #question

Are we there yet? Has IP block assembly become as easy as LEGO? (BM, JK, JC, CR, EH, YT), p. 123.

FoSSaCS-2010-CateF #calculus #finite #proving #μ-calculus

An Easy Completeness Proof for the Modal μ-Calculus on Finite Trees (BtC, GF), pp. 161–175.

PEPM-2010-MagalhaesHJL #exclamation #optimisation

Optimizing generics is easy! (JPM, SH, JJ, AL), pp. 33–42.

PLDI-2010-ChambersRPAHBW #named #performance #pipes and filters

FlumeJava: easy, efficient data-parallel pipelines (CC, AR, FP, SA, RRH, RB, NW), pp. 363–375.

ICALP-v1-2010-KroviMOR #detection #quantum

Finding Is as Easy as Detecting for Quantum Walks (HK, FM, MO, JR), pp. 540–551.

SEKE-2010-AsteasuainB #specification

Specification patterns can be formal and still easy (FA, VAB), pp. 430–436.

SIGIR-2010-WanLX #named #summary

EUSUM: extracting easy-to-understand english summaries for non-native readers (XW, HL, JX), pp. 491–498.

RE-2010-Berenbach #industrial #requirements

Requirements Engineering for Industrial Systems: No Easy Answers (BB), pp. 373–374.

RE-2010-MavinW #approach #requirements

Big Ears (The Return of “Easy Approach to Requirements Engineering”) (AM, PW), pp. 277–282.

ICSE-2010-BianculliBD #evaluation #middleware #named #performance

SOABench: performance evaluation of service-oriented middleware made easy (DB, WB, MLD), pp. 301–302.

HPDC-2010-YuanYWZ #named #parallel #predict #scheduling #strict

PV-EASY: a strict fairness guaranteed and prediction enabled scheduler in parallel job scheduling (YY, GY, YW, WZ), pp. 240–251.

CHI-2009-ChettyBMJ #comprehension #power management

It’s not easy being green: understanding home computer power management (MC, AJBB, BM, PJ), pp. 1033–1042.

HCI-AUII-2009-Anupam #named #web

TringIt: Easy Triggering of Web Actions from a Phone (VA), pp. 11–20.

RE-2009-MavinWHN #approach #requirements #syntax

Easy Approach to Requirements Syntax (EARS) (AM, PW, AH, MN), pp. 317–322.

GTTSE-2009-KlintSV #metaprogramming #rascal

EASY Meta-programming with Rascal (PK, TvdS, JJV), pp. 222–289.

SPLC-2009-MendoncaWC #analysis #feature model #modelling #satisfiability

SAT-based analysis of feature models is easy (MM, AW, KC), pp. 231–240.

VLDB-2008-ChaikenJLRSWZ #named #parallel #performance #set

SCOPE: easy and efficient parallel processing of massive data sets (RC, BJ, PÅL, BR, DS, SW, JZ), pp. 1265–1276.

VLDB-2008-ShaoCTYA #enterprise #named #problem #recommendation

EasyTicket: a ticket routing recommendation engine for enterprise problem resolution (QS, YC, ST, XY, NA), pp. 1436–1439.

ITiCSE-2008-RosslingH #named #online #programming

WebTasks: online programming exercises made easy (GR, SH), p. 363.

FoSSaCS-2008-GimbertH #game studies #probability #random

Simple Stochastic Games with Few Random Vertices Are Easy to Solve (HG, FH), pp. 5–19.

PEPM-2008-VolanschiR #tool support

Unparsed patterns: easy user-extensibility of program manipulation tools (NV, CR), pp. 111–121.

STOC-2008-AroraKKSTV #constraints #game studies #graph

Unique games on expanding constraint graphs are easy: extended abstract (SA, SK, AK, DS, MT, NKV), pp. 21–28.

FLOPS-2008-ChristiansenF #for free #named #testing

EasyCheck — Test Data for Free (JC, SF), pp. 322–336.

ECIR-2008-Mizzaro #evaluation #information retrieval #question

The Good, the Bad, the Difficult, and the Easy: Something Wrong with Information Retrieval Evaluation? (SM), pp. 642–646.

CASE-2007-ArsandVH #health #mobile #people #self #usability

Usability of a Mobile Self-Help Tool for People with Diabetes: the Easy Health Diary (EÅ, RV, GH), pp. 863–868.

DATE-2007-LiuDSY #estimation #power management

Accurate temperature-dependent integrated circuit leakage power estimation is easy (YL, RPD, LS, HY), pp. 1526–1531.

ITiCSE-2007-RosslingKS #algorithm #animation #flexibility #generative #performance

Easy, fast, and flexible algorithm animation generation (GR, SK, SS), p. 357.

CHI-2007-CuiWXTT #clustering #interactive #named #ranking

EasyAlbum: an interactive photo annotation system based on face clustering and re-ranking (JC, FW, RX, YT, XT), pp. 367–376.

CHI-2007-HuWNMI #testing #usability

Context & usability testing: user-modeled information presentation in easy and difficult driving conditions (JH, AW, CN, JDM, RI), pp. 1343–1346.

ICEIS-DISI-2007-ArshinoffRSAO #query

Simplified query construction — queries made as easy as possible (BA, DR, MS, RA, TÖ), pp. 125–130.

GTTSE-2007-MoorSVHAEOT #object-oriented #query

.QL: Object-Oriented Queries Made Easy (OdM, DS, MV, EH, PA, TE, NO, JT), pp. 78–133.

ISSTA-2007-EnglerD #automation #execution #scalability

Under-constrained execution: making automatic code destruction easy and scalable (DRE, DD), pp. 1–4.

VLDB-2006-ChenMGFW #named #ontology

OntoQuest: Exploring Ontological Data Made Easy (LC, MEM, AG, LF, MWB), pp. 1183–1186.

TACAS-2006-BrownP #protocol #verification

Easy Parameterized Verification of Biphase Mark and 8N1 Protocols (GMB, LP), pp. 58–72.

ICALP-v1-2006-ChakrabartyMV #design #optimisation

Design Is as Easy as Optimization (DC, AM, VVV), pp. 477–488.

ICPR-v1-2006-LiH #estimation

Five-Point Motion Estimation Made Easy (HL, RIH), pp. 630–633.

ICSE-2006-HuangS #aspectj

Easy language extension with meta-aspectJ (SSH, YS), pp. 865–868.

ASE-2005-CoppitL #generative #named #testing

yagg: an easy-to-use generator for structured test inputs (DC, JL), pp. 356–359.

DATE-2005-HungBK #multi #programmable #symmetry

Symmetric Multiprocessing on Programmable Chips Made Easy (AH, WDB, AAK), pp. 240–245.

SIGMOD-2005-PolJ #bound #relational

Relational Confidence Bounds Are Easy With The Bootstrap (AP, CJ), pp. 587–598.

CIAA-2005-MoraisMR #automaton #regular expression

Acyclic Automata with Easy-to-Find Short Regular Expressions (JJM, NM, RR), pp. 349–350.

GPCE-2005-Pohjonen #metamodelling #tool support

Metamodeling Made Easy — MetaEdit+ (Tool Demonstration) (RP), pp. 442–446.

VLDB-2004-Campbell #database

Production Database Systems: Making Them Easy is Hard Work (DC), pp. 1196–1197.

PEPM-2004-Kamin #generative

Invited application paper: program generation considered easy (SK), pp. 68–79.

CHI-2004-JohnPSK #modelling #performance #predict

Predictive human performance modeling made easy (BEJ, KCP, DDS, KRK), pp. 455–462.

DLT-2003-Vollmer #complexity

Complexity Theory Made Easy (HV), pp. 95–110.

GPCE-2003-ChibaN #bytecode #java #performance #tool support

An Easy-to-Use Toolkit for Efficient Java Bytecode Translators (SC, MN), pp. 364–376.

FoSSaCS-2002-KnapikNU #automaton #higher-order

Higher-Order Pushdown Trees Are Easy (TK, DN, PU), pp. 205–222.

OSDI-2002-CoxMN #named

Pastiche: Making Backup Cheap and Easy (LPC, CDM, BDN), pp. 285–298.

ICALP-2001-ShankarKSR

Minimal Tail-Biting Trellises for Certain Cyclic Block Codes Are Easy to Construct (PS, PNAK, HS, BSR), pp. 627–638.

ESEC-FSE-2001-GrunbacherB #named #requirements

EasyWinWin: a groupware-supported methodology for requirements negotiation (PG, BWB), pp. 320–321.

ICSE-2001-BoehmGB #named #requirements

EasyWinWin: A Groupware-Supported Nethodology for Requirements Negotiation (BWB, PG, ROB), pp. 720–721.

SIGMOD-2000-RundensteinerCCSO #web

SERFing the Web: Web Site Management Made Easy (EAR, KTC, LC, HS, KO), p. 585.

VLDB-2000-GuPS #database

OLAP++: Powerful and Easy-to-Use Federations of OLAP and Object Databases (JG, TBP, AS), pp. 599–602.

ICRE-2000-Greenspan #question #requirements #why

Why is it so Easy to Introduce Requirements Engineering Technology Transfer Panels into Mainstream Practice? (SJG), pp. 69–70.

CAV-2000-Rushby #diagrams #invariant #verification

Verification Diagrams Revisited: Disjunctive Invariants for Easy Verification (JMR), pp. 508–520.

DAC-1999-PrasadCK #question #why

Why is ATPG Easy? (MRP, PC, KK), pp. 22–28.

HCI-CCAD-1999-Fanshawe

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

HCI-EI-1999-BrandlK #adaptation #generative #named

FormGen: A Generator for Adaptive Forms Based on EasyGUI (AB, GK), pp. 1172–1176.

HCI-EI-1999-MachiiMAKYKNK #3d #interface #internet #using

An Easy Internet Browsing System with Sophisticated Human Interface Using 3-D Graphics (KM, SM, YA, SK, MY, KK, YN, KK), pp. 228–232.

GCSE-1999-Jarvi #c++

C++ Function Object Binders Made Easy (JJ), pp. 165–177.

DATE-1998-DroegeTH #named

EASY — a System for Computer-Aided Examination of Analog Circuits (GD, MT, EHH), pp. 644–648.

SIGMOD-1998-DarEGP #database #web

DTL’s DataSpot: Database Exploration as Easy as Browsing the Web .. (SD, GE, SG, EP), pp. 590–592.

STOC-1998-BeigelBF #detection

NP Might Not Be As Easy As Detecting Unique Solutions (RB, HB, LF), pp. 203–208.

DAC-1997-Coudert #graph

Exact Coloring of Real-Life Graphs is Easy (OC), pp. 121–126.

ICALP-1996-Kaivola #automaton #fixpoint

Fixpoints for Rabin Tree Automata Make Complementation Easy (RK), pp. 312–323.

SEKE-1996-KarallB #case study #independence #re-engineering #visualisation

Case Study: EasyCODE — A Language Independent Visualization Tool for Reengineering (OK, SB), pp. 353–360.

SAC-1996-CucuccioGS #fuzzy #logic #low cost #performance

W.A.R.P and FUZZYSTUDIO: an easy and fast way to implement, With low cost, fuzzy logic control systems (AC, BG, GS), pp. 580–585.

JICSLP-1996-FileR #abstract domain

Complementation of Abstract Domains made Easy (GF, FR), pp. 348–362.

SEKE-1995-PanY #database #named #object-oriented #query

EQL: A Learn-Easy and Use-Easy Query Language for Object-Oriented Databases (WWP, WPY), pp. 366–373.

EDAC-1994-KimCL #refinement #synthesis #testing

A Stepwise Refinement Data Path Synthesis Procedure for Easy Testability (TK, KSC, CLL), pp. 586–590.

TRI-Ada-1994-KayloeL #ada #architecture #named #using

Easy-Sim: Using Ada 9X in a Graphics System Software Architecture (JRK, PKL), pp. 164–169.

KR-1994-Konolige #algorithm #problem

Easy to be Hard: Difficult Problems for Greedy Algorithms (KK), pp. 374–378.

HCI-SHI-1993-MartialD #design #named #people #user interface #visual notation

Audicon: Easy Access to Graphical User Interfaces for Blind Persons — Designing for and with People (OM, AD), pp. 808–813.

ICALP-1992-LaenensVZ #logic programming #semantics

Logic Programming Semantics Made Easy (EL, DV, CZ), pp. 499–508.

CHI-1992-Houde #3d #design #interface

Iterative Design of an Interface for Easy 3-D Direct Manipulation (SH), pp. 135–142.

PLILP-1991-Davison

From Parlog to Polka in two easy Steps (AD), pp. 171–182.

ICALP-1988-ArnborgLS #graph #problem

Problems Easy for Tree-Decomposable Graphs (Extended Abstract) (SA, JL, DS), pp. 38–51.

STOC-1987-MulmuleyVV #matrix

Matching Is as Easy as Matrix Inversion (KM, UVV, VVV), pp. 345–354.

STOC-1985-ValiantV #detection

NP Is as Easy as Detecting Unique Solutions (LGV, VVV), pp. 458–463.

STOC-1980-HeintzS #testing

Testing Polynomials which Are Easy to Compute (Extended Abstract) (JH, CPS), pp. 262–272.