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:
pack (17)
pick (7)
onlin (6)
problem (5)
bound (4)

Stem bin$ (all stems)

36 papers:

CASECASE-2015-KaipaTSKLG #automation #using
Resolving automated perception system failures in bin-picking tasks using assistance from remote human operators (KNK, SSTK, SS, AMK, JDL, SKG), pp. 1453–1458.
CASECASE-2015-ShiK #realtime
Real-time grasping planning for robotic bin-picking and kitting applications (JS, GSK), pp. 1632–1637.
SEKESEKE-2015-SaberE #algorithm #array #clustering #novel
BiBinConvmean : A Novel Biclustering Algorithm for Binary Microarray Data (HBS, ME), pp. 178–181.
CASECASE-2014-KuoSLW #3d #detection #estimation #image
3D object detection and pose estimation from depth image for robotic bin picking (HYK, HRS, SHL, CCW), pp. 1264–1269.
ICALPICALP-v1-2014-DosaS #analysis
Optimal Analysis of Best Fit Bin Packing (GD, JS), pp. 429–441.
CASECASE-2013-PrettoTM #3d #flexibility #industrial #locality
Flexible 3D localization of planar objects for industrial bin-picking with monocamera vision system (AP, ST, EM), pp. 168–175.
DATEDATE-2013-ZhaoOX #process #synthesis
Profit maximization through process variation aware high level synthesis with speed binning (MZ, AO, CJX), pp. 176–181.
STOCSTOC-2013-AzarCKS #bound #online
Tight bounds for online vector bin packing (YA, IRC, SK, FBS), pp. 961–970.
ICALPICALP-v1-2013-JansenK #migration #online #polynomial #robust
A Robust AFPTAS for Online Bin Packing with Polynomial Migration, (KJ, KMK), pp. 589–600.
CHICHI-2013-HasanAI #mobile #named
Ad-binning: leveraging around device space for storing, browsing and retrieving mobile device content (KH, DA, PI), pp. 899–908.
CASECASE-2012-LeeKLYBM #3d #automation #visual notation
3D visual perception system for bin picking in automotive sub-assembly automation (SL, JK, ML, KY, LGB, RM), pp. 706–713.
CHICHI-2012-ThiemeCMWKLO #design #persuasion #quote #social
“We’ve bin watching you”: designing for reflection and social persuasion to promote sustainable lifestyles (AT, RC, JM, JW, NCK, SWL, PO), pp. 2337–2346.
ICPRICPR-2012-GuoZC #representation
Find dominant bins of a histogram by sparse representation (XG, ZCZ, AC), pp. 3038–3041.
ICPRICPR-2012-LyuYW #metric #robust #visual notation
Robust visual tracking with the cross-bin metric (CL, YY, HW), pp. 2120–2123.
CIAACIAA-J-2010-BujtasDINT11 #problem
The Graph-Bin Packing Problem (CB, GD, CI, JNG, ZT), pp. 1971–1993.
ECIRECIR-2008-MetzlerSC #modelling #retrieval #statistics
A Statistical View of Binned Retrieval Models (DM, TS, WBC), pp. 175–186.
CASECASE-2007-Boehnke #locality
Object localization in range data for robotic bin picking (KB), pp. 572–577.
DACDAC-2006-DavoodiS #optimisation #variability
Variability driven gate sizing for binning yield optimization (AD, AS), pp. 959–964.
ICALPICALP-v1-2006-EpsteinL #problem #robust
A Robust APTAS for the Classical Bin Packing Problem (LE, AL), pp. 214–225.
ICPRICPR-v2-2006-KirkegaardM #graph
Bin-Picking based on Harmonic Shape Contexts and Graph-Based Matching (JK, TBM), pp. 581–584.
ICALPICALP-2005-ChanLW
Dynamic Bin Packing of Unit Fractions Items (WTC, TWL, PWHW), pp. 614–626.
ICALPICALP-2005-DietzfelbingerW #constant
Balanced Allocation and Dictionaries with Tightly Packed Constant Size Bins (MD, CW), pp. 166–178.
ICALPICALP-2002-EpsteinSS #bound #online
New Bounds for Variable-Sized and Resource Augmented Online Bin Packing (LE, SSS, RvS), pp. 306–317.
ICALPICALP-2001-Seiden #on the #online #problem
On the Online Bin Packing Problem (SSS), pp. 237–248.
STOCSTOC-2000-CsirikJKOSW #algorithm #on the
On the sum-of-squares algorithm for bin packing (JC, DSJ, CK, JBO, PWS, RRW), pp. 208–217.
ICALPICALP-2000-CsirikW #bound #online
Resource Augmentation for Online Bounded Space Bin Packing (JC, GJW), pp. 296–304.
ICALPICALP-2000-Seiden #algorithm #bound #online
An Optimal Online Algorithm for Bounded Space Variable-Sized Bin Packing (SSS), pp. 283–295.
ICPRICPR-v2-2000-KudoIS #classification
A Histogram-Based Classifier on Overlapped Bins (MK, HI, MS), pp. 2029–2033.
PPDPPLILP-1994-TarauN #data transformation #novel #representation
A Novel Term Compression Scheme and Data Representation in the BinWAM (PT, UN), pp. 73–87.
SACSAC-1994-RaoI #approach #probability #problem
A stochastic approach to the bin-packing problem (RLR, SSI), pp. 261–265.
STOCSTOC-1993-CoffmanJSW #analysis #markov #proving
Markov chains, computer proofs, and average-case analysis of best fit bin packing (EGCJ, DSJ, PWS, RRW), pp. 412–421.
ICLPILPS-1993-BosschereT #parallel #programming #prolog
Blackboard-based Extensions for Parallel Programming in BinProlog (KDB, PT), p. 664.
PPDPPLILP-1992-Tarau #continuation #named #prolog
BinProlog: a Continuation Passing Style Prolog Engine (PT), pp. 479–480.
STOCSTOC-1991-CoffmanCGJMSWY #analysis #case study
Fundamental Discrepancies between Average-Case Analyses under Discrete and Continuous Distributions: A Bin Packing Case Study (EGCJ, CC, MRG, DSJ, LAM, PWS, RRW, MY), pp. 230–240.
STOCSTOC-1984-BentleyJLMM #behaviour
Some Unexpected Expected Behavior Results for Bin Packing (JLB, DSJ, FTL, CCM, LAM), pp. 279–288.
STOCSTOC-1984-KarpLM #analysis #multi #probability #problem
A Probabilistic Analysis of Multidimensional Bin Packing Problems (RMK, ML, AMS), pp. 289–298.

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.