Stem some$ (all stems)

424 papers:

CASE-2015-BlanchiniFGP #programming

Inverse kinematics by means of convex programming: Some developments (FB, GF, GG, FAP), pp. 515–520.

CASE-2015-ForsmanR #process

Chemical process control practice — Some examples and observations (KF, JR), pp. 892–893.

DAC-2015-PetrenkoTR #challenge #modelling #testing

Model-based testing of automotive software: some challenges and solutions (AP, ONT, SR), p. 6.

DATE-2015-SeylerSGNT #analysis #formal method

Formal analysis of the startup delay of SOME/IP service discovery (JRS, TS, MG, NN, JT), pp. 49–54.

GCM-2015-MackieS #evaluation #interactive #parallel

Parallel Evaluation of Interaction Nets: Some Observations and Examples (IM, SS), pp. 50–65.

CHI-2015-JakobsenH #interactive

Is Moving Improving?: Some Effects of Locomotion in Wall-Display Interaction (MRJ, KH), pp. 4169–4178.

DUXU-UI-2015-DuWDXJ #case study #metric #using

Study on Operating Clearance Measurement of Some Connectors by Using Motion Capture (HD, LW, LD, YX, CJ), pp. 45–53.

HCI-DE-2015-Uchida #approach #security

A Psychological Approach to Information Security — Some Ideas for Establishing Information Security Psychology (KU), pp. 96–104.

HCI-IT-2015-PoirierB #named

UniWatch — Some Approaches Derived from UniGlyph to Allow Text Input on Tiny Devices Such as Connected Watches (FP, MB), pp. 554–562.

HCI-UC-2015-GofukuFU

Some Investigations of Fukushima Dai-ichi Accidents from the Viewpoints of Human Factors (AG, HF, HU), pp. 314–326.

ICML-2015-SaRO #convergence #matrix #probability #problem

Global Convergence of Stochastic Gradient Descent for Some Non-convex Matrix Problems (CDS, CR, KO), pp. 2332–2341.

DLT-J-2013-IbarraR14 #complexity

Some Decision Questions Concerning the Time Complexity of Language Acceptors (OHI, BR), pp. 1127–1140.

DLT-J-2013-Shur14 #anti #finite

Languages with a Finite antidictionary: some growth Questions (AMS), pp. 937–954.

AFL-2014-HolzerJ #automaton #product line #regular expression

More Structural Characterizations of Some Subregular Language Families by Biautomata (MH, SJ), pp. 271–285.

ICALP-v1-2014-IaconoO #why

Why Some Heaps Support Constant-Amortized-Time Decrease-Key Operations, and Others Do Not (JI, ÖÖ), pp. 637–649.

FM-2014-BjornerH #formal method #question

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

DUXU-ELAS-2014-BackhausBT #experience #user interface

Positive Technology and User Experience for Human Needs in Developing Countries: Some Considerations (NB, SB, AT), pp. 400–410.

DUXU-ELAS-2014-MontAlvao #bibliography #health #using

Health Care Professionals vs Other Professionals: Do They Have Different Perceptions about Health Care Waste and Dangerous Products Pictograms? Some Findings Using a Digital Device in Field Survey (CRM), pp. 83–90.

ICML-c1-2014-AroraBGM #bound #learning

Provable Bounds for Learning Some Deep Representations (SA, AB, RG, TM), pp. 584–592.

CSEET-2013-ChimalakondaN #adaptation #education #learning #personalisation #re-engineering #what

What makes it hard to teach software engineering to end users? some directions from adaptive and personalized learning (SC, KVN), pp. 324–328.

FoSSaCS-2013-DahlqvistP #algebra #logic

Some Sahlqvist Completeness Results for Coalgebraic Logics (FD, DP), pp. 193–208.

STOC-2013-BeckNT #calculus #polynomial #trade-off

Some trade-off results for polynomial calculus: extended abstract (CB, JN, BT), pp. 813–822.

CIAA-2013-IbarraR #problem

Some Decision Problems Concerning NPDAs, Palindromes, and Dyck Languages (OHI, BR), pp. 193–207.

DLT-2013-IbarraR #complexity

Some Decision Questions Concerning the Time Complexity of Language Acceptors (OHI, BR), pp. 264–276.

LATA-2013-CuiDFI #automaton #execution

Execution Information Rate for Some Classes of Automata (CC, ZD, TRF, OHI), pp. 226–237.

LATA-2013-FernauHV #analysis #automaton #multi #problem

A Multivariate Analysis of Some DFA Problems (HF, PH, YV), pp. 275–286.

CHI-2013-MedhiLTC #education #navigation #user interface

Some evidence for the impact of limited education on hierarchical user interface navigation (IM, ML, KT, EC), pp. 2813–2822.

HCI-AMTE-2013-FuglerudS #design

The Link between Inclusive Design and Innovation: Some Key Elements (KSF, DS), pp. 41–50.

HCI-AS-2013-RabieN #challenge #ontology

Discussion of Some Challenges Concerning Biomedical Ontologies (OR, AFN), pp. 173–180.

ICEIS-v2-2013-RothPS #communication #social #social media

Some Insights into the Role of Social Media in Political Communication (MR, GP, JS), pp. 351–360.

LICS-2013-Comon-Lundh #logic #modelling #named #problem #security

LICS: Logic in Computer Security — Some Attacker’s Models and Related Decision Problems (HCL), p. 1.

MSR-2012-GilGM #empirical

An empirical investigation of changes in some software properties over time (JYG, MG, DM), pp. 227–236.

DLT-J-2011-ZhengQL12 #automaton #finite #quantum

Some Languages Recognized by Two-Way Finite Automata with Quantum and Classical States (SZ, DQ, LL), pp. 1117–1130.

ICALP-v2-2012-Barenboim #locality #on the #problem

On the Locality of Some NP-Complete Problems (LB), pp. 403–415.

LATA-2012-Woryna #automaton #self

Automaton Ranks of Some Self-similar Groups (AW), pp. 514–525.

KDIR-2012-Zamora-MartinezRPT #empirical #network

Some Empirical Evaluations of a Temperature Forecasting Module based on Artificial Neural Networks for a Domotic Home Environment (FZM, PR, JP, DT), pp. 206–211.

REFSQ-2012-EngelsmanW #architecture #case study #enterprise #lessons learnt #requirements

Goal-Oriented Requirements Engineering and Enterprise Architecture: Two Case Studies and Some Lessons Learned (WE, RW), pp. 306–320.

CAV-2012-Thomas #challenge #synthesis

Synthesis and Some of Its Challenges (WT), p. 1.

ICST-2012-ChoudharyDBJOI #challenge #internet #modelling #security #testing

Solving Some Modeling Challenges when Testing Rich Internet Applications for Security (SC, MED, GvB, GVJ, IVO, PI), pp. 850–857.

DATE-2011-ClermidyDDLV #3d #embedded #manycore

3D Embedded multi-core: Some perspectives (FC, FD, DD, WL, PV), pp. 1327–1332.

CSEET-2011-Rajapakse #student

Some observations from releasing student projects to the public (DCR), pp. 247–256.

DLT-J-2009-BertoniCR11 #context-free grammar #problem

The Inclusion Problem of Context-Free Languages: Some Tractable Cases (AB, CC, RR), pp. 289–299.

DLT-2011-RestivoV #automaton

Some Remarks on Automata Minimality (AR, RV), pp. 15–27.

FM-2011-Harel #behaviour #programming

Some Thoughts on Behavioral Programming (DH), p. 2.

SFM-2011-Tretmans #modelling #testing #towards

Model-Based Testing and Some Steps towards Test-Based Modelling (JT), pp. 297–326.

CEFP-2011-SlodicakMN #category theory #functional #programming

Some New Approaches in Functional Programming Based on Categories (VS, PM, VN), pp. 517–532.

CHI-2011-WilsonHBH #feedback #mobile

Some like it hot: thermal feedback for mobile devices (GW, MH, SAB, SAH), pp. 2555–2564.

HCD-2011-AlmAGEDVR #aspect-oriented

Cognitive Prostheses: Findings from Attempts to Model Some Aspects of Cognition (NA, AA, GG, ME, RD, PV, PR), pp. 275–284.

HIMI-v1-2011-Mori #towards

Some Issues toward Creating Human-Centric Services (HM), pp. 118–121.

KDD-2011-PatnaikBRPKH #case study #challenge #experience #mining #sequence

Experiences with mining temporal event sequences from electronic medical records: initial successes and some challenges (DP, PB, NR, LP, BJK, DAH), pp. 360–368.

SEKE-2011-GuoC #analysis #comparison #ontology #tool support #visualisation

A Comparison and Analysis of Some Ontology Visualization Tools (SSG, CWC), pp. 357–362.

SEKE-2011-XueJYPZ #industrial #scalability #variability

Scalability of Variability Management: An Example of Industrial Practice and Some Improvements (YX, SJ, PY, XP, WZ), pp. 705–710.

BX-2011-Kindler1 #bidirectional #challenge

Some challenges of integrating bidirectional transformation technologies (EK), p. 61.

LICS-2011-Pitassi #bibliography #complexity #proving #state of the art

Propositional Proof Complexity: A Survey on the State of the Art, Including Some Recent Results (TP), p. 119.

SAT-2011-IgnatievS #encryption

DPLL+ROBDD Derivation Applied to Inversion of Some Cryptographic Functions (AI, AS), pp. 76–89.

SIGMOD-2010-BjorlingFMBBJ #lessons learnt #metric

Performing sound flash device measurements: some lessons from uFLIP (MB, LLF, AM, PB, LB, BÞJ), pp. 1219–1222.

CSEET-2010-GarousiM #education #recommendation #testing

Current State of the Software Testing Education in North American Academia and Some Recommendations for the New Educators (VG, AM), pp. 89–96.

AFL-J-2008-ManeaMY10

Some Remarks on the Hairpin Completion (FM, VM, TY), pp. 859–872.

CIAA-2010-Rudie #problem #summary

A Summary of Some Discrete-Event System Control Problems (KR), pp. 4–16.

ICALP-v2-2010-BlockiW #complexity #privacy #problem

Resolving the Complexity of Some Data Privacy Problems (JB, RW), pp. 393–404.

LATA-2010-Tamm #automaton

Some Minimality Results on Biresidual and Biseparable Automata (HT), pp. 573–584.

CHI-2010-KelkarJS #collaboration #enterprise

Some observations on the “live” collaborative tagging of audio conferences in the enterprise (SK, AJ, DDS), pp. 995–998.

ICEIS-HCI-2010-PereiraBS #question #social #why

A Framework-informed Discussion on Social Software — Why Some Social Software Fail and Others do Not? (RP, MCCB, SRPdS), pp. 149–154.

KEOD-2010-FrixioneL #concept #ontology #representation

The Computational Representation of Concepts in Formal Ontologies — Some General Considerations (MF, AL), pp. 396–403.

KEOD-2010-GrutterWD #development #lessons learnt #ontology

Practical Ontology Development — Some Lessons Learnt (RG, BW, CD), pp. 467–470.

SEKE-2010-ZhangZH #model checking #precise

Some Improvements for More Precise Model Checking (ZZ, QZ, MH), pp. 106–112.

SIGIR-2010-LiuLGB #behaviour #detection

Can search systems detect users’ task difficulty?: some behavioral signals (JL, CL, JG, NJB), pp. 845–846.

PADL-2010-Marti-Oliet #maude

An Introduction to Maude and Some of Its Applications (NMO), pp. 4–9.

RE-2010-MashkoorJ #domain model #lessons learnt

Domain Engineering with Event-B: Some Lessons We Learned (AM, JPJ), pp. 252–261.

VLDB-2009-Ley #lessons learnt #named

DBLP — Some Lessons Learned (ML), pp. 1493–1500.

DLT-2009-BertoniCR #context-free grammar #problem

The Inclusion Problem of Context-Free Languages: Some Tractable Cases (AB, CC, RR), pp. 103–112.

DLT-2009-ManeaMS

Some Remarks on Superposition Based on Watson-Crick-Like Complementarity (FM, VM, JMS), pp. 372–383.

LATA-2009-Masopust #context-free grammar #generative #power of

A Note on the Generative Power of Some Simple Variants of Context-Free Grammars Regulated by Context Conditions (TM), pp. 554–565.

CHI-2009-OdomPSB #comprehension #design #interactive #why

Understanding why we preserve some things and discard others in the context of interaction design (WO, JP, ES, EB), pp. 1053–1062.

HCI-AUII-2009-RehmAN

Some Pitfalls for Developing Enculturated Conversational Agents (MR, EA, YIN), pp. 340–348.

HCI-VAD-2009-TamaokiTM #user interface

Developing Some User Interfaces of TV under Enormous Channels Environment (ST, TT, HM), pp. 624–631.

HIMI-DIE-2009-SongL #gender

The Roles of Profession and Gender in Some PIM Tasks (GS, CL), pp. 429–436.

KEOD-2009-Lopez-GarciaMB #design #information management

Some Common Pitfalls in the Design of Ontology-driven Information Systems (PLG, EM, JB), pp. 468–471.

MLDM-2009-FranceC #distance

Is the Distance Compression Effect Overstated? Some Theory and Experimentation (SLF, JDC), pp. 280–294.

SEKE-2009-MukhopadhyayPRPM #benchmark #comparison #information management #metric #multi #set

Comparison of Some Single-agent and Multi-agent Information Filtering Systems on a Benchmark Text Data Set (SM, SP, RRR, MJP, JM), pp. 185–188.

SEKE-2009-PoloPR #testing

Some Experiments on Test Case Tracebaility (MP, BPL, PRM), pp. 318–321.

GTTSE-2009-WermelingerY #evolution

Some Issues in the “Archaeology” of Software Evolution (MW, YY), pp. 426–445.

SAT-2009-PorschenSS #aspect-oriented #on the

On Some Aspects of Mixed Horn Formulas (SP, TS, ES), pp. 86–100.

TLCA-2009-Strassburger #higher-order #linear #logic #multi #proving

Some Observations on the Proof Theory of Second Order Propositional Multiplicative Linear Logic (LS), pp. 309–324.

SCAM-2008-FehnkerHRS #assembly #embedded #program analysis

Some Assembly Required — Program Analysis of Embedded System Code (AF, RH, FR, SS), pp. 15–24.

WCRE-2008-Gall #ide

Of Changes and their History: Some Ideas for Future IDEs (HG), p. 3.

STOC-2008-Nandakumar #effectiveness #theorem

An effective ergodic theorem and some applications (SN), pp. 39–44.

STOC-2008-ODonnell #analysis #topic

Some topics in analysis of boolean functions (RO), pp. 569–578.

AFL-2008-ManeaMY

Some Remarks on the Hairpin Completion (FM, VM, TY), pp. 302–313.

DLT-2008-Csuhaj-VarjuDV

Some New Modes of Competence-Based Derivations in CD Grammar Systems (ECV, JD, GV), pp. 228–239.

FM-2008-Engler #case study #experience #lessons learnt #scalability

Lessons in the Weird and Unexpected: Some Experiences from Checking Large Real Systems (DRE), p. 33.

GT-VMT-2006-SiikarlaS08 #assembly

Transformational Pattern System — Some Assembly Required (MS, TS), pp. 63–74.

CHI-2008-GreenbergB #evaluation #harmful #usability

Usability evaluation considered harmful (some of the time) (SG, WB), pp. 111–120.

ICEIS-HCI-2008-MileyRM #learning

Traditional Learning Vs. e-LEARNING — Some Results from Training Call Centre Personnel (MM, JAR, CM), pp. 299–307.

CIKM-2008-XieCGZ #navigation #optimisation #xquery

Some rewrite optimizations of DB2 XQuery navigation (GX, QC, JG, CZ), pp. 531–540.

ECIR-2008-Belkin #challenge #information retrieval #what

Some(What) Grand Challenges for Information Retrieval (NJB), p. 1.

ECIR-2008-RitchieTR #information retrieval #using

Using Terms from Citations for IR: Some First Results (AR, ST, SR), pp. 211–221.

SAS-2007-GallJ #automaton #infinity #representation #verification

Lattice Automata: A Representation for Languages on Infinite Alphabets, and Some Applications to Verification (TLG, BJ), pp. 52–68.

STOC-2007-Pap

Some new results on node-capacitated packing of A-paths (GP), pp. 599–604.

DLT-2007-Pritykin #on the #sequence

On Almost Periodicity Criteria for Morphic Sequences in Some Particular Cases (YP), pp. 361–370.

ICALP-2007-Damgard #encryption

A “proof-reading” of Some Issues in Cryptography (ID), pp. 2–11.

LATA-2007-DassowF #approach #comparison

Comparison of Some Descriptional Complexities of 0L Systems Obtained by a Unifying Approach (JD, HF), pp. 249–260.

HCI-AS-2007-MakkonenV #empirical #multi

Some Empirical Results on a Multimedia Work Support System (JM, AV), pp. 654–662.

REFSQ-2007-AurumW #approach #concept #requirements

A Value-Based Approach in Requirements Engineering: Explaining Some of the Fundamental Concepts (AA, CW), pp. 109–115.

SAC-2007-Savoy #topic #why

Why do successful search systems fail for some topics (JS), pp. 872–877.

CSL-2007-FinkelL #rank

There Exist Some ω-Powers of Any Borel Rank (OF, DL), pp. 115–129.

LICS-2007-Hales #geometry #problem

Some Methods of Problem Solving in Elementary Geometry (TCH), pp. 35–40.

ITiCSE-2006-Hamer #approach #case study #experience #student

Some experiences with the “contributing student approach” (JH), pp. 68–72.

DLT-J-2005-Pribavkina06 #on the #word

On some Properties of the Language of 2-collapsing Words (EVP), pp. 665–676.

CIAA-2006-CortesMR #automaton #on the #probability #standard

On the Computation of Some Standard Distances Between Probabilistic Automata (CC, MM, AR), pp. 137–149.

DLT-2006-MenzelPS #graph

Some Examples of Semi-rational DAG Languages (JRM, LP, MS), pp. 351–362.

DLT-2006-Paun

Languages in Membrane Computing: Some Details for Spiking Neural P Systems (GP), pp. 20–35.

DLT-2006-Ravikumar #automaton #finite #modelling #on the #probability

On Some Variations of Two-Way Probabilistic Finite Automata Models (BR), pp. 443–454.

ICALP-v1-2006-CaiC #algorithm #artificial reality

Some Results on Matchgates and Holographic Algorithms (JyC, VC), pp. 703–714.

ICPR-v1-2006-DjorgovskiDMWDGG #challenge #data-driven #pattern matching #pattern recognition #recognition

Some Pattern Recognition Challenges in Data-Intensive Astronomy (SGD, CD, AM, RW, AJD, MJG, EG), pp. 856–863.

RE-2006-BushN #requirements #research

Requirements Engineering Research in Some Future Worlds: An Exercise in Scenario Planning (DB, BN), p. 324.

ICSE-2006-PoonY #case study #enterprise #experience #resource management

Procurement of enterprise resource planning systems: experiences with some Hong Kong companies (PLP, YTY), pp. 561–568.

CAV-2006-BustanH #complexity

Some Complexity Results for SystemVerilog Assertions (DB, JH), pp. 205–218.

CSL-2006-Ong #approach #infinity #semantics #verification

Some Results on a Game-Semantic Approach to Verifying Finitely-Presentable Infinite Structures (Extended Abstract) (CHLO), pp. 31–40.

SIGMOD-2005-Shasha #case study #lessons learnt

Computing for biologists: lessons from some successful case studies (DS), pp. 968–969.

SIGMOD-2005-Sikka #architecture #challenge #data transformation #metadata

Data and metadata management in service-oriented architectures: some open challenges (VS), pp. 849–850.

TACAS-2005-Jiang #invariant #on the

On Some Transformation Invariants Under Retiming and Resynthesis (JHRJ), pp. 413–428.

STOC-2005-FlaxmanFV #algorithm #approximate #on the #performance #problem

On the average case performance of some greedy approximation algorithms for the uncapacitated facility location problem (AF, AMF, JCV), pp. 441–449.

DLT-2005-BorelR #word

Some New Results on Palindromic Factors of Billiard Words (JPB, CR), pp. 180–188.

DLT-2005-Pribavkina #on the #word

On Some Properties of the Language of 2-Collapsing Words (EVP), pp. 374–384.

ICALP-2005-BraekenBNP #classification #encryption

Classification of Boolean Functions of 6 Variables or Less with Respect to Some Cryptographic Properties (AB, YLB, SN, BP), pp. 324–334.

FM-2005-Bosnacki #abstraction #calculus #on the #μ-calculus

On Some Galois Connection Based Abstractions for the μ-Calculus (DB), pp. 366–381.

ICEIS-v2-2005-NairC #image

A System to Interpret and Summarise some Patterns in Images (HN, IC), pp. 283–290.

SIGIR-2005-Chai #empirical

Expectation of f-measures: tractable exact computation and some empirical observations of its properties (KMAC), pp. 593–594.

ECMDA-FA-2005-MullerCCV #on the

On Some Properties of Parameterized Model Application (AM, OC, BC, GV), pp. 130–144.

RE-2005-SvetinovicBG #analysis #concept #identification #object-oriented #student #why

Concept Identification in Object-Oriented Domain Analysis: Why Some Students Just Don’t Get It (DS, DMB, MWG), pp. 189–198.

ICSE-2005-BasitRJ #case study

Beyond templates: a study of clones in the STL and some general implications (HAB, DCR, SJ), pp. 451–459.

ICSE-2005-Vliet #education #re-engineering

Some myths of software engineering education (HvV), pp. 621–622.

SAT-J-2004-PorschenS05 #bound #problem

Worst Case Bounds for Some NP-Complete Modified Horn-SAT Problems (SP, ES), pp. 251–262.

RTA-2005-Comon-LundhD #algebra #finite #how

The Finite Variant Property: How to Get Rid of Some Algebraic Properties (HCL, SD), pp. 294–307.

RTA-2005-LynchM #equation #performance

Faster Basic Syntactic Mutation with Sorts for Some Separable Equational Theories (CL, BM), pp. 90–104.

TestCom-2005-FlochRSV #empirical #lessons learnt #testing #using

Some Lessons from an Experiment Using TTCN-3 for the RIPng Testing (AF, FR, AS, CV), pp. 318–332.

DocEng-2004-Camacho-GuerreroMP #repository #web

A look at some issues during textual linking of homogeneous web repositories (JACG, AAM, MdGCP), pp. 74–83.

SCAM-2004-Gallagher #interprocedural #slicing

Some Notes on Interprocedural Program Slicing (KBG), pp. 36–42.

CIAA-2004-BordihnHK #context-free grammar #linear #problem

Some Non-semi-decidability Problems for Linear and Deterministic Context-Free Languages (HB, MH, MK), pp. 68–79.

DLT-2004-DowneyM #complexity

Some New Directions and Questions in Parameterized Complexity (RGD, CM), pp. 12–26.

ICALP-2004-DurrHHM #complexity #graph #problem #quantum #query

Quantum Query Complexity of Some Graph Problems (CD, MH, PH, MM), pp. 481–493.

ICALP-2004-MerkleMS #effectiveness

Some Results on Effective Randomness (WM, NM, TAS), pp. 983–995.

ICEIS-v2-2004-KooptiwootS #mining #set #using

Mining the Relationships in the Form of the Predisposing Factors and Coincident Factors Among Numerical Dynamic Attributes in Time Series Data Set by Using the Combination of Some Existing Techniques (SK, MAS), pp. 327–334.

ICEIS-v2-2004-KooptiwootS04a #idea #mining #set #using

Mining the Relationships in the Form of Predisposing Factor and Coincident Factor in Time Series Data Set by Using the Combination of some Existing Ideas with a new Idea from the Fact in the Chemical Reaction (SK, MAS), pp. 531–534.

ICEIS-v3-2004-LingsL #automation

Method-in-Action and Method-in-Tool: Some Implications for CASE (BL, BL), pp. 623–628.

CC-2004-JohnstoneSE #generalised parsing #parsing

Generalised Parsing: Some Costs (AJ, ES, GRE), pp. 89–103.

ICDAR-2003-LeedhamYTTM #algorithm #comparison #documentation #image #segmentation

Comparison of Some Thresholding Algorithms for Text/Background Segmentation in Difficult Document Images (GL, YC, KT, JHNT, LM), p. 859–?.

ICDAR-2003-SutantoLP #analysis #consistency #documentation

Study of the Consistency of Some Discriminatory Features Used by Document Examiners in the Analysis of Handwritten Letter “a” (PJS, GL, VP), pp. 1091–1095.

PODS-2003-Segoufin #bound #complexity #documentation #query #type system #xml

Typing and querying XML documents: some complexity bounds (LS), pp. 167–178.

CSEET-2003-WildeWKEK #case study #evolution #experience

Some Experiences with Evolution and Process-Focused Projects (NW, LJW, LBK, DDE, EAK), pp. 242–250.

ITiCSE-2003-ParkerBM #education #multi

Computer science and the arts: some multi-disciplinary teaching collaborations (JRP, KB, DM), p. 252.

CSMR-2003-EvancoV #architecture #maintenance

Some Optimal Object-Based Architectural Features for Corrective Maintenance (WME, JMV), pp. 281–280.

ICSM-2003-Beele

Some wells never dry (JJvB), p. 465.

STOC-2003-Ben-SassonHR

Some 3CNF properties are hard to test (EBS, PH, SR), pp. 345–354.

STOC-2003-RettingerW #complexity #set

The computational complexity of some julia sets (RR, KW), pp. 177–185.

CIAA-2003-XieLD #complexity #equation #linear #problem #using

New Complexity Results for Some Linear Counting Problems Using Minimal Solutions to Linear Diophantine Equations (GX, CL, ZD), pp. 163–175.

ICALP-2003-ChenKPSX #complexity #graph #problem

Genus Characterizes the Complexity of Graph Problems: Some Tight Results (JC, IAK, LP, ES, GX), pp. 845–856.

ICALP-2003-Fiat #network

Some Issues Regarding Search, Censorship, and Anonymity in Peer to Peer Networks (AF), p. 33.

AdaEurope-2003-EvancoV #ada #architecture #fault

Some Architectural Features of Ada Systems Affecting Defects (WME, JMV), pp. 232–245.

CIKM-2003-GloorLDZ #analysis #collaboration #communication #network #visualisation

Visualization of Communication Patterns in Collaborative Innovation Networks — Analysis of Some W3C Working Groups (PAG, RL, SBCD, YZ), pp. 56–60.

RE-2003-FuxmanLPRM #requirements #specification

Specifying and Analyzing Early Requirements: Some Experimental Results (AF, LL, MP, MR, JM), p. 105–?.

SAC-2003-HareJ #algorithm #problem #search-based

A Spanning Tree-Based Genetic Algorithm for Some Instances of the Rectilinear Steiner Problem with Obstacles (RMH, BAJ), pp. 725–729.

HPCA-2003-Kronstadt #challenge #design #performance

Beyond Performance: Some (Other) Challenges for Systems Design (EK), p. 125.

CSL-2003-MaksimovaV #calculus #complexity #problem

Complexity of Some Problems in Modal and Intuitionistic Calculi (LM, AV), pp. 397–412.

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-LuchettaMP #comparison #fault

Critical Comparison among Some Analog Fault Diagnosis Procedures Based on Symbolic Techniques (AL, SM, MCP), p. 1105.

ITiCSE-2002-Joyce

Group work at postgraduate level: some issues (DJ), p. 220.

CIAA-2002-Trahtman02a #testing

A Package TESTAS for Checking Some Kinds of Testability (ANT), pp. 228–232.

DLT-2002-DaleyK

Some Properties of Ciliate Bio-operations (MD, LK), pp. 116–127.

DLT-2002-DassowNR #complexity #on the

On the Descriptional Complexity of Some Variants of Lindenmayer Systems (JD, TYN, BR), pp. 128–139.

DLT-2002-Imreh #automaton

Some Remarks on Asynchronous Automata (BI), pp. 290–296.

ICEIS-2002-AlmeidaR #development

Some Reflections on IS Development as Operator of Organisational Change (AA, LR), pp. 543–552.

ICEIS-2002-Vellido #analysis #e-commerce #network

Neural Networks for B2C E-Commerce Analysis: Some Elements of Best Practice (AV), pp. 439–445.

ICPR-v2-2002-RothW #algorithm #matrix

Some Improvements on Two Autocalibration Algorithms Based on the Fundamental Matrix (GR, AW), p. 312–?.

ICPR-v3-2002-Bourlard #pattern matching #pattern recognition #recognition #speech #statistics

Some Recent Advances in Speech Recognition with Potential Applications in Other Statistical Pattern Recognition Areas (HB), p. 727.

KR-2002-KoniecznyLM #complexity #distance #framework

Distance Based Merging: A General Framework and some Complexity Results (SK, JL, PM), pp. 97–108.

LICS-2002-IshiharaKR #automation

Some Results on Automatic Structures (HI, BK, SR), p. 235–?.

RTA-2002-RetyV #set

Regular Sets of Descendants by Some Rewrite Strategies (PR, JV), pp. 129–143.

CSEET-2001-Cowling01a #algorithm #data type #education #experience #java #re-engineering

Teaching Data Structures and Algorithms in a Software Engineering Degree: Some Experience with Java (AJC), pp. 247–257.

STOC-2001-Yao #complexity

Some perspective on computational complexity (abstract) (ACCY), p. 600.

DLT-2001-ItoK #petri net

Some Petri Net Languages and Codes (MI, YK), pp. 69–80.

DLT-2001-NiemannW01a #regular expression

Some Regular Languages That Are Church-Rosser Congruential (GN, JW), pp. 330–339.

ICML-2001-Jiang #aspect-oriented #semistructured data

Some Theoretical Aspects of Boosting in the Presence of Noisy Data (WJ), pp. 234–241.

ICML-2001-NairCK #algorithm

Some Greedy Algorithms for Sparse Nonlinear Regression (PBN, AC, AJK), pp. 369–376.

ICML-2001-Zhang #approximate #bound #problem

Some Sparse Approximation Bounds for Regression Problems (TZ0), pp. 624–631.

ICLP-2001-Gupta #named

X-tegration — Some Cross-Enterprise Thoughts (AG), p. 6.

ITiCSE-2000-HaganM #experience #programming #question

Does it help to have some programming experience before beginning a computing degree program? (DH, SM), pp. 25–28.

IWPC-2000-BratthallW #architecture #aspect-oriented #comprehension #design #modelling #quality

Understanding Some Software Quality Aspects from Architecture and Design Models (LB, CW), pp. 27–34.

PEPM-2000-Das #case study #experience #scalability #source code #static analysis

Static Analysis of Large Programs: Some Experiences (Abstract of Invited Talk) (MD), p. 1.

ICALP-2000-BolligW #bound #problem

Asymptotically Optimal Bounds for OBDDs and the Solution of Some Basic OBDD Problems (BB, IW), pp. 187–198.

WLC-2000-Dassow #difference #generative #on the

On the Differentiation Function of some Language Generating Devices (JD), pp. 151–161.

WLC-2000-Machida

Some Properties of Hyperoperations and Hyperclones (HM), pp. 286–296.

CHI-2000-CheverstDMFE #case study #experience

Developing a context-aware electronic tourist guide: some issues and experiences (KC, ND, KM, AF, CE), pp. 17–24.

ICPR-v4-2000-JiangBMHSIBGLB #algorithm #case study #comparison #image #segmentation

Some Further Results of Experimental Comparison of Range Image Segmentation Algorithms (XJ, KWB, YM, SH, KS, SI, MB, CG, REL, JMHdB), pp. 4877–4882.

ICPR-v4-2000-RahmanF #comparison #multi #performance

Comparison of Some Multiple Expert Strategies: An Investigation of Resource Prerequisites and Achievable Performance (AFRR, MCF), pp. 4841–4844.

TOOLS-USA-2000-VaziriJ #constraints #ocl #uml

Some Shortcomings of OCL, the Object Constraint Language of UML (MV, DJ), pp. 555–562.

SAC-2000-RudraG #adaptation #clustering #problem

Adaptive Use of a Cluster of PCs for Data Warehousing Applications: Some Problems and Issues (AR, RPG), pp. 698–703.

CL-2000-Janhunen #logic programming #source code #strict

Comparing the Expressive Powers of Some Syntactically Restricted Classes of Logic Programs (TJ), pp. 852–866.

LICS-2000-BergmanS #algebra #complexity #problem

Computational Complexity of Some Problems Involving Congruences on Algebras (CB, GS), pp. 168–174.

LICS-2000-McMillan #model checking #proving #theorem

Some Strategies for Proving Theorems with a Model Checker (KLM), pp. 305–306.

WICSA-1999-BorrmannP #architecture #challenge #roadmap

Software Architecture at Siemens: The challenges, our approaches, and some open issues (LB, FNP), pp. 529–544.

ASE-1999-Biggerstaff #problem

Fixing Some Transformation Problems (TJB), pp. 148–157.

TACAS-1999-Stevens #re-engineering #tool support #verification

Some Issues in the Software Engineering of Verification Tools (PS), pp. 435–438.

DLT-1999-CarpiLV

Special factors in some combinational structures (AC, AdL, SV), pp. 3–13.

ICALP-1999-BermanK #on the

On Some Tighter Inapproximability Results (Extended Abstract) (PB, MK), pp. 200–209.

HCI-CCAD-1999-Keenan #concept

Systems of intellectual capital in collectivities from work organizations to human settlements: Some conceptualizations (JJK), pp. 397–401.

HCI-EI-1999-PeninouSK #adaptation #design #interactive #multi #research

Multi-Agent Systems for adaptive Multi-User Interactive System Design: Some Issues of Research (AP, EGLS, CK), pp. 326–330.

ACIR-1999-Helderman #challenge #information management #information retrieval

Knowledge Management and Information Retrieval: Some New Challenges (LMH).

ICML-1999-GiordanaP #behaviour #on the

On Some Misbehaviour of Back-Propagation with Non-Normalized RBFNs and a Solution (AG, RP), pp. 162–170.

CADE-1999-Sofronie-Stokkermans #complexity #decidability #on the

On the Universal Theory of Varieties of Distributive Lattices with Operators: Some Decidability and Complexity Results (VSS), pp. 157–171.

ICLP-1999-LauO #logic programming #modelling #source code

Isoinitial Models for Logic Programs: Some Preliminary Results (KKL, MO), p. 611.

LICS-1999-BucciarelliLPS

Some Computational Properties of Intersection Types (AB, SDL, AP, IS), pp. 109–118.

LICS-1999-Friedman #complexity #problem

Some Decision Problems of Enormous Complexity (HF), pp. 2–12.

ITiCSE-1998-AbernethyGT #case study #experience

Inquiry-based computer science instruction: some initial experiences (KA, PG, KT), pp. 14–17.

FASE-1998-Jones #what

Some Mistakes I Have and What I Have Learned from Them (CBJ), pp. 7–20.

CSMR-1998-Kutscha #case study #experience #re-engineering

The Task Artifact Cycle: Some Experiences from Reengineering Practice (SK), p. 234.

ICSM-1998-Munson #metric #process

Some Comments on the Software Measurement Process (JCM), p. 71.

TAGT-1998-Drewes #generative #power of

Some Remarks on the Generative Power of Collage Grammars and Chain-Code Grammars (FD), pp. 1–14.

CHI-1998-Rocco #trust

Trust Breaks Down in Electronic Contexts But Can Be Repaired by Some Initial Face-to-Face Contact (ER), pp. 496–502.

ACIR-1998-Kluck #database #retrieval #testing

German Indexing and Retrieval Test Data Base (GIRT) — Some Results of the Pre-test (MK).

ICPR-1998-HoffmanL #algorithm #geometry #trade-off

Some trade-offs and a new algorithm for geometric hashing (MH, ML), pp. 1700–1704.

ICPR-1998-XiaoYM

Some general grouping principles: line perception from points as an example (JX, ZY, SM), pp. 1825–1827.

UML-1998-HitzK #uml

Developing with UML — Some Pitfalls and Workarounds (MH, GK), pp. 9–20.

ICSE-1998-BoehmE #lessons learnt #requirements

Software Requirements Negotiation: Some Lessons Learned (BWB, AE), pp. 503–506.

CSL-1998-Egly

Quantifers and the System KE: Some Surprising Results (UE), pp. 90–104.

JICSLP-1998-DecorteS #analysis #termination

Termination Analysis: Some Practical Properties of the Norm and Level Mapping Space (SD, DDS), pp. 235–249.

RTA-1998-LimetR #equation #term rewriting

Solving Disequations Modulo Some Class of Rewrite Systems (SL, PR), pp. 121–135.

STOC-1997-Hastad

Some Optimal Inapproximability Results (JH), pp. 1–10.

DLT-1997-Dassow

Some Remarks on Extended Reular Languages (JD), pp. 477–488.

ICALP-1997-Bournez #bound #constant #power of

Some Bounds on the Computational Power of Piecewise Constant Derivative Systems (Extended Abstract) (OB), pp. 143–153.

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-Marcus97a #design #interface #standard

International User-Interface Standards for Information Superhighways: Some Design Issues (AM), pp. 189–192.

HCI-CC-1997-SoongB #visual notation

Some Experimental Suggestions to Assist the Visually Handicapped End-Users to Navigate the Information Space (NLS, GB), pp. 433–436.

HCI-SEC-1997-Duffy97a #safety

Safety Management: Some Issues and Limitations (VGD), pp. 343–346.

HCI-SEC-1997-PadovaniM #evaluation #hypermedia

Ergonomic Evaluation of Some Brazilian Hypertext Systems (SP, AdM), pp. 613–616.

RE-1997-Harel

Will I Be Pretty, Will I Be Rich? Some Thoughts on Theory vs. Practice in Systems Engineering (DH), p. 184–?.

CADE-1997-Egly #how

Some Pitfalls of LK-to-LJ Translations and How to Avoid Them (UE), pp. 116–130.

CAV-1997-BozgaMPY #automaton #verification

Some Progress in the Symbolic Verification of Timed Automata (MB, OM, AP, SY), pp. 179–190.

CAV-1997-Harel #years after

Some Thoughts on Statecharts, 13 Years Later (DH), pp. 226–231.

ITiCSE-1996-BrodlieWW #learning #novel #visualisation

Scientific visualization — some novel approaches to learning (KB, JDW, HW), pp. 28–32.

ESOP-1996-Jones #problem #semantics

Some Practical Problems and Their Influence on Semantics (CBJ), pp. 1–17.

TACAS-1996-FocardiG #automation #composition #security #verification

Automatic Compositional Verification of Some Security Properties (RF, RG), pp. 167–186.

WCRE-1996-WoodsQ #algorithm #comprehension #how #recognition #towards

Some Experiments Toward Understanding How Program Plan Recognition Algorithms Scale (SW, AQ), pp. 21–30.

AdaEurope-1996-Bondeli #ada #object-oriented #programming

An Ada 95 View of Some Difficult or Controversial Points in Object-Oriented Programming (PdB), pp. 370–384.

AdaEurope-1996-ChenY #on the #problem #testing

On Some Characterisation Problems of Subdomain Testing (TYC, YTY), pp. 147–158.

ICML-1996-PendrithR #difference #learning

Actual Return Reinforcement Learning versus Temporal Differences: Some Theoretical and Experimental Results (MDP, MRKR), pp. 373–381.

ICPR-1996-StockerSVSK #image #network

Stability study of some neural networks applied to tissue characterization of brain magnetic resonance images (ADS, OS, AV, OS, TK), pp. 472–476.

SIGIR-1996-NowellFHHF #similarity #visualisation

Visualizing Search Results: Some Alternatives to Query-Document Similarity (LTN, RKF, DH, LSH, EAF), pp. 67–75.

CADE-1996-Fernmuller #semantics

Semantic Trees Revisited: Some New Completeness Results (CGF), pp. 568–582.

DLT-1995-Georgescu #complexity #context-free grammar #metric #orthogonal

The Orthogonality of Some Complexity Measures of Context-Free Languages (GG), pp. 73–78.

DLT-1995-Stiebe

Some New Decision Results for Edge Grammars (RS), pp. 329–338.

CAiSE-1995-SiauWB #concept

A Psychological Study on the Use of Relationship Concept — Some Preliminary Findings (KS, YW, IB), pp. 341–354.

RTA-1995-Matiyasevich #logic #on the

On Some Mathematical Logic Contributions to Rewriting Techniques: Lost Heritage (Abstract) (YM), p. 1.

RTA-1995-OttoND #equation #independence #unification

Some Independent Results for Equational Unification (FO, PN, DJD), pp. 367–381.

RTA-1995-Paccanaro #network #reduction

Guiding Term Reduction Through a Neural Network: Some Prelimanary Results for the Group Theory (AP), pp. 444–449.

EDAC-1994-Koudakou #component #implementation #optimisation #statistics

Software Implementation and Statistical Optimization of Some Electronic Component’s Lifetime (KCK), p. 663.

PODS-1994-Harel #summary

Will I be Pretty, Will I be Rich? Some Thoughts on Theory vs. Practice in Systems Engineering (Summary) (DH), pp. 1–3.

SIGMOD-1994-WangCMSSZ #combinator

Combinatorial Pattern Discovery for Scientific Data: Some Preliminary Results (JTLW, GWC, TGM, BAS, DS, KZ), pp. 115–125.

VLDB-1994-MohaniaS #database #deduction #design #distributed

Some Issues in Design of Distributed Deductive Databases (MKM, NLS), pp. 60–71.

ICALP-1994-AsarinM #on the

On some Relations between Dynamical Systems and Transition Systems (EA, OM), pp. 59–72.

ICALP-1994-Pudlak #bound #communication #complexity #game studies

Unexpected Upper Bounds on the Complexity of Some Communication Games (PP), pp. 1–10.

SIGIR-1994-RobertsonW #approximate #effectiveness #probability #retrieval

Some Simple Effective Approximations to the 2-Poisson Model for Probabilistic Weighted Retrieval (SER, SW), pp. 232–241.

CADE-1994-ClarkeZ #problem #proving #symbolic computation #theorem proving

Combining Symbolic Computation and Theorem Proving: Some Problems of Ramanujan (EMC, XZ), pp. 758–763.

ICLP-1994-ProiettiP #logic

Completeness of Some Transformation Strategies for Avoiding Unnecessary Logical Variables (MP, AP), pp. 714–729.

ILPS-1994-Malfon #logic programming #semantics #source code #validation

Characterization of Some Semantics for Logic Programs with Negation and Applications to Program Validation (BM), pp. 91–105.

ICDAR-1993-BackmutskyZ #detection #fault

Some ergonomic improvements of text error detection and prevention in DTP-systems (VB, VZ), pp. 947–950.

STOC-1993-ChouK #2d #complexity

Some complexity issues on the simply connected regions of the two-dimensional plane (AWC, KIK), pp. 1–10.

STOC-1993-Karp #biology #combinator #problem

Mapping the genome: some combinatorial problems arising in molecular biology (RMK), pp. 278–285.

FME-1993-OwreRSH #architecture #fault tolerance #lessons learnt #verification

Formal Verification for Fault-Tolerant Architectures: Some Lessons Learned (SO, JMR, NS, FWvH), pp. 482–500.

FPCA-1993-GrantSWZ #algorithm #finite #functional #implementation

Some Issues in a Functional Implementation of a Finite Element Algorithm (PWG, JAS, MFW, XZ), pp. 12–17.

FPCA-1993-Sparud #garbage collection

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

HCI-ACS-1993-Badham #design #implementation

Implementing Smart Manufacturing: Some Techniques for Designer/User Cooperation (RJB), pp. 62–67.

HCI-SHI-1993-WatersonO #multi #using

Using Animated Demonstrations in Multimedia Applications: Some Suggestions Based upon Experimental Evidence (PEW, CO), pp. 543–548.

LOPSTR-1993-BoeckC #logic #prolog

Mechanical Transformation of Logic Definitions Augmented with Type Information into Prolog Procedures: Some Experiments (PDB, BLC), pp. 229–245.

LOPSTR-1993-MartensS #finite

Some Further Issues in Finite Unfolding (Abstract) (BM, DDS), pp. 159–161.

ICLP-1993-CarroGH #execution #logic programming #paradigm #parallel #source code #visualisation

Some Paradigms for Visualizing Parallel Execution of Logic Programs (MC, LMGH, MVH), pp. 184–200.

RTA-1993-Adian #algorithm #monad #on the #problem

On some Algorithmic Problems for Groups and Monoids (SIA), pp. 289–300.

RTA-1993-Dougherty #λ-calculus

Some λ Calculi with Categorial Sums and Products (DJD), pp. 137–151.

RTA-1993-Senizergues #decidability #problem #termination

Some Undecidable Termination Problems for Semi-Thue Systems (Abstract) (GS), p. 434.

CHI-1992-Brown #algorithm #parallel #sorting #visualisation

An Introduction to Zeus: Audiovisualization of Some Elementary Sequential and Parallel Sorting Algorithms (MHB), pp. 663–664.

KR-1992-Davis #finite #infinity

Infinite Loops in Finite Time: Some Observations (ED), pp. 47–58.

SIGIR-1992-Keen #ranking

Term Position Ranking: Some New Test Results (EMK), pp. 66–76.

TOOLS-PACIFIC-1992-DebrayH #c++ #simulation

Some Classes for Object-Based Simulation in C++ (TD, JBH), pp. 143–152.

TOOLS-PACIFIC-1992-Henderson-Sellers #metric #re-engineering

Some Metrics for Objected-Oriented Software Engineering (BHS), pp. 131–139.

TOOLS-USA-1992-RajaramanL #c++ #metric #source code

Some Coupling Measures for C++ Programs (CR, MRL), pp. 225–234.

CADE-1992-Christian #termination

Some Termination Criteria for Narrowing and E-Narrowing (JC), pp. 582–588.

DAC-1991-JainMSW #empirical #evaluation #heuristic #scheduling #synthesis

Empirical Evaluation of Some High-Level Synthesis Scheduling Heuristics (RJ, AM, AS, HW), pp. 686–689.

HT-1991-Wright

Cognitive Overheads and Prostheses: Some Issues in Evaluating Hypertexts (PW), pp. 1–12.

ICALP-1991-Comon #algebra #axiom

Complete Axiomatizations of Some Quotient Term Algebras (HC), pp. 469–480.

CHI-1991-MulliganAS #design #user interface

User interface design in the trenches: some tips on shooting from the hip (RMM, MWA, DKS), pp. 232–236.

CSL-1991-HeuschS #aspect-oriented #behaviour #probability

Some Aspects of the Probabilistic Behavior of Variants of Resolution (PH, ES), pp. 164–172.

ISLP-1991-JorgensenMM #optimisation

Some Global Compile-Time Optimizations for CLP(R) (NJ, KM, SM), pp. 420–434.

LICS-1991-MalacariaR #algebra #λ-calculus

Some Results on the Interpretation of λ-calculus in Operator Algebras (PM, LR), pp. 63–72.

DAC-1990-SaabR #effectiveness #evolution #heuristic #layout #performance #probability #problem

Stochastic Evolution: a Fast Effective Heuristic for Some Generic Layout Problems (YS, VBR), pp. 26–31.

GG-1990-Kennaway #category theory #graph grammar #morphism

Graph Rewriting in Some Categories of Partial Morphisms (RK), pp. 490–504.

CSCW-1990-BensonCP #social

Some Social and Economic Consequences of Groupware for Flight Crew (IB, CC, SP), pp. 119–129.

CAiSE-1990-Suomi #case study #development #experience #tool support

Selecting System Development Tools: Some Experiences (RS), pp. 61–78.

ICSE-1990-Pilaud #case study #development #experience

Some Experiences of Critical Software Development (EP), pp. 225–226.

CADE-1990-NarendranO #equation #unification

Some Results on Equational Unification (PN, FO), pp. 276–291.

CSL-1990-Fermuller #set

A Resolution Variant Deciding some Classes of Clause Sets (CGF), pp. 128–144.

CSL-1990-Ranaivoson #bound #graph #problem

Nontrivial Lower Bounds for some NP-Problems on Directed Graphs (SR), pp. 318–339.

CHI-1989-Hill #how

How some advice fails (WCH), pp. 85–90.

CHI-1989-LangeM #object-oriented #programming #reuse

Some strategies of reuse in an object-oriented programming environment (BML, TGM), pp. 69–73.

CAiSE-1989-Kingsbury #development #problem

Systems Development: Basic Flaws in the Current Culture — Ideas for Rectifying Some of the Problems (MAK).

KR-1989-BylanderATJ #abduction #complexity

Some Results Concerning the Computational Complexity of Abduction (TB, DA, MCT, JRJ), pp. 44–54.

ML-1989-Valtorta #complexity #knowledge-based #refinement

Some Results on the Complexity of Knowledge-Based Refinement (MV), pp. 326–331.

CSL-1989-Gradel #complexity #concept #logic #on the

On Logical Descriptions of Some Concepts in Structural Complexity Theory (EG), pp. 163–175.

LICS-1989-Stolboushkin #bound #complexity #logic

Some Complexity Bounds for Dynamic Logics (APS), pp. 324–332.

NACLP-1989-BugliesiR #partial evaluation #prolog

Partial Evaluation in Prolog: Some Improvements about Cut (MB, FR), pp. 645–660.

TAV-1989-JengW #testing

Some Observations on Partition Testing (BJ, EJW), pp. 38–47.

STOC-1988-Canny #algebra #geometry

Some Algebraic and Geometric Computations in PSPACE (JFC), pp. 460–467.

ICALP-1988-Thiagarajan #aspect-oriented #behaviour

Some Behavioural Aspects of Net Theory (PST), pp. 630–653.

ML-1988-TambeN

Some Chunks Are Expensive (MT, AN), pp. 451–458.

ML-1988-WisniewskiA #induction #learning

Some Interesting Properties of a Connectionist Inductive Learning System (EJW, JAA), pp. 181–187.

SIGIR-1988-TagueS #evaluation #information retrieval #metric #user interface

Some Measures and Procedures for Evaluation of the User Interface in an Information Retrieval System (JT, RS), pp. 371–385.

CADE-1988-PotterP #term rewriting

Term Rewriting: Some Experimental Results (RCP, DAP), pp. 435–453.

CADE-1988-TourCC #tool support

Some Tools for an Inference Laboratory (ATINF) (TBdlT, RC, GC), pp. 744–745.

JICSCP-1988-Abramson88 #approach #aspect-oriented #definite clause grammar #metaprogramming

Metarules and an Approach to Conjunction in Definite Clause Translation Grammars: Some Aspects of Grammatical Metaprogramming (HA), pp. 233–248.

JICSCP-1988-AlshawiM88 #delphi

The Delphi Model and Some Preliminary Experiments (HA, DBM), pp. 1578–1589.

JICSCP-1988-Kunen88 #database

Some Remarks on the Completed Database (KK), pp. 978–992.

STOC-1987-Allender #generative #pseudo

Some Consequences of the Existence of Pseudorandom Generators (EA), pp. 151–159.

STOC-1987-Bach #algorithm #analysis #random

Realistic Analysis of Some Randomized Algorithms (EB), pp. 453–461.

HCI-CE-1987-HoyosGSZ #agile #approach #bibliography #empirical #prototype

Software-Design with the Rapid Prototyping Approach: A Survey and Some Empirical Results (CGH, HG, VS, BZ), pp. 329–340.

HCI-SES-1987-Dainoff #design

Some Issues Related to Seated Posture and Workstation Design (MJD), pp. 165–172.

HCI-SES-1987-Sanders #problem

Problems of a Novice: Some Introspective Observations (AFS), pp. 219–230.

SIGIR-1987-Borgman #difference #information retrieval

Individual Differences in the Use of Information Retrieval Systems: Some Issues and Some Data (CLB), pp. 61–71.

SIGIR-1987-FuhrM #probability

Probabilistic Search Term Weighting-Some Negative Results (NF, PM), pp. 13–18.

SIGIR-1987-Kwok #approximate #query

Some Considerations for Approximate Optimal Queries (KLK), pp. 19–23.

ECOOP-1987-DucournauH #algorithm #inheritance #multi #object-oriented #on the #programming

On Some Algorithms for Multiple Inheritance in Object-Oriented Programming (RD, MH), pp. 243–252.

OOPSLA-1987-Bezivin #object-oriented #simulation

Some Experiments In Object-Oriented Simulation (JB), pp. 394–405.

CSL-1987-Spreen #nondeterminism #on the #polynomial

On Functions Computable in Nondeterministic Polynomial Time: Some Characterizations (DS), pp. 289–303.

ICLP-1987-HeintzeMS87 #problem

CLP(R) and Some Electrical Engineering Problems (NH, SM, PJS), pp. 675–703.

LICS-1987-FreydS #aspect-oriented #polymorphism #semantics #λ-calculus

Some Semantic Aspects of Polymorphic λ Calculus (PJF, AS), pp. 315–319.

LICS-1987-Milner #fixpoint

Some Uses of Maximal Fixed Points (Abstract of Invited Lecture) (RM), p. 3.

RTA-1987-Otto #confluence #congruence

Some Results about Confluence on a Given Congruence Class (FO), pp. 145–155.

PODS-1986-GuchtF #multi #relational

Some Classes of Multilevel Relational Structures (DVG, PCF), pp. 60–69.

ICALP-1986-Brandenburg #product line

Intersections of Some Families of Languages (FJB), pp. 60–68.

ICALP-1986-KirschenhoferP

Some Further Results on Digital Search Trees (PK, HP), pp. 177–185.

ICALP-1986-Wagner

More Complicated Questions About Maxima and Minima, and Some Closures of NP (KWW), pp. 434–443.

CADE-1986-Burckert #strict #unification

Some Relationships between Unification, restricted Unification, and Matching (HJB), pp. 514–524.

CADE-1986-Jager #analysis #logic

Some Contributions to the Logical Analysis of Circumscrition (GJ), pp. 154–171.

ICLP-1986-JaffarLM86 #logic programming #roadmap #semantics

Invited Talk: Some Issues and Trends in the Semantics of Logic Programming (JJ, JLL, MJM), pp. 223–241.

SLP-1986-Bledsoe86 #proving

Some Thoughts on Proof Discovery (WWB), pp. 2–10.

SIGMOD-1985-Faloutsos #comparison #design #performance

Signature files: Design and Performance Comparison of Some Signature Extraction Methods (CF), pp. 63–82.

VLDB-1985-Ioannidis #bound #recursion

A Time Bound on the Materialization of some Recursively Defined Views (YEI), pp. 219–226.

VLDB-1985-LuC #algorithm #distributed #network

Some Experimental Results on Distributed Join Algorithms in a Local Network (HL, MJC), pp. 292–304.

STOC-1985-FriedlR #algebra #polynomial #problem

Polynomial Time Solutions of Some Problems in Computational Algebra (KF, LR), pp. 153–162.

SIGIR-1985-Stubbs #taxonomy

The New English Oxford English Dictionary and its Potential Users: Some Preliminary Comments (JOS), pp. 78–81.

DAC-1984-ZhangW #database #geometry

Some consideration on the data model of geometric data bases (JZ, RW), pp. 629–633.

STOC-1984-BentleyJLMM #behaviour

Some Unexpected Expected Behavior Results for Bin Packing (JLB, DSJ, FTL, CCM, LAM), pp. 279–288.

STOC-1984-KannanLL #algebra #polynomial

Polynomial Factorization and Nonrandomness of Bits of Algebraic and Some Transcendental Numbers (RK, AKL, LL), pp. 191–200.

ICALP-1984-Ferment #matrix #product line

Principality Results About Some Matrix Languages Families (DF), pp. 151–161.

ICALP-1984-Girault-Beauquier #automaton #behaviour #finite #infinity

Some Results About Finite and Infinite Behaviours of a Pushdown Automaton (DB), pp. 187–195.

ICALP-1984-IbarraKR #performance #simulation #strict

Space and Time Efficient Simulations and Characterizations of Some Restricted Classes of PDAs (OHI, SMK, LER), pp. 247–259.

LFP-1984-StoyeCN #agile #combinator #reduction

Some Practical Methods for Rapid Combinator Reduction (WRS, TJWC, ACN), pp. 159–166.

SIGIR-1984-Zarri #information retrieval

Some Remarks About the Inference Techniques of RESEDA, an “Intelligent” Information Retrieval System (GPZ), pp. 281–300.

DAC-1983-NattrassO #design

Some Computer Aided Engineering System design principles (HLN, GKO), pp. 571–577.

STOC-1983-Young #polynomial #set

Some Structural Properties of Polynomial Reducibilities and Sets in NP (PY), pp. 392–401.

SIGIR-1983-Salton #automation #information retrieval #problem #research

Some Research Problems in Automatic Information Retrieval (GS), pp. 252–263.

VLDB-1982-Shoshani #database #problem #statistics

Statistical Databases: Characteristics, Problems, and some Solutions (AS), pp. 208–222.

STOC-1982-PapadimitriouY #complexity

The Complexity of Facets (and Some Facets of Complexity) (CHP, MY), pp. 255–260.

ICALP-1982-FernandezT

Some Properties of D-Continuous Causal Nets (CF, PST), pp. 225–238.

ASPLOS-1982-Johnson #architecture #debugging #requirements

Some Requirements for Architectural Support of Software Debugging (MSJ), pp. 140–148.

DAC-1981-WallaceH #probability

Some properties of a probabilistic model for global wiring (DW, LH), pp. 660–667.

ICALP-1981-Schnorr #algorithm #analysis

Refined Analysis and Improvements on Some Factoring Algorithms (CPS), pp. 1–15.

SIGMOD-1980-ChangLD

Some Properties of Cartesian Product Files (CCC, RCTL, DHCD), pp. 157–168.

VLDB-1980-Gotlieb #database #scalability

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

VLDB-1980-MylopoulosW

Some Features of the TAXIS Data Model (JM, HKTW), pp. 399–410.

VLDB-1980-Nambiar #database #design #relational #tool support

Some Analytic Tools for the Design of Relational Database Systems (KKN), pp. 417–428.

STOC-1980-Hong #complexity #on the #problem

On Some Deterministic Space Complexity Problems (JWH), pp. 310–317.

STOC-1980-JaJa #algebra #problem #trade-off

Time-Space Tradeoffs for some Algebraic Problems (JJ), pp. 339–350.

STOC-1980-KarpL #complexity

Some Connections between Nonuniform and Uniform Complexity Classes (RMK, RJL), pp. 302–309.

STOC-1980-Ukkonen #automaton #equivalence #realtime

A Decision Method for the Equivalence of some Non-Real-Time Deterministic Pushdown Automata (EU), pp. 29–38.

ICALP-1980-LucaR #on the #testing

On Some Properties of Local Testability (AdL, AR), pp. 385–393.

CADE-1980-FerroOS #set

Decision Procedures for Some Fragments of Set Theory (AF, EGO, JTS), pp. 88–96.

DAC-1979-Hoskins #database #design

Descriptive databases in some design/manufacturing environments (EMH), pp. 421–436.

VLDB-1979-GhoshCMW #database #scalability

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

STOC-1979-DeMilloL #complexity #logic

Some Connections between Mathematical Logic and Complexity Theory (RAD, RJL), pp. 153–159.

STOC-1979-Kosaraju79a #algorithm #array #graph #parallel #performance #problem

Fast Parallel Processing Array Algorithms for some Graph Problems (Preliminary Version) (SRK), pp. 231–236.

STOC-1979-Yao #complexity

Some Complexity Questions Related to Distributive Computing (Preliminary Report) (ACCY), pp. 209–213.

ICALP-1979-CoppoDS #functional #semantics #λ-calculus

Functional Characterization of Some Semantic Equalities inside λ-Calculus (MC, MDC, PS), pp. 133–146.

ICALP-1979-Istrail #fixpoint #monad #recursion #semantics #source code #theorem

A Fixed-Point Theorem for Recursive-Enumerable Languages and Some Considerations About Fixed-Point Semantics of Monadic Programs (SI), pp. 289–303.

SIGIR-1979-Croft #documentation #implementation #modelling #on the #retrieval

On the Implementation of Some Models of Document Retrieval (WBC), pp. 71–77.

ICSE-1979-FeuerF #empirical

Some Results from an Empirical Study of Computer Software (ARF, EBF), pp. 351–355.

DAC-1978-DavidV #concept #design #named

SIGMA-CAD: Some new concepts in design of general purpose CAD systems (BTD, GV), pp. 321–325.

SIGMOD-1978-NationsS #program analysis #sequence

Some DML Instruction Sequences for Application Program Analysis and Conversion (JN, SYWS), pp. 120–131.

VLDB-1978-Nicolas #dependence

Mutual Dependencies and Some Results on Undecomposable Relations (JMN), pp. 360–367.

ICALP-1978-Mignotte #effectiveness #linear #recursion #sequence

Some Effective Results About Linear Recursive Sequences (MM), pp. 322–329.

ICALP-1978-Restivo #monad #set

Some Decision Results for Recognizable Sets in Arbitrary Monoids (AR), pp. 363–371.

ICSE-1978-Stern #experience

Some Experience in Building Portable Software (MS), pp. 327–332.

DAC-1977-AgarwalB #algorithm #aspect-oriented

Some theoretical aspects of algorithmic routing (PA, MAB), pp. 23–31.

SIGMOD-1977-Schmidt

Some High-level Language Constructs for Data of Type Relation (Abstract) (JWS), p. 9.

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

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

ICALP-1977-Alton #complexity #memory management #metric

“Natural” Complexity Measures and Time versus Memory: Some Definitional Proposals (DAA), pp. 16–29.

ICALP-1977-BertoniMT #automaton #probability #problem #recursion

Some Recursive Unsolvable Problems Relating to Isolated Cutpoints in Probabilistic Automata (AB, GM, MT), pp. 87–94.

ICALP-1977-ItaiR #problem

Some Matching Problems (AI, MR), pp. 258–268.

ICALP-1977-JonesS #complexity #problem

Complexity of Some Problems Concerning L Systems (NDJ, SS), pp. 301–308.

DAC-1976-HananSA

Some experimental results on placement techniques (MH, PKWS, BJA), pp. 214–224.

STOC-1976-GareyGJ #geometry #problem

Some NP-Complete Geometric Problems (MRG, RLG, DSJ), pp. 10–22.

STOC-1976-IbarraK #problem

A Useful Device for Showing the Solvability of Some Decision Problems (OHI, CEK), pp. 135–140.

STOC-1976-PapadimitriouS #complexity #problem

Some Complexity Results for the Traveling Salesman Problem (CHP, KS), pp. 1–9.

DIPL-1976-Brosgol #data type #type checking

Some issues in data types and type checking (BMB), pp. 102–130.

POPL-1976-JonesM #design #optimisation #programming language #towards

Binding Time Optimization in Programming Languages: Some Thoughts Toward the Design of an Ideal Language (NDJ, SSM), pp. 77–94.

ICSE-1976-BasuM #source code

Some Classes of Naturally Provable Programs (SKB, JM), pp. 400–406.

ICSE-1976-Miyamoto #database #programming

Some Considerations in Database Application Programming (IM), pp. 545–555.

SOSP-1975-AkkoyunluEH #constraints #design #network #trade-off

Some Constraints and Tradeoffs in the Design of Network Communications (EAA, KE, RVH), pp. 67–74.

STOC-1974-DobkinL #on the

On Some Generalizations of Binary Search (DPD, RJL), pp. 310–316.

STOC-1974-GareyJS #problem

Some Simplified NP-Complete Problems (MRG, DSJ, LJS), pp. 47–63.

STOC-1974-Greibach #strict

Some Restrictions on W-Grammars (SAG), pp. 256–265.

ICALP-1974-EhrenfeuchtR #morphism #term rewriting #trade-off

Trade-off between the Use of Nonterminals, Codings and Homomorphisms in Defining Languages for Some Classes of Rewriting Systems (AE, GR), pp. 473–480.

DAC-1973-Freitag

Some things that did not happen in software DA (HF), p. 61.

SIGFIDET-1972-McGee #roadmap

Some Current Issues in Data Description (WCM), pp. 1–12.

ICALP-1972-Vilfan #theorem

A Generalization of a Theorem of Specker and Some Applications (BV), pp. 609–622.

ICALP-1972-Zalcstein

Syntactic Semigroups of Some Classes of Star-Free Languages (YZ), pp. 135–144.

DAC-1971-Schnarsky

Some computer-aided approaches to housing (AS), pp. 57–67.

STOC-1971-LevyJ #automaton

Some Results in Tree Automata (LSL, AKJ), pp. 78–85.

STOC-1971-Munro #algorithm #performance

Some Results Concerning Efficient and Optimal Algorithms (JIM), pp. 40–44.

SOSP-1971-Holt #concurrent

Some Deadlock Properties of Computer Systems (RCH), pp. 64–71.

STOC-1970-Nivat #on the #product line

On Some Families of Languages Related to the Dyck Language (MN), pp. 221–225.

STOC-1970-Rounds #proving #theorem

Tree-Oriented Proofs of Some Theorems on Context-Free and Indexed Languages (WCR), pp. 109–116.

DAC-1969-Dov #research #simulation

Misuse and limitations of simulation as a business research technique: Some comments (AGBD), pp. 323–331.

STOC-1969-Fischer #precedence

Some Properties of Precedence Languages (MJF), pp. 181–190.

STOC-1969-Zeiger #formal method #modelling #programming language

Formal Models for Some Features of Programming Languages (HPZ), pp. 211–215.