BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Used together with:
use (9)
method (7)
program (6)
process (6)
algorithm (5)

Stem obtain$ (all stems)

59 papers:

CHICHI-2015-MitraHG #quality
Comparing Person- and Process-centric Strategies for Obtaining Quality Data on Amazon Mechanical Turk (TM, CJH, EG), pp. 1345–1354.
CIAACIAA-2014-Roche-LimaDF #automaton #kernel
Pairwise Rational Kernels Obtained by Automaton Operations (ARL, MD, BF), pp. 332–345.
ICDARICDAR-2013-ZaraiLDW
Integrating Copies Obtained from Old and New Preservation Efforts (YZ, TL, ND, LW), pp. 47–51.
HCIDUXU-WM-2013-OkazawaY #design #modelling
A Proposal of Design Method of Obtaining the Construction Items of Mental Models in Product Design (NO, TY), pp. 408–413.
HCIHIMI-D-2013-MogawaSI #algorithm #product line #representation #set
Generalized Algorithm for Obtaining a Family of Evaluating Attributes’ Sets Representing Customer’s Preference (TM, FS, SI), pp. 494–504.
MLDMMLDM-2013-AmalamanER #detection #using
Using Turning Point Detection to Obtain Better Regression Trees (PKA, CFE, NJR), pp. 325–339.
ICSEICSE-2013-GarciaKMM #architecture
Obtaining ground-truth software architectures (JG, IK, CM, NM), pp. 901–910.
LICSLICS-2013-Fontaine #consistency #query #question #why
Why is it Hard to Obtain a Dichotomy for Consistent Query Answering? (GF), pp. 550–559.
WICSA-ECSAWICSA-ECSA-2012-GarciaKMD #architecture #framework
A Framework for Obtaining the Ground-Truth in Architectural Recovery (JG, IK, NM, CD), pp. 292–296.
DACDAC-2012-Rinard #reasoning
Obtaining and reasoning about good enough software (MCR), pp. 930–935.
ICPRICPR-2012-KockelkornSGRJVRSG #classification #interactive #simulation
Interactive classification of lung tissue in CT scans by combining prior and interactively obtained training data: A simulation study (TTJPK, CIS, JCG, RR, PAdJ, MAV, JR, CSP, BvG), pp. 105–108.
SIGIRSIGIR-2012-YilmazKCT #on the
On judgments obtained from a commercial search engine (EY, GK, NC, SMMT), pp. 1115–1116.
SACSAC-2012-OliveiraCS #bound #on the #using
On using adversary simulators to obtain tight lower bounds for response times (RSdO, AC, RAS), pp. 1573–1579.
KEODKEOD-2011-OkumuraH #concept #using
A Refining Method of Obtained Attributes to Characterize Undefined Concepts using Search Engine (NO, YH), pp. 493–497.
SACSAC-2011-HauptPH #approach #programming language #type system
Type harvesting: a practical approach to obtaining typing information in dynamic programming languages (MH, MP, RH), pp. 1282–1289.
ICEISICEIS-AIDSS-2010-MianiYSF #algorithm #optimisation #process #semantics
NARFO* Algorithm — Optimizing the Process of Obtaining Non-redundant and Generalized Semantic Association Rules (RGM, CAY, MTPS, VRTF), pp. 320–325.
ICPRICPR-2010-Hotta #classification #using #visual notation #word
Scene Classification Using Local Co-occurrence Feature in Subspace Obtained by KPCA of Local Blob Visual Words (KH), pp. 4230–4233.
HCIDHM-2009-GoonetillekeWZX #metric
The Pluses and Minuses of Obtaining Measurements from Digital Scans (RSG, CPW, JZ, SX), pp. 681–690.
HCIHCI-NT-2009-LeuteritzWK #multi #usability #validation
Multi-level Validation of the ISOmetrics Questionnaire Based on Qualitative and Quantitative Data Obtained from a Conventional Usability Test (JPL, HW, MK), pp. 304–313.
HCIHIMI-II-2009-NishiharaSS #case study #experience #visualisation
Event Extraction and Visualization for Obtaining Personal Experiences from Blogs (YN, KS, WS), pp. 315–324.
ICEISICEIS-ISAS-2009-GoebelTGTN #how
RFID in the Supply Chain: How to Obtain a Positive ROI — The Case of Gerry Weber (CG, CT, OG, RT, RN), pp. 95–102.
CIKMCIKM-2009-XuFZH #feature model #orthogonal #using
To obtain orthogonal feature extraction using training data selection (YX, SF, JZ, OH), pp. 1819–1822.
SACSAC-2009-JangYC #algorithm #clustering #multi #set
A smart clustering algorithm for photo set obtained from multiple digital cameras (CJJ, TY, HGC), pp. 1784–1791.
CASECASE-2008-MatsumotoUOI #analysis #empirical #process
Business process analysis to obtain empirical lot sizing rule in printing process (SM, NU, KO, HI), pp. 591–596.
ICPRICPR-2008-Wang #algorithm #string
A new method to obtain the shift-table in Boyer-Moore’s string matching algorithm (YW), pp. 1–4.
SEKESEKE-2008-TubiioLR #bibliography #elicitation #perspective
Obtaining Well-Founded Practices about Elicitation Techniques by Means of an Update of a Previous Systematic Review (ÓDT, ML, FR), pp. 769–772.
LATALATA-2007-DassowF #approach #comparison
Comparison of Some Descriptional Complexities of 0L Systems Obtained by a Unifying Approach (JD, HF), pp. 249–260.
ICEISICEIS-AIDSS-2007-CarvalhoRC
Obtaining and Evaluating Generalized Association Rules (VOdC, SOR, MdC), pp. 310–315.
CSMRCSMR-2006-GuzmanPP #database #relational #web #web service
Obtaining Web Services from Relational Databases (IGRdG, MP, MP), pp. 304–310.
CEFPCEFP-2005-Hammond #approach #behaviour #bound #functional #programming
Exploiting Purely Functional Programming to Obtain Bounded Resource Behaviour: The Hume Approach (KH), pp. 100–134.
ICEISICEIS-v3-2005-CapelH #csp #modelling #specification #visual notation
Transforming SA/RT Graphical Specifications into CSP+T Formalism — Obtaining a Formal Specification from Semi-Formal SA/RT Essential Models (MIC, JAHT), pp. 65–72.
TACASTACAS-2004-MailundW #graph #reachability #using
Obtaining Memory-Efficient Reachability Graph Representations Using the Sweep-Line Method (TM, MW), pp. 177–191.
ICEISICEIS-v2-2004-ZarateAPR #data mining #mining
Data Mining Application to Obtain Profiles of Patients with Nephrolithiasis (LEZ, PA, RP, TR), pp. 104–109.
SACSAC-2004-PrigourisPMHM #independence #network
A network independent broker for obtaining the position of nomadic users (NP, GP, GFM, SH, LFM), pp. 1206–1207.
PEPMASIA-PEPM-2002-AgerDR #on the #partial evaluation #string
On obtaining Knuth, Morris, and Pratt’s string matcher by partial evaluation (MSA, OD, HKR), pp. 32–46.
ICPRICPR-v3-2002-RavindranF #linear
A Simple Linear Method to Obtain Height Ordering of Scene Points (PR, NJF), pp. 719–722.
ICEISICEIS-v2-2001-CaleroPG #metric
Method for Obtaining Correct Metrics (CC, MP, MG), pp. 779–784.
ICMLICML-2001-ZadroznyE #classification #naive bayes #probability
Obtaining calibrated probability estimates from decision trees and naive Bayesian classifiers (BZ, CE), pp. 609–616.
DACDAC-2000-JainMMWL #analysis #canonical #complexity #composition #graph #how
Analysis of composition complexity and how to obtain smaller canonical graphs (JJ, KM, DM, IW, YL), pp. 681–686.
ICMLICML-2000-SilvaL #hybrid #learning
Obtaining Simplified Rule Bases by Hybrid Learning (RBdAeS, TBL), pp. 879–886.
ICPRICPR-v4-2000-GeraudFD #algorithm #image #pattern matching #pattern recognition #recognition
Obtaining Genericity for Image Processing and Pattern Recognition Algorithms (TG, YF, ADL), pp. 4816–4819.
ICPRICPR-v4-2000-MiyasakaKHA #3d #animation #image #metric #re-engineering #realtime
Reconstruction of Realistic 3D Surface Model and 3D Animation from Range Images Obtained by Real Time 3D Measurement System (TM, KK, MH, KA), pp. 4594–4598.
TOOLSTOOLS-ASIA-1999-CrespoRM #automation
Obtaining Generic Classes Automatically through a Parameterization Operator: A Focus on Constrained Genericity (YC, JJR, JMMC), pp. 166–176.
ICPRICPR-1998-OlagueM #3d
Optimal camera placement to obtain accurate 3D point positions (GO, RM), pp. 8–10.
LOPSTRLOPSTR-1998-Rosenblueth #source code #using
An Exhaustive-Search Method Using Layered Streams Obtained Through a Meta-Interpreter for Chain Programs (DAR), pp. 322–324.
ASF+SDFASF+SDF-1997-BrandSV #cobol #legacy #re-engineering
Obtaining a COBOL grammar from legacy code for reengineering purposes (MvdB, MPAS, CV), p. 6.
DACDAC-1996-RoychowdhuryM #scalability
Homotopy Techniques for Obtaining a DC Solution of Large-Scale MOS Circuits (JSR, RCM), pp. 286–291.
VLDBVLDB-1996-Levy #database #semistructured data
Obtaining Complete Answers from Incomplete Databases (AYL), pp. 402–412.
ICPRICPR-1996-Chen #detection #parallel
The use of hidden deletable pixel detection to obtain bias-reduced skeletons in parallel thinning (YSC), pp. 91–95.
POPLPOPL-1995-PlevyakZC #concurrent #object-oriented #performance
Obtaining Sequential Efficiency for Concurrent Object-Oriented Languages (JP, XZ, AAC), pp. 311–321.
LICSLICS-1989-MisloveMO #fixpoint #set
Non-Well-Founded Sets Obtained from Ideal Fixed Points (MWM, LSM, FJO), pp. 263–272.
ICLPNACLP-1989-SaletoreK #execution #logic programming #parallel #performance #source code
Obtaining First Solutions Faster in AND-OR Parallel Execution of Logic Programs (VAS, LVK), pp. 390–406.
DACDAC-1988-CongW #how
How to Obtain More Compactable Channel Routing Solutions (JC, DFW), pp. 663–666.
STOCSTOC-1985-JimboM
Expanders Obtained from Affine Transformations (Preliminary Version) (SJ, AM), pp. 88–97.
SIGIRSIGIR-1985-ChiFSL #database
Processing Free-Text Input to Obtain a Database of Medical Information (ECC, CF, NS, MSL), pp. 82–90.
VLDBVLDB-1983-BuckleyS #database #multi #protocol
Obtaining Progressive Protocols for a Simple Multiversion Database Model (GNB, AS), pp. 74–80.
ICLPILPC-1982-Bruynooghe82a #prolog #reliability #source code
Adding Redundancy to Obtain more Reliable and Readable Prolog Programs (MB), pp. 129–133.
DACDAC-1981-AlmyR #fault #using
Using error latch trace to obtain diagnostic information (PMA, JLR), pp. 355–359.
POPLPOPL-1977-Clarke #axiom #hoare #programming language
Programming Language Constructs for Which it is Impossible to Obtain “Good” Hoare-Like Axiom Systems (EMC), pp. 10–20.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.