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:
graph (4)
constraint (3)
problem (3)
task (3)
base (3)

Stem given$ (all stems)

30 papers:

ICEISICEIS-v1-2015-AwasthiLK #algorithm #linear #problem #sequence #strict
Un-restricted Common Due-Date Problem with Controllable Processing Times — Linear Algorithm for a Given Job Sequence (AA, JL, OK), pp. 526–534.
SACSAC-2015-SampaioEF #coordination
Determining the location of buildings given a single picture, environment maps and inaccurate GPS coordinates (JCS, RSE, LAFF), pp. 542–547.
ESEC-FSEESEC-FSE-2015-XuJFZPT #comprehension #exclamation
Hey, you have given me too many knobs!: understanding and dealing with over-designed configuration in system software (TX, LJ, XF, YZ, SP, RT), pp. 307–319.
DATEDATE-2014-SharmaPLAC #composition #data flow #energy #performance
Energy efficient data flow transformation for Givens Rotation based QR Decomposition (NS, PRP, ML, PA, FC), pp. 1–4.
CIKMCIKM-2014-ZhangP #graph #nondeterminism #scalability
Scalable Vaccine Distribution in Large Graphs given Uncertain Data (YZ, BAP), pp. 1719–1728.
ICMLICML-c1-2014-ShalitC #coordination #learning #matrix #orthogonal
Coordinate-descent for learning orthogonal matrices through Givens rotations (US, GC), pp. 548–556.
HCIHIMI-D-2013-JinnaiONKAS #evaluation #multi
Evaluation of Somatosensory Evoked Responses When Multiple Tactile Information Was Given to the Palm: A MEG Study (AJ, AO, SN, KK, TA, SS), pp. 594–603.
HCIHIMI-LCCB-2013-TachizawaOM #automation #bibliography #classification
An Automatic Classification of Product Review into Given Viewpoints (YT, MO, HM), pp. 598–606.
CASECASE-2011-NaibR #approach #automation #constraints
A P2P approach for automating seamless connectivity given intermittent bandwidth constraints (VVBN, SR), pp. 637–641.
HCIDHM-2011-HowardY #case study #predict
Predicting Support Reaction Forces for Standing and Seated Tasks with Given Postures-A Preliminary Study (BH, J(Y), pp. 89–98.
ICSTSAT-2011-AbioDNS
Reducing Chaos in SAT-Like Search: Finding Solutions Close to a Given One (IA, MD, RN, PJS), pp. 273–286.
DATEDATE-2006-HsuCK #constraints #energy #multi #realtime #synthesis
Multiprocessor synthesis for periodic hard real-time tasks under a given energy constraint (HRH, JJC, TWK), pp. 1061–1066.
ICALPICALP-v1-2006-Coja-OghlanL #graph #random
The Spectral Gap of Random Graphs with Given Expected Degrees (ACO, AL), pp. 15–26.
PODSPODS-2005-NashBM #composition #dependence #embedded
Composition of mappings given by embedded dependencies (AN, PAB, SM), pp. 172–183.
TLCATLCA-2005-AehligMO #decidability #higher-order #monad #recursion
The Monadic Second Order Theory of Trees Given by Arbitrary Level-Two Recursion Schemes Is Decidable (KA, JGdM, CHLO), pp. 39–54.
STOCSTOC-2004-Fischer #graph #morphism #testing
The difficulty of testing for isomorphism against a graph that is given in advance (EF), pp. 391–397.
CIAACIAA-2004-DelgadoM #approximate #regular expression
Approximation to the Smallest Regular Expression for a Given Regular Language (MD, JM), pp. 312–314.
VLDBVLDB-2003-PottingerB #modelling
Merging Models Based on Given Correspondences (RP, PAB), pp. 826–873.
ICEISICEIS-v2-2003-OrtegaDA #design #evolution #using
Using Grammatical Evolution to Design Curves with a Given Fractal Dimension (AO, ALAD, MA), pp. 395–398.
ICPRICPR-v4-2000-Lucas #graph #performance #taxonomy
Efficient Best-First Dictionary Search Given Graph-Based Input (SML), pp. 4434–4437.
CIAAWIA-1998-Augros #automaton #finite #infinity #set #word
Automata to Recognize Finite and Infinite Words with at Least Two Factorizations on a Given Finite Set (XA), pp. 220–225.
ICALPICALP-1997-EilamFZ #layout #network #problem
A Complete Characterization of the Path Layout Construction Problem for ATM Networks with Given Hop Count and Load (Extended Abstract) (TE, MF, SZ), pp. 527–537.
KDDKDD-1995-ScholkopfBV
Extracting Support Data for a Given Task (BS, CB, VV), pp. 252–257.
STOCSTOC-1993-KollerM #constraints
Constructing small sample spaces satisfying given constraints (DK, NM), pp. 268–277.
CSLCSL-1989-DrosteG #effectiveness #information management
Effectively Given Information Systems and Domains (MD, RG), pp. 116–142.
STOCSTOC-1988-BellareM #how
How to Sign Given Any Trapdoor Function (Extended Abstract) (MB, SM), pp. 32–42.
RTARTA-1987-Otto #confluence #congruence
Some Results about Confluence on a Given Congruence Class (FO), pp. 145–155.
STOCSTOC-1985-Kaltofen #source code
Computing with Polynomials Given by Straight-Line Programs I: Greatest Common Divisors (EK), pp. 131–142.
ICALPICALP-1983-KamimuraT #effectiveness
Effectively Given Spaces (TK, AT), pp. 385–396.
DACDAC-1980-BiehlGH #optimisation #problem
Optimization of the influence of problem modifications on given microprogrammed controllers (GB, WG, PSH), pp. 309–317.

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.