Stem possibl$ (all stems)

88 papers:

DATE-2015-VargasQM #predict #question

OpenMP and timing predictability: a possible union? (RV, EQ, AM), pp. 617–620.

VLDB-2015-KohlerLZ #sql

Possible and Certain SQL Key (HK, SL, XZ), pp. 1118–1129.

VLDB-2015-NaidanBN #performance #permutation

Permutation Search Methods are Efficient, Yet Faster Search is Possible (BN, LB, EN), pp. 1618–1629.

DUXU-DD-2015-PaelkeR #challenge #cyber-physical #user interface

User Interfaces for Cyber-Physical Systems: Challenges and Possible Approaches (VP, CR), pp. 75–85.

DUXU-DD-2015-RenziF #delphi #human-computer

Delphi Method to Explore Future Scenario Possibilities on Technology and HCI (ABR, SFdF), pp. 644–653.

HCI-UC-2015-MacielP #human-computer #legacy

Post-mortem Digital Legacy: Possibilities in HCI (CM, VCP), pp. 339–349.

HIMI-IKC-2015-Frimodt-MollerB #information management

Possible Strategies for Facilitating the Exchange of Tacit Knowledge in a Team of Creative Professionals (SRFM, NB, EPB, YG), pp. 467–475.

DAC-2014-Kose #challenge

Thermal Implications of On-Chip Voltage Regulation: Upcoming Challenges and Possible Solutions (SK), p. 6.

SIGMOD-2014-ParchasGPB #graph #nondeterminism

The pursuit of a good possible world: extracting representative instances of uncertain graphs (PP, FG, DP, FB), pp. 967–978.

VLDB-2014-FanWWD #distributed #graph #simulation

Distributed Graph Simulation: Impossibility and Possibility (WF, XW, YW, DD), pp. 1083–1094.

FM-2014-BjornerH #formal method #question

40 Years of Formal Methods — Some Obstacles and Some Possibilities? (DB, KH), pp. 42–61.

CHI-2014-MellisB

Do-it-yourself cellphones: an investigation into the possibilities and limits of high-tech diy (DAM, LB), pp. 1723–1732.

DUXU-ELAS-2014-KuruK #design #difference #gender #health

Exploring Possibilities of Designing Virtual Personal Health Coach in Relation to Gender Differences (HK, AK), pp. 63–71.

DUXU-TMT-2014-So

Affording Creativity and New Media Possibilities (ZS), pp. 675–685.

DATE-2013-VenutoS

Dr. Frankenstein’s dream made possible: implanted electronic devices (DDV, ALSV), pp. 1531–1536.

ICDAR-2013-TeradaHFU #detection #on the

On the Possibility of Structure Learning-Based Scene Character Detector (YT, RH, YF, SU), pp. 472–476.

PODS-2013-GheerbrantLS #evaluation #question

When is naive evaluation possible? (AG, LL, CS), pp. 75–86.

ICPC-2013-AlyCM #comprehension #towards

Building extensions for applications: Towards the understanding of extension possibilities (MA, AC, MM), pp. 182–191.

OCSC-2013-LeeKS #case study #experience #social

Assessing the Possibility of a Social e-Book by Analyzing Reader Experiences (SL, JIK, CS), pp. 50–57.

ICEIS-v2-2013-Heusinger #challenge #design #research

Challenges of Critical and Emancipatory Design Science Research — The Design of “Possible Worlds” as Response (JMH), pp. 339–345.

KR-2012-MorettiT #ranking #set #using

Ranking Sets of Possibly Interacting Objects Using Shapley Extensions (SM, AT).

OSDI-2012-LiPCGPR #consistency #performance

Making Geo-Replicated Systems Fast as Possible, Consistent when Necessary (CL, DP, AC, JG, NMP, RR), pp. 265–278.

ICLP-2012-Wright

Together, Is Anything Possible? A Look at Collective Commitments for Agents (BW), pp. 476–480.

ASE-2011-RabkinK #fault

Precomputing possible configuration error diagnoses (AR, RHK), pp. 193–202.

CASE-2011-WanY #detection #fault

Fault detection of networked control systems utilizing limited possibilities of unknown packet transmission (YW, HY), pp. 619–624.

DATE-2011-EggersglusD #fault #generative #optimisation #pseudo #testing #using

As-Robust-As-Possible test generation in the presence of small delay defects using pseudo-Boolean optimization (SE, RD), pp. 1291–1296.

DUXU-v1-2011-BevanR #question #standard #usability

ISO 20282: Is a Practical Standard for the Usability of Consumer Products Possible? (NB, SR), pp. 119–127.

HCD-2011-AryanaBN #communication #mobile

Possibilities for Cultural Customization of Mobile Communication Devices: The Case of Iranian Mobile Users (BA, CB, AN), pp. 177–186.

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.

ICEIS-DISI-2010-SunyaevKDK #framework #health

Attack Scenarios for Possible Misuse of Peripheral Parts in the German Health Information Infrastructure (AS, AK, SD, HK), pp. 229–235.

ICML-2010-LiKL #approximate #scalability

Making Large-Scale Nyström Approximation Possible (ML, JTK, BLL), pp. 631–638.

KR-2010-QiZ #semantics

Preferential Semantics for Plausible Subsumption in Possibility Theory (GQ, ZZ).

SAC-2010-DolevGK #multi #scalability #trust

Computing multi-party trust privately: in O(n) time units sending one (possibly large) message at a time (SD, NG, MK), pp. 1460–1465.

DATE-2009-MarinissenLHSMSP #question #testing

Contactless testing: Possibility or pipe-dream? (EJM, DYL, JPH, CS, BM, SS, LP), pp. 676–681.

ICDAR-2009-HeH #approach #online

A Character-Structure-Guided Approach to Estimating Possible Orientations of a Rotated Isolated Online Handwritten Chinese Character (TH, QH), pp. 536–540.

VLDB-2009-BeskalesSIB #detection #modelling #query

Modeling and Querying Possible Repairs in Duplicate Detection (GB, MAS, IFI, SBD), pp. 598–609.

CHI-2009-PirolliWS #wiki

So you know you’re getting the best possible information: a tool that increases Wikipedia credibility (PP, EW, BS), pp. 1505–1508.

HCD-2009-Okamoto #design

Possibility of Participatory Design (MO), pp. 888–893.

HCI-NT-2009-SuzukiMSANYF #estimation #on the #performance #using

On the Possibility about Performance Estimation Just before Beginning a Voluntary Motion Using Movement Related Cortical Potential (SS, TM, YS, KA, NN, TY, SF), pp. 184–191.

CHI-2008-CostabileALABP #challenge #exclamation #learning #mobile

Explore! possibilities and challenges of mobile learning (MFC, ADA, RL, CA, PB, TP), pp. 145–154.

SIGAda-2008-Maurer #ada #problem #source code

Removing backward go-to statements from Ada programs: possibilities and problems (WDM), pp. 105–108.

DAC-2007-Roychowdhury

Micro-Photonic Interconnects: Characteristics, Possibilities and Limitations (JSR), pp. 574–575.

DATE-2007-Furuyama #challenge #mobile #question

Keynote address: Challenges of digital consumer and mobile SoC’s: more Moore possible? (TF), p. 1.

HCI-IPT-2007-JangCJC #smarttech

Exploring Possibilities of ECG Electrodes for Bio-monitoring Smartwear with Cu Sputtered Fabrics (SJ, JC, KJ, GC), pp. 1130–1137.

HCI-MIE-2007-OguraNS #communication #parallel #thread #using

Exploration of Possibility of Multithreaded Conversations Using a Voice Communication System (KO, KN, KS), pp. 186–195.

ICEIS-DISI-2007-ArshinoffRSAO #query

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

SEKE-2007-PengJRZ #case study #component #database #product line #reuse

Reuse of Database Access Layer Components in JEE Product Lines: Limitations and a Possible Solution (Case Study) (DP, SJ, DCR, HZ), pp. 308–313.

SIGIR-2007-YangKL #named #web

DiffusionRank: a possible penicillin for web spamming (HY, IK, MRL), pp. 431–438.

SAC-2007-FangWLYD #assessment #detection #multi #sequence #using

The detection and assessment of possible RNA secondary structure using multiple sequence alignment (XF, ZW, ZL, BY, FD), pp. 133–137.

SAC-2006-AdvaniHC #open source #refactoring #roadmap

Extracting refactoring trends from open-source software and a possible solution to the “related refactoring” conundrum (DA, YH, SC), pp. 1713–1720.

DATE-2005-Kong #challenge

SoC in Nanoera: Challenges and Endless Possibility (JTK), p. 2.

ITiCSE-2005-PaisB #user interface

Two possible approaches for an intermediate GUI course (RP, JPB), p. 365.

KDD-2005-LeskovecKF #graph

Graphs over time: densification laws, shrinking diameters and possible explanations (JL, JMK, CF), pp. 177–187.

FoSSaCS-2004-FokkinkN #finite #infinity #on the

On Finite Alphabets and Infinite Bases: From Ready Pairs to Possible Worlds (WF, SN), pp. 182–194.

STOC-2004-AchlioptasN #graph #random

The two possible values of the chromatic number of a random graph (DA, AN), pp. 587–593.

ICEIS-v3-2004-Nobre04a #what

Computer Ethics: What are we Talking About? Possible Contributions from Philosophy of Action, Critical Realism and Modern Hermeneutics (ÂLN), pp. 683–687.

ICPR-v4-2004-KadyrovP #reverse engineering

Reverse Engineering the Human Vision System: A Possible Explanation for the Role of Microsaccades (AK, MP), pp. 64–67.

ICLP-2004-DekhtyarD #logic programming #probability #semantics #source code

Possible Worlds Semantics for Probabilistic Logic Programs (AD, MID), pp. 137–148.

HT-2003-Nelson

Structure, tradition and possibility (THN), p. 1.

VLDB-2003-YuPM #distributed #query

Distributed Top-N Query Processing with Possibly Uncooperative Local Systems (CTY, GP, WM), pp. 117–128.

ICEIS-v3-2003-BarjisG #requirements

Requirements Engineering Versus Language/Action Perspective: Different Facets and Possible Contribution (JB, TG), pp. 14–22.

ICEIS-v3-2003-Govaere

Prescribed Impacts and Impacts Stipulated for Ics: The Gap Between the Possibilities and the Use of Ics (VG), pp. 590–593.

PPDP-2003-Nanevski

From dynamic binding to state via modal possibility (AN), pp. 207–218.

FoSSaCS-2002-GodardM #graph #product line

A Characterization of Families of Graphs in Which Election Is Possible (EG, YM), pp. 159–172.

SAS-2002-BagnaraRZH #library

Possibly Not Closed Convex Polyhedra and the Parma Polyhedra Library (RB, ER, EZ, PMH), pp. 213–229.

CIKM-2002-Zemankova #information management #question #research

Knowledge and information management: Is it possible to do interesting and important research, get funded, be useful and appreciated? (MZ), pp. 373–374.

CSL-2002-Levy #call-by #semantics

Possible World Semantics for General Storage in Call-By-Value (PBL), pp. 232–246.

ICFP-2001-GustavssonS #call-by

Possibilities and Limitations of Call-by-Need Space Improvement (JG, DS), pp. 265–276.

TOOLS-USA-2001-Devos01a

Confronting Possibilities and Needs in the Digital Economy: Breaking out of the Box to Envision the System (MMD), pp. 432–434.

CAV-2001-LarsenBBFHPR #automaton #performance #reachability

As Cheap as Possible: Efficient Cost-Optimal Reachability for Priced Timed Automata (KGL, GB, EB, AF, TH, PP, JR), pp. 493–505.

ICPR-v4-2000-TakahashiKIS #image #using

Expanding Possible View Points of Virtual Environment Using Panoramic Images (TT, HK, KI, MS), pp. 4468–4472.

CSMR-1999-GranjaJ #testing

Techniques for Regression Testing: Selecting Test Case Sets Tailored to Possibly Modified Functionalities (IG, MJ), pp. 2–13.

HCI-CCAD-1999-Paul #video

Improving public administration by video conferencing and application sharing — mission possible (HP), pp. 318–322.

TOOLS-ASIA-1999-Pour99b #development #enterprise #java #xml

Enterprise JavaBeans, JavaBeans & XML Expanding the Possibilities for Web-Based Enterprise Application Development (GP), pp. 282–291.

ITiCSE-1998-Culwin #assessment #policy #web

Web hosted assessment — possibilities and policy (FC), pp. 55–58.

HCI-CC-1997-Kjuus #design #health #requirements

Field Studies of Possible Health Effects Related to VDU Work-Epidemiological Design Options and Requirements (MDHK), pp. 627–630.

CHI-1996-ButtonD #named

Technomethodology: Paradoxes and Possibilities (GB, PD), pp. 19–26.

KR-1996-Sloman

Actual Possibilities (AS), pp. 627–638.

HPDC-1996-DincerFH #algorithm #fortran

High-Performance Fortran and Possible Extensions to Support Conjugate Gradient Algorithms (KD, GF, KAH), pp. 69–77.

ICALP-1995-Lipponen #problem #word

Post Correspondence Problem: Words Possible as Primitive Solutions (ML), pp. 63–74.

HCI-ACS-1993-HjelmquistJ #visual notation

Work Possibilities for Visually Impaired: The role of Information Technology (EH, BJ), pp. 498–503.

KR-1992-NejdlB #query #semantics

Asking About Possibilities — Revision and Update Semantics for Subjunctive Queries (WN, MB), pp. 697–708.

CADE-1992-Cohn #logic

A Many Sorted Logic with Possibly Empty Sorts (AGC), pp. 633–647.

PODS-1988-ParedaensG #algebra #using

Possibilities and Limitations of Using Flat Operators in Nested Algebra Expressions (JP, DVG), pp. 29–38.

CSL-1988-Speckenmeyer #question

Is Average Superlinear Speedup Possible? (ES), pp. 301–312.

SIGMOD-1987-AbiteboulKG #on the #query #representation #set

On the Representation and Querying of Sets of Possible Worlds (SA, PCK, GG), pp. 34–48.

STOC-1984-DolevHS #on the

On the Possibility and Impossibility of Achieving Clock Synchronization (DD, JYH, HRS), pp. 504–511.

ICSE-1976-Wexelblat #design #how #programming

Maxims for Malfeasant Designers, or How to Design Languages to Make Programming as Difficult as Possible (RLW), pp. 331–336.