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 (8)
algorithm (6)
path (6)
problem (5)
base (5)

Stem optimum$ (all stems)

47 papers:

ICPRICPR-2014-RosaCJPFT #clustering #network #on the #using
On the Training of Artificial Neural Networks with Radial Basis Function Using Optimum-Path Forest Clustering (GHR, KAPC, LAPJ, JPP, AXF, JMRST), pp. 1472–1477.
ICPRICPR-2014-SaitoAFRSGC #learning #using
Active Semi-supervised Learning Using Optimum-Path Forest (PTMS, WPA, AXF, PJdR, CTNS, JFG, MHdC), pp. 3798–3803.
PLDIPLDI-2013-ZhangNY #abstraction #analysis #data flow #parametricity
Finding optimum abstractions in parametric dataflow analysis (XZ, MN, HY), pp. 365–376.
CIKMCIKM-2012-HagenPBS #query #segmentation #towards
Towards optimum query segmentation: in doubt without (MH, MP, AB, BS), pp. 1015–1024.
ICPRICPR-2012-IwashitaPFLOAT #cost analysis
Speeding up optimum-path forest training by path-cost propagation (ASI, JPP, AXF, RdAL, VMdAO, VHCdA, JMRST), pp. 1233–1236.
HCIHIMI-v2-2011-ChanST #design #interface
Developing Optimum Interface Design for On-Screen Chinese Proofreading Tasks (AHSC, JCYS, SNHT), pp. 3–10.
ICPRICPR-2010-CapitaineF #evaluation
An Optimum Class-Rejective Decision Rule and Its Evaluation (HLC, CF), pp. 3312–3315.
ICPRICPR-2010-PapaCF #classification #dataset #optimisation
Optimizing Optimum-Path Forest Classification for Huge Datasets (JPP, FAMC, AXF), pp. 4162–4165.
CASECASE-2009-ChenHB
Optimum sampling for track PEB CD Integrated Metrology (AC, SH, JB), pp. 439–442.
DACDAC-2009-AmadorPR #architecture #memory management #problem
Optimum LDPC decoder: a memory architecture problem (EA, RP, VR), pp. 891–896.
HCIHCI-NT-2009-Wang09a #concept #design
Learn as Babies Learn: A Conceptual Model of Designing Optimum Learnability (DXW), pp. 745–751.
ICEISICEIS-AIDSS-2009-KhashmanD #image #network #using
Optimum DCT Compression of Medical Images using Neural Networks (AK, KD), pp. 90–95.
DACDAC-2008-GinsburgC #energy #parallel
The mixed signal optimum energy point: voltage and parallelism (BPG, APC), pp. 244–249.
VLDBVLDB-2008-BiveinisS #in memory #performance #towards
Towards efficient main-memory use for optimum tree index update (LB, SS), pp. 1617–1622.
ICMLICML-2008-ZhangDT #algorithm
Estimating local optimums in EM algorithm over Gaussian mixture model (ZZ, BTD, AKHT), pp. 1240–1247.
SACSAC-2008-LiuHC
Handle local optimum traps in CBIR systems (DL, KAH, HC), pp. 1202–1206.
ICMLICML-2006-Meila
The uniqueness of a good optimum for K-means (MM), pp. 625–632.
ICPRICPR-v4-2006-WangLC06a #coordination
Fingerprint Minutiae Matching Based on Coordinate System Bank and Global Optimum Alignment (WW, JL, WC), pp. 401–404.
DACDAC-2005-JayakumarDK #monitoring #self
A self-adjusting scheme to determine the optimum RBB by monitoring leakage currents (NJ, SD, SPK), pp. 43–46.
SACSAC-2005-Suzuki #documentation #xml
Finding an optimum edit script between an XML document and a DTD (NS), pp. 647–653.
ICPRICPR-v4-2004-KwonP #detection #image #quality
Optimum Block Size Detection for Image Quality Measure (YBK, JP), pp. 491–494.
SEKESEKE-2004-FengyanZX #algorithm #kernel #modelling #parametricity #reliability
A Nonparametric Software Reliability Model Based on Kernel Estimator and Optimum Algorithm (HF, QZ, WX), pp. 13–18.
DACDAC-2003-GhoneimaI #bidirectional
Optimum positioning of interleaved repeaters In bidirectional buses (MG, YII), pp. 586–591.
ICPRICPR-v1-2002-JunTD #estimation #multi #segmentation
Multiple Objects Segmentation Based on Maximum-Likelihood Estimation and Optimum Entropy-Distribution (MLE-OED) (JX, HTT, DX), p. 707–?.
ICPRICPR-v4-2002-JhanwarCSZ #image #retrieval #using
Content Based Image Retrieval Using Optimum Peano Scan (NJ, SC, GS, BZ), pp. 130–133.
DACDAC-2001-FanLWC #2d #design #on the
On Optimum Switch Box Designs for 2-D FPGAs (HF, JL, YLW, CCC), pp. 203–208.
DATEDATE-2001-Burdiek #generative #programming #using
Generation of optimum test stimuli for nonlinear analog circuits using nonlinear — programming and time-domain sensitivities (BB), pp. 603–609.
DACDAC-1999-DasdanIG #algorithm #performance #problem
Efficient Algorithms for Optimum Cycle Mean and Optimum Cost to Time Ratio Problems (AD, SI, RKG), pp. 37–42.
HCIHCI-CCAD-1999-PapaioannouN #user interface #using
An optimum UI for using a high comfort and enhanced manoeuvrability wheelchair for transportation tasks (GP, AN), pp. 932–936.
ICALPICALP-1997-Jansen #approximate #problem
Approximation Results for the Optimum Cost Partition Problem (KJ), pp. 727–737.
HCIHCI-CC-1997-Horie
Fundamental Study on Optimum Working Posture of VDT Workers from the View Point of EMG (YH), pp. 643–646.
ICPRICPR-1996-Ha #pattern matching #pattern recognition #recognition
An optimum class-selective rejection rule for pattern recognition (TMH), pp. 75–80.
DACDAC-1994-ChakradharD
Resynthesis and Retiming for Optimum Partial Scan (STC, SD), pp. 87–93.
DACDAC-1994-MurgaiBS #composition #encoding #functional #using
Optimum Functional Decomposition Using Encoding (RM, RKB, ALSV), pp. 408–414.
ICLPICLP-1993-IvanetsIKT
Optimum Flight Planning System for Aerodrome Zone (SI, NI, MK, ST), p. 842.
DACDAC-1990-HwangHL #constraints #heuristic #scheduling
Optimum and Heuristic Data Path Scheduling Under Resource Constraints (CTH, YCH, YLL), pp. 65–70.
DACDAC-1989-Chowdhury #design #graph #network #reliability
Optimum Design of Reliable IC Power Networks Having General Graph Topologies (SC), pp. 787–790.
SIGIRSIGIR-1989-Fuhr #polynomial #retrieval
Optimum Polynomial Retrieval Functions (NF), pp. 69–76.
STOCSTOC-1988-GabowT #algorithm #problem
Almost-Optimum Speed-ups of Algorithms for Bipartite Matching and Related Problems (HNG, RET), pp. 514–527.
SIGIRSIGIR-1988-FuhrH #estimation #probability
Optimum Probability Estimation Based on Expectations (NF, HH), pp. 257–273.
DACDAC-1983-HuK #array #logic #programmable #reduction
Optimum reduction of programmable logic array (TCH, YSK), pp. 553–558.
DACDAC-1982-ChandrasekharB
Optimum placement of two rectangular blocks (MSC, MAB), pp. 879–886.
DACDAC-1981-CiesielskiK
An optimum layer assignment for routing in ICs and PCBs (MJC, EK), pp. 733–737.
DACDAC-1979-StablerKK #algorithm #clustering
Placement algorithm by partitioning for optimum rectangular placement (EPS, VMK, VAK), pp. 24–25.
DACDAC-1978-Haims #2d #on the #problem
On the optimum two-dimensional allocation problem (MJH), pp. 298–304.
DACDAC-1973-KernighanSP #algorithm
An optimum channel-routing algorithm for polycell layouts of integrated circuits (BWK, DGS, GP), pp. 50–59.
DACDAC-1971-LarsenM #clustering #equation #layout #logic
Partitioning and ordering of logic equations for optimum MOS LSI device layout (RPL, LM), pp. 131–142.

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.