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:
cluster (58)
use (42)
algorithm (35)
base (34)
model (28)

Stem mean$ (all stems)

391 papers:

CASECASE-2015-BlanchiniFGP #programming
Inverse kinematics by means of convex programming: Some developments (FB, GF, GG, FAP), pp. 515–520.
CASECASE-2015-ChangL #algorithm #fuzzy #image
A fuzzy weighted mean aggregation algorithm for color image impulse noise removal (JYC, PCL), pp. 1268–1273.
CASECASE-2015-LinHK #algorithm #fuzzy #image #segmentation
A noise- and size-insensitive integrity-based fuzzy c-means algorithm for image segmentation (PLL, PWH, CHK), pp. 1282–1287.
FoSSaCSFoSSaCS-2015-Velner #decidability #game studies #multi #robust
Robust Multidimensional Mean-Payoff Games are Undecidable (YV), pp. 312–327.
TACASTACAS-2015-BrazdilCFK #multi #named #synthesis
MultiGain: A Controller Synthesis Tool for MDPs with Multiple Mean-Payoff Objectives (TB, KC, VF, AK), pp. 181–187.
STOCSTOC-2015-CohenEMMP #approximate #clustering #rank #reduction
Dimensionality Reduction for k-Means Clustering and Low Rank Approximation (MBC, SE, CM, CM, MP), pp. 163–172.
CSCWCSCW-2015-KimL #comprehension #mobile
Dwelling Places in KakaoTalk: Understanding the Roles and Meanings of Chatrooms in Mobile Instant Messengers (DjK, YKL), pp. 775–784.
HCIDUXU-UI-2015-WiedauGFGW #communication #named
Commiticator: Enhancing Non-verbal Communication by Means of Magnetic Vision (AW, DG, RF, TG, MW), pp. 705–714.
HCIHIMI-IKC-2015-UeokaI #development
Development of the Horror Emotion Amplification System by Means of Biofeedback Method (RU, KI), pp. 657–665.
ICMLICML-2015-BachemLK #estimation #parametricity
Coresets for Nonparametric Estimation — the Case of DP-Means (OB, ML, AK), pp. 209–217.
ICMLICML-2015-DingZSMM #consistency
Yinyang K-Means: A Drop-In Replacement of the Classic K-Means with Consistent Speedup (YD, YZ, XS, MM, TM), pp. 579–587.
ICMLICML-2015-HugginsNSM #markov #named #process
JUMP-Means: Small-Variance Asymptotics for Markov Jump Processes (JHH, KN, AS, VKM), pp. 693–701.
ICMLICML-2015-TristanTS #estimation #gpu #performance
Efficient Training of LDA on a GPU by Mean-for-Mode Estimation (JBT, JT, GLSJ), pp. 59–68.
MODELSMoDELS-J-2011-Steimann15 #refactoring
From well-formedness to meaning preservation: model refactoring for almost free (FS), pp. 307–320.
MODELSMoDELS-J-2011-Steimann15 #refactoring
From well-formedness to meaning preservation: model refactoring for almost free (FS), pp. 307–320.
MoDELSMoDELS-2015-VallejoKMB #case study #reuse #symmetry
Improving reuse by means of asymmetrical model migrations: An application to the Orcc case study (PV, MK, KJMM, JPB), pp. 358–367.
SACSAC-2015-HendersonGE #clustering #empirical #named #parametricity #performance #probability
EP-MEANS: an efficient nonparametric clustering of empirical probability distributions (KH, BG, TER), pp. 893–900.
SPLCSPLC-2015-FontBHC #automation #formal method #product line #variability
Automating the variability formalization of a model family by means of common variability language (JF, MB, ØH, CC), pp. 411–418.
CAVCAV-2015-BrenguierR #game studies #multi
Pareto Curves of Multidimensional Mean-Payoff Games (RB, JFR), pp. 251–267.
CSLCSL-2015-BrotherstonV #logic
Sub-classical Boolean Bunched Logics and the Meaning of Par (JB, JV), pp. 325–342.
LICSLICS-2015-ChatterjeeKK #markov #multi #process
Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes (KC, ZK, JK), pp. 244–256.
LICSLICS-2015-ClementeR #multi #problem #worst-case
Multidimensional beyond Worst-Case and Almost-Sure Problems for Mean-Payoff Objectives (LC, JFR), pp. 257–268.
SIGMODSIGMOD-2014-KargarACGSY #database #keyword #named #relational
MeanKS: meaningful keyword search in relational databases with complex schema (MK, AA, NC, PG, JS, XY), pp. 905–908.
FoSSaCSFoSSaCS-2014-Chatterjee0GO #game studies #probability
Perfect-Information Stochastic Mean-Payoff Parity Games (KC, LD, HG, YO), pp. 210–225.
ICALPICALP-v1-2014-AllamigeonBG #algorithm #game studies #polynomial
The Tropical Shadow-Vertex Algorithm Solves Mean Payoff Games in Polynomial Time on Average (XA, PB, SG), pp. 89–100.
ICALPICALP-v2-2014-ChatterjeeI #complexity #game studies
The Complexity of Ergodic Mean-payoff Games (KC, RIJ), pp. 122–133.
CHICHI-2014-HarveyGS #human-computer
HCI as a means to prosociality in the economy (JH, DG, AS), pp. 2955–2964.
CSCWCSCW-2014-PreistMC #volunteer
Competing or aiming to be average?: normification as a means of engaging digital volunteers (CP, EM, DC), pp. 1222–1233.
HCIDUXU-DI-2014-PaulinBA #case study #experience #user interface
The Study of the Relations between the BrainHex Player Profiles, MBTI Psychological Types and Emotions as Means to Enhance User Experience (REP, ALB, MMA), pp. 732–741.
HCIDUXU-ELAS-2014-JoshiW #collaboration #empirical
A Collaborative Change Experiment: Telecare as a Means for Delivery of Home Care Services (SGJ, AW), pp. 141–151.
HCIDUXU-TMT-2014-CoventryBJM #behaviour #named #security
SCENE: A Structured Means for Creating and Evaluating Behavioral Nudges in a Cyber Security Environment (LMC, PB, DJ, APAvM), pp. 229–239.
HCIHCI-AIMT-2014-SunLF #comprehension #memory management
The Effects of Working Memory Load and Mental Imagery on Metaphoric Meaning Access in Metaphor Comprehension (XS, YL, XF), pp. 502–510.
HCIHIMI-DE-2014-WinterhollerBCM #adaptation
Information Coding by Means of Adaptive Controlling Torques (JW, JB, KC, TM), pp. 271–280.
HCILCT-TRE-2014-IshikawaAKSTD #learning #process #self #student
Sustaining Outside-of-Class CALL Activities by Means of a Student Self-Evaluation System in a University Blended Learning EFL Course (YI, RAY, MK, CS, YT, MD), pp. 146–154.
HILTHILT-2014-Seidewitz #execution #modelling #uml
UML with meaning: executable modeling in foundational UML and the Alf action language (ES), pp. 61–68.
ICMLICML-c1-2014-IyerNS #bound #convergence #estimation #kernel
Maximum Mean Discrepancy for Class Ratio Estimation: Convergence Bounds and Kernel Selection (AI, SN, SS), pp. 530–538.
ICMLICML-c1-2014-MuandetFSGS #estimation #kernel
Kernel Mean Estimation and Stein Effect (KM, KF, BKS, AG, BS), pp. 10–18.
ICMLICML-c2-2014-HsuS
Heavy-tailed regression with a generalized median-of-means (DH, SS), pp. 37–45.
ICMLICML-c2-2014-NieYH #analysis #component #robust
Optimal Mean Robust Principal Component Analysis (FN, JY, HH), pp. 1062–1070.
ICMLICML-c2-2014-VinnikovS #component #independence
K-means recovers ICA filters when independent components are sparse (AV, SSS), pp. 712–720.
ICPRICPR-2014-ChenSPS #detection #energy #statistics
Statistical Anomaly Detection in Mean and Variation of Energy Consumption (BC, MS, JP, AS), pp. 3570–3575.
ICPRICPR-2014-Dahllof #classification
Scribe Attribution for Early Medieval Handwriting by Means of Letter Extraction and Classification and a Voting Procedure for Larger Pieces (MD), pp. 1910–1915.
ICPRICPR-2014-KarM #fuzzy #using
Extraction of Retinal Blood Vessel Using Curvelet Transform and Fuzzy C-Means (SSK, SPM), pp. 3392–3397.
ICPRICPR-2014-MehnertMSMB #approach
A Structural Texture Approach for Characterising Malignancy Associated Changes in Pap Smears Based on Mean-Shift and the Watershed Transform (AM, RM, KS, PM, EB), pp. 1189–1193.
ICPRICPR-2014-NayefGO #documentation #image
Deblurring of Document Images Based on Sparse Representations Enhanced by Non-local Means (NN, PGK, JMO), pp. 4441–4446.
ICPRICPR-2014-PedersenNM #adaptation #algorithm #estimation
Adaptive Non-local Means for Cost Aggregation in a Local Disparity Estimation Algorithm (CP, KN, TBM), pp. 2442–2447.
ICPRICPR-2014-SlitiHBA #analysis #robust #using
A More Robust Mean Shift Tracker Using Joint Monogenic Signal Analysis and Color Histogram (OS, HH, FB, HA), pp. 2453–2458.
ICPRICPR-2014-SongLZC #adaptation #performance #using
Scale Adaptive Tracking Using Mean Shift and Efficient Feature Matching (YS, SL, JZ, HC), pp. 2233–2238.
ICPRICPR-2014-Yasuda #effectiveness
Effective Mean-Field Inference Method for Nonnegative Boltzmann Machines (MY), pp. 3600–3605.
KDIRKDIR-2014-SatoNS #classification #kernel #using
A Simple Classification Method for Class Imbalanced Data using the Kernel Mean (YS, KN, AS), pp. 327–334.
OnwardOnward-2014-SamimiDOWM #call-by
Call by Meaning (HS, CD, YO, AW, TDM), pp. 11–28.
PPoPPPPoPP-2014-Rubin #compilation #question #research #what
Heterogeneous computing: what does it mean for compiler research? (NR), pp. 315–316.
LICSLICS-CSL-2014-Velner #multi #robust #synthesis
Finite-memory strategy synthesis for robust multidimensional mean-payoff objectives (YV), p. 10.
ICDARICDAR-2013-LebourgeoisDGD #documentation #image #performance #segmentation
Fast Integral MeanShift: Application to Color Segmentation of Document Images (FL, FD, DG, JD), pp. 52–56.
ICDARICDAR-2013-ZhuZ #detection #image #recognition #using
Label Detection and Recognition for USPTO Images Using Convolutional K-Means Feature Quantization and Ada-Boost (SZ, RZ), pp. 633–637.
TACASTACAS-2013-BohyBFR #ltl #specification #synthesis
Synthesis from LTL Specifications with Mean-Payoff Objectives (AB, VB, EF, JFR), pp. 169–184.
ICSMEICSM-2013-Karus #automation #development #identification
Automatic Means of Identifying Evolutionary Events in Software Development (SK), pp. 412–415.
DLTDLT-J-2012-HromkovicKKS13 #automaton #logic #nondeterminism #representation
Determinism vs. Nondeterminism for Two-Way Automata: Representing the Meaning of States by Logical Formulæ (JH, RK, RK, RS), pp. 955–978.
ICALPICALP-v1-2013-BorosEGM #algorithm #game studies #probability #pseudo #random
A Pseudo-Polynomial Algorithm for Mean Payoff Stochastic Games with Perfect Information and a Few Random Positions (EB, KME, VG, KM), pp. 220–231.
IFMIFM-2013-DemasiCMA #fault tolerance #simulation
Characterizing Fault-Tolerant Systems by Means of Simulation Relations (RD, PFC, TSEM, NA), pp. 428–442.
ICFPICFP-2013-Balabonski
Weak optimality, and the meaning of sharing (TB), pp. 263–274.
CHICHI-2013-BirnholtzHR #student #twitter
Tweeting for class: co-construction as a means for engaging students in lectures (JPB, JTH, DR), pp. 797–800.
CHICHI-2013-ThiryLBR #authoring #framework #timeline
Authoring personal histories: exploring the timeline as a framework for meaning making (ET, SEL, RB, TR), pp. 1619–1628.
CSCWCSCW-2013-HuangDLLG #bound
Meanings and boundaries of scientific software sharing (XH, XD, CPL, TL, NG), pp. 423–434.
HCIHIMI-LCCB-2013-BrynielssonJL #communication #design #process #prototype #social #social media #using #video
Using Video Prototyping as a Means to Involve Crisis Communication Personnel in the Design Process: Innovating Crisis Management by Creating a Social Media Awareness Tool (JB, FJ, SL), pp. 559–568.
HCIOCSC-2013-FardounAC #community #education #network #online #social #student
Improvement of Students Curricula in Educational Environments by Means of Online Communities and Social Networks (HMF, AHA, APC), pp. 147–155.
ICMLICML-c3-2013-Cuturid
Mean Reversion with a Variance Threshold (MC, Ad), pp. 271–279.
KDIRKDIR-KMIS-2013-NcirE #clustering #on the #question
On the Extension of k-Means for Overlapping Clustering — Average or Sum of Clusters’ Representatives? (CEBN, NE), pp. 208–213.
KEODKEOD-2013-OimK #comprehension #representation
Event Representation in Text Understanding — Transfer of Meaning Structures (, MK), pp. 367–372.
MLDMMLDM-2013-DoganBK #algorithm #integration #self
SOM++: Integration of Self-Organizing Map and K-Means++ Algorithms (YD, DB, AK), pp. 246–259.
REER-BR-2013-Finkelstein #re-engineering #what
The Next 10 Years: the shape of software to come and what if means for software engineering (AF).
SACSAC-2013-SenatoreP #collaboration #concept analysis #fuzzy #navigation
Lattice navigation for collaborative filtering by means of (fuzzy) formal concept analysis (SS, GP), pp. 920–926.
ESEC-FSEESEC-FSE-2013-SilicDS #clustering #predict #reliability #web #web service
Prediction of atomic web services reliability based on k-means clustering (MS, GD, SS), pp. 70–80.
CSLCSL-2013-Tendera
Means and Limits of Decision (Invited Talk) (LT), pp. 28–29.
ASEASE-2012-Nogueira #complexity #predict #testing
Predicting software complexity by means of evolutionary testing (AFN), pp. 402–405.
VLDBVLDB-2012-BahmaniMVKV #scalability
Scalable K-Means++ (BB, BM, AV, RK, SV), pp. 622–633.
WCREWCRE-2012-CleveH #question #what
What Do Foreign Keys Actually Mean? (AC, JLH), pp. 299–307.
DLTDLT-2012-HromkovicKKS #automaton #logic #nondeterminism #representation
Determinism vs. Nondeterminism for Two-Way Automata — Representing the Meaning of States by Logical Formulæ (JH, RK, RK, RS), pp. 24–39.
ICALPICALP-v1-2012-LeviRR #testing
Testing Similar Means (RL, DR, RR), pp. 629–640.
ICALPICALP-v2-2012-Velner #automaton #complexity
The Complexity of Mean-Payoff Automaton Expression (YV), pp. 390–402.
ICMLICML-2012-GrunewalderLGBPP
Conditional mean embeddings as regressors (SG, GL, AG, LB, SP, MP), p. 234.
ICMLICML-2012-KulisJ #algorithm
Revisiting k-means: New Algorithms via Bayesian Nonparametrics (BK, MIJ), p. 148.
ICMLICML-2012-YuS #analysis #kernel
Analysis of Kernel Mean Matching under Covariate Shift (YY, CS), p. 150.
ICPRICPR-2012-AyechZ #clustering #feature model #image #modelling #segmentation #statistics
Terahertz image segmentation based on K-harmonic-means clustering and statistical feature extraction modeling (MWA, DZ), pp. 222–225.
ICPRICPR-2012-ChaudhuriM #on the
On the relation between K-means and PLSA (ARC, MNM), pp. 2298–2301.
ICPRICPR-2012-ChenS #multi
Bone suppression in chest radiographs by means of anatomically specific multiple massive-training ANNs (SC, KS), pp. 17–20.
ICPRICPR-2012-Havens #approximate #kernel #streaming
Approximation of kernel k-means for streaming data (TCH), pp. 509–512.
ICPRICPR-2012-HuangHHLJW #representation
Face hallucination via K-selection mean constrained sparse representation (KH, RH, ZH, TL, JJ, FW), pp. 882–885.
ICPRICPR-2012-LiVBB #clustering #learning #using
Feature learning using Generalized Extreme Value distribution based K-means clustering (ZL, OV, HB, RB), pp. 1538–1541.
ICPRICPR-2012-NielsenLYV #matrix
Jensen divergence based SPD matrix means and applications (FN, ML, XY, BCV), pp. 2841–2844.
ICPRICPR-2012-SerratosaCS #graph #interactive
Interactive graph matching by means of imposing the pairwise costs (FS, XC, ASR), pp. 1298–1301.
KDDKDD-2012-LiuA #clustering #data flow #web
Stratified k-means clustering over a deep web data source (TL, GA), pp. 1113–1121.
KMISKMIS-2012-VanharantaK #ontology
Strategy Needs Structure — Structure Needs Ontologies — Dynamic Ontologies Carry Meanings (HV, JK), pp. 261–264.
MLDMMLDM-2012-ForczmanskiF #classification #distance #representation
Classification of Elementary Stamp Shapes by Means of Reduced Point Distance Histogram Representation (PF, DF), pp. 603–616.
MLDMMLDM-2012-Moreira-MatiasMGB #categorisation #classification #matrix #using
Text Categorization Using an Ensemble Classifier Based on a Mean Co-association Matrix (LMM, JMM, JG, PB), pp. 525–539.
MLDMMLDM-2012-VlaseMI #clustering #metadata #using
Improvement of K-means Clustering Using Patents Metadata (MV, DM, AI), pp. 293–305.
RERE-2012-MaglyasNS #question #what
What do practitioners mean when they talk about product management? (AM, UN, KS), pp. 261–266.
REFSQREFSQ-2012-MahauxMH #how #people #requirements #why
Choose Your Creativity: Why and How Creativity in Requirements Engineering Means Different Things to Different People (MM, AM, PH), pp. 101–116.
SACSAC-2012-GiuntaPT12a #aspect-oriented #design pattern
Superimposing roles for design patterns into application classes by means of aspects (RG, GP, ET), pp. 1866–1868.
ICSEICSE-2012-Wolff #architecture #industrial #what
Software architecture — What does it mean in industry? (Invited industrial talk) (EW), p. 999.
PLEASEPLEASE-2012-BoffoliCCV #consistency #flexibility #process #product line
Driving flexibility and consistency of business processes by means of product-line engineering and decision tables (NB, DC, DC, GV), pp. 33–36.
LICSLICS-2012-ChatterjeeV #automaton #game studies
Mean-Payoff Pushdown Games (KC, YV), pp. 195–204.
CASECASE-2011-ColP #detection #performance #recursion
Fast and accurate object detection by means of recursive monomial feature elimination and cascade of SVM (LDC, FAP), pp. 304–309.
ICDARICDAR-2011-HuZ #online #recognition #using
HMM-Based Recognition of Online Handwritten Mathematical Symbols Using Segmental K-Means Initialization and a Modified Pen-Up/Down Feature (LH, RZ), pp. 457–462.
ICDARICDAR-2011-WakaharaK #clustering #image #string #using
Binarization of Color Character Strings in Scene Images Using K-Means Clustering and Support Vector Machines (TW, KK), pp. 274–278.
ITiCSEITiCSE-2011-Hu #what
Computational thinking: what it might mean and what we might do about it (CH), pp. 223–227.
WCREWCRE-2011-NonnenSI #research #source code
Locating the Meaning of Terms in Source Code Research on “Term Introduction” (JN, DS, PI), pp. 99–108.
DLTDLT-2011-BattaglinoFFR #encoding #regular expression
Encoding Centered Polyominoes by Means of a Regular Language (DB, JMF, AF, SR), pp. 464–465.
ICALPICALP-v1-2011-BorosEFGMM #analysis #approximate #game studies #probability
Stochastic Mean Payoff Games: Smoothed Analysis and Approximation Schemes (EB, KME, MF, VG, KM, BM), pp. 147–158.
CHICHI-2011-KapteinDM #adaptation #persuasion
Means based adaptive persuasive systems (MK, SD, PM), pp. 335–344.
HCIDUXU-v1-2011-PrabhalaLG #people #question #what #word
Ethnography, Ethnography or Ethnography? What Happens When the Same Word Means Different Things to Different People? (SP, DL, SG), pp. 102–110.
HCIHCD-2011-Ley #interactive #workflow
Expert-Sided Workflow Data Acquisition by Means of an Interactive Interview System (DL), pp. 91–100.
HCIHCI-DDA-2011-EngelMF #human-computer #interactive #user interface
HCI Patterns as a Means to Transform Interactive User Interfaces to Diverse Contexts of Use (JE, CM, PF), pp. 204–213.
HCIHCI-DDA-2011-ZablotskiyPZM #algorithm #estimation #parametricity #search-based
GMM Parameter Estimation by Means of EM and Genetic Algorithms (SZ, TP, KZ, WM), pp. 527–536.
HCIHCI-UA-2011-HopeOHL #design #multi
Spatial Design, Designers and Users: Exploring the Meaning of Multi-party Service Cognition (TH, MO, YH, MHL), pp. 328–335.
EDOCEDOC-2011-SchleicherFGLNSS #strict
Compliance Domains: A Means to Model Data-Restrictions in Cloud Environments (DS, CF, SG, FL, AN, PS, DS), pp. 257–266.
CIKMCIKM-2011-Garza #classification #matrix
Structured data classification by means of matrix factorization (PG), pp. 2165–2168.
CIKMCIKM-2011-WahabzadaKPB #performance #scheduling
More influence means less work: fast latent dirichlet allocation by influence scheduling (MW, KK, AP, CB), pp. 2273–2276.
ECIRECIR-2011-ZucconAR #analysis
Back to the Roots: Mean-Variance Analysis of Relevance Estimations (GZ, LA, KvR), pp. 716–720.
ICMLICML-2011-MannorT #markov #optimisation #process
Mean-Variance Optimization in Markov Decision Processes (SM, JNT), pp. 177–184.
ICMLICML-2011-YueJ
Beat the Mean Bandit (YY, TJ), pp. 241–248.
KDDKDD-2011-ChittaJHJ #approximate #clustering #kernel #scalability
Approximate kernel k-means: solution to large scale kernel clustering (RC, RJ, TCH, AKJ), pp. 895–903.
KEODKEOD-2011-AkamaN
Meaning-preserving Skolemization (KA, EN), pp. 322–327.
RERE-2011-OhashiKTY #development #traceability #uml
A means of establishing traceability based on a UML model in business application development (KO, HK, YT, RY), pp. 279–284.
SACSAC-2011-SimoesO #behaviour #game studies #learning #modelling
Leveraging the dynamics of learning by modeling and managing psychosocial relations and behavior by means of game theory and memetics (JCS, NO), pp. 1194–1201.
LICSLICS-2011-BrazdilBCFK #markov #multi #process
Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes (TB, VB, KC, VF, AK), pp. 33–42.
LICSLICS-2011-EhrhardPT #probability
The Computational Meaning of Probabilistic Coherence Spaces (TE, MP, CT), pp. 87–96.
LICSLICS-2011-Panangaden #semantics
The Meaning of Semantics (PP), pp. 4–5.
ECSAECSA-2010-BerrocalGM #design pattern #requirements
Facilitating the Selection of Architectural Patterns by Means of a Marked Requirements Model (JB, JGA, JMM), pp. 384–391.
ICALPICALP-v1-2010-AtseriasM #game studies #proving
Mean-Payoff Games and Propositional Proofs (AA, ENM), pp. 102–113.
SEFMSEFM-2010-ScannielloRT #architecture #empirical #evaluation #semantics #using
Architecture Recovery Using Latent Semantic Indexing and K-Means: An Empirical Evaluation (GS, MR, GT), pp. 103–112.
CIKMCIKM-2010-ChatterjeeBR #clustering
Feature subspace transformations for enhancing k-means clustering (AC, SB, PR), pp. 1801–1804.
ICPRICPR-2010-AdluruTWD #re-engineering #using
Improving Undersampled MRI Reconstruction Using Non-local Means (GA, TT, RTW, EVRDB), pp. 4000–4003.
ICPRICPR-2010-AyechKA #adaptation #clustering #image #segmentation
Image Segmentation Based on Adaptive Fuzzy-C-Means Clustering (MWA, KK, BeA), pp. 2306–2309.
ICPRICPR-2010-BardajiFS #distance #edit distance #graph
Computing the Barycenter Graph by Means of the Graph Edit Distance (IB, MF, AS), pp. 962–965.
ICPRICPR-2010-ChenWL #clustering #on the
On Dynamic Weighting of Data in Clustering with K-Alpha Means (SC, HW, BL), pp. 774–777.
ICPRICPR-2010-GouiffesLL
Color Connectedness Degree for Mean-Shift Tracking (MG, FL, LL), pp. 4561–4564.
ICPRICPR-2010-HanerG #visual notation
Combining Foreground / Background Feature Points and Anisotropic Mean Shift For Enhanced Visual Object Tracking (SH, IYHG), pp. 3488–3491.
ICPRICPR-2010-JainO #consistency #graph
Consistent Estimator of Median and Mean Graph (BJJ, KO), pp. 1032–1035.
ICPRICPR-2010-KeuperBRPH #3d #robust
Mean Shift Gradient Vector Flow: A Robust External Force Field for 3D Active Surfaces (MK, HB, OR, JP, PH), pp. 2784–2787.
ICPRICPR-2010-KitaW #clustering #image #using
Binarization of Color Characters in Scene Images Using k-means Clustering and Support Vector Machines (KK, TW), pp. 3183–3186.
ICPRICPR-2010-KobayashiO #clustering
Von Mises-Fisher Mean Shift for Clustering on a Hypersphere (TK, NO), pp. 2130–2133.
ICPRICPR-2010-Manzanera #similarity
Local Jet Based Similarity for NL-Means Filtering (AM), pp. 2668–2671.
ICPRICPR-2010-ReckyL #detection #using
Windows Detection Using K-means in CIE-Lab Color Space (MR, FL), pp. 356–359.
ICPRICPR-2010-WanLJ #feature model
Feature Extraction Based on Class Mean Embedding (CME) (MW, ZL, ZJ), pp. 4174–4177.
ICPRICPR-2010-YoonW #algorithm
Improved Mean Shift Algorithm with Heterogeneous Node Weights (JWY, SPW), pp. 4222–4225.
KDIRKDIR-2010-NcirEB #clustering #kernel
Kernel Overlapping K-Means for Clustering in Feature Space (CEBN, NE, PB), pp. 250–255.
CSLCSL-2010-DegorreDGRT #energy #game studies
Energy and Mean-Payoff Games with Imperfect Information (AD, LD, RG, JFR, ST), pp. 260–274.
ICLPICLP-2010-Fierens10 #logic #modelling #performance #probability
Improving the Efficiency of Gibbs Sampling for Probabilistic Logical Models by Means of Program Specialization (DF), pp. 74–83.
CASECASE-2009-GargM #agile #algorithm #clustering #named #using
RACK: RApid clustering using K-means algorithm (VKG, MNM), pp. 621–626.
CASECASE-2009-SenguptaDBMD #detection #fault #modelling #using
Fault detection of Air Intake Systems of SI gasoline engines using mean value and within cycle models (SS, SD, AKB, SM, AKD), pp. 361–366.
ICDARICDAR-2009-Likforman-SulemDS #documentation #preprocessor
Pre-Processing of Degraded Printed Documents by Non-local Means and Total Variation (LLS, JD, EHBS), pp. 758–762.
ITiCSEITiCSE-2009-Velazquez-IturbideP #algorithm #interactive #learning
Active learning of greedy algorithms by means of interactive experimentation (JÁVI, APC), pp. 119–123.
FoSSaCSFoSSaCS-2009-AlurDMW #on the
On ω-Languages Defined by Mean-Payoff Conditions (RA, AD, OM, GW), pp. 333–347.
CHICHI-2009-VoidaG09a #named
WikiFolders: augmenting the display of folders to better convey the meaning of files (SV, SG), pp. 1679–1682.
HCIOCSC-2009-KindsmullerMS #community #online
Instant Online Communities as a Means to Foster Conferences (MCK, JM, JS), pp. 62–71.
ICEISICEIS-AIDSS-2009-Rojas-MoraG #fuzzy #nondeterminism #set
The Signing of a Professional Athlete — Reducing Uncertainty with a Weighted Mean Hemimetric for Phi — Fuzzy Subsets (JRM, JGL), pp. 158–163.
ICEISICEIS-SAIC-2009-LeeLK #classification #using
Blog Classification using K-means (KJL, ML, WK), pp. 61–67.
CIKMCIKM-2009-ChenL #product line
Message family propagation for ising mean field based on iteration tree (YC, SL), pp. 345–354.
CIKMCIKM-2009-LeeVRKMI #adaptation #performance #topic #using
Measuring system performance and topic discernment using generalized adaptive-weight mean (CTL, VV, EMR, GK, NMF, AI), pp. 2033–2036.
ECIRECIR-2009-Wang #analysis #documentation #information retrieval #ranking
Mean-Variance Analysis: A New Document Ranking Theory in Information Retrieval (JW0), pp. 4–16.
ICMLICML-2009-LiKZ #learning #using
Semi-supervised learning using label mean (YFL, JTK, ZHZ), pp. 633–640.
ICMLICML-2009-WagstaffB #evaluation
K-means in space: a radiation sensitivity evaluation (KLW, BJB), pp. 1097–1104.
KDDKDD-2009-VatturiW #detection #using
Category detection using hierarchical mean shift (PV, WKW), pp. 847–856.
KDDKDD-2009-WuXC #adaptation #clustering #metric
Adapting the right measures for K-means clustering (JW, HX, JC), pp. 877–886.
KDIRKDIR-2009-Dengel #information management #semantics
The Semantic Desktop as a Means for Personal Information Management (AD), p. 5.
KDIRKDIR-2009-HeyerHT #topic
Change of Topics over Time — Tracking Topics by their Change of Meaning (GH, FH, ST), pp. 223–228.
KDIRKDIR-2009-TsakonasD #estimation #modelling #programming #search-based
Deriving Models for Software Project Effort Estimation by Means of Genetic Programming (AT, GD), pp. 34–42.
KEODKEOD-2009-Dengel #information management #semantics
The Semantic Desktop as a Means for Personal Information Management (AD), p. 5.
KMISKMIS-2009-Dengel #information management #semantics
The Semantic Desktop as a Means for Personal Information Management (AD), p. 5.
SEKESEKE-2009-DoranG #clustering #web
Classifying Web Robots by K-means Clustering (DD, SSG), pp. 97–102.
ICMTICMT-2009-HillairetBL #model transformation #query
Rewriting Queries by Means of Model Transformations from SPARQL to OQL and Vice-Versa (GH, FB, JYL), pp. 116–131.
POPLPOPL-2009-CalcagnoDOY #analysis #composition
Compositional shape analysis by means of bi-abduction (CC, DD, PWO, HY), pp. 289–300.
REFSQREFSQ-2009-Kof #automaton #modelling #specification
Translation of Textual Specifications to Automata by Means of Discourse Context Modeling (LK), pp. 197–211.
SACSAC-2009-DiasASP #formal method #web
Formalizing motivational patterns based on colors and their cultural meanings for developing web applications (ALD, JCAS, LMS, RDP), pp. 152–153.
TLCATLCA-2009-BasaldellaT #logic #on the
On the Meaning of Logical Completeness (MB, KT), pp. 50–64.
DATEDATE-2008-MedardoniLB #design #self
Variation tolerant NoC design by means of self-calibrating links (SM, ML, DB), pp. 1402–1407.
DocEngDocEng-2008-CodocedoA #documentation #information management #mining #repository
No mining, no meaning: relating documents across repositories with ontology-driven information extraction (VC, HA), pp. 110–118.
DLTDLT-J-2007-BertoniR08 #approximate #monad
Approximating the Mean Speedup in Trace Monoids (AB, RR), pp. 497–511.
CIKMCIKM-2008-SuchanekVG #social
Social tags: meaning and suggestions (FMS, MV, DG), pp. 223–232.
ECIRECIR-2008-FishbeinE #classification #encoding
Integrating Structure and Meaning: A New Method for Encoding Structure for Text Classification (JMF, CE), pp. 514–521.
ECIRECIR-2008-KarlgrenHS #word
Filaments of Meaning in Word Space (JK, AH, MS), pp. 531–538.
ICPRICPR-2008-AsgharbeygiM #clustering
Geodesic K-means clustering (NA, AM), pp. 1–4.
ICPRICPR-2008-BianT
Harmonic mean for subspace selection (WB, DT), pp. 1–4.
ICPRICPR-2008-Cleuziou #clustering
An extended version of the k-means method for overlapping clustering (GC), pp. 1–4.
ICPRICPR-2008-KashimaHRS #clustering #distance #using
K-means clustering of proportional data using L1 distance (HK, JH, BKR, MS), pp. 1–4.
ICPRICPR-2008-LiCS #kernel #optimisation #predict #video
An improved mean-shift tracker with kernel prediction and scale optimisation targeting for low-frame-rate video tracking (ZL, JC, NNS), pp. 1–4.
ICPRICPR-2008-LouJ #distance #image #probability #recognition
Integrated probability function on local mean distance for image recognition (ZL, ZJ), pp. 1–4.
ICPRICPR-2008-OikeWW #adaptation #clustering
Adaptive selection of non-target cluster centers for K-means tracker (HO, HW, TW), pp. 1–4.
ICPRICPR-2008-XiaoL #higher-order #using
Improvement on Mean Shift based tracking using second-order information (LX, PL), pp. 1–4.
ICPRICPR-2008-YiAC #invariant #kernel #using
Orientation and scale invariant mean shift using object mask-based kernel (KMY, HSA, JYC), pp. 1–4.
KDDKDD-2008-HuangDLL #clustering #equivalence #higher-order
Simultaneous tensor subspace selection and clustering: the equivalence of high order svd and k-means clustering (HH, CHQD, DL, TL), pp. 327–335.
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.
SACSAC-2008-CorreaL #documentation #hybrid #semantics
Semantic mapping and K-means applied to hybrid SOM-based document organization system construction (RFC, TBL), pp. 1112–1116.
SACSAC-2008-MartinsB #on the #realtime
On the meaning of modes in uniprocessor real-time systems (PM, AB), pp. 324–325.
SACSAC-2008-NhatL #classification #visualisation
k-means discriminant maps for data visualization and classification (VDMN, SL), pp. 1187–1191.
DocEngDocEng-2007-NanardNKG #documentation #incremental #multi
Genre driven multimedia document production by means of incremental transformation (MN, JN, PRK, LG), pp. 111–120.
ICDARICDAR-2007-DriraLE #approach #documentation #image #segmentation
A Coupled Mean Shift-Anisotropic Diffusion Approach for Document Image Segmentation and Restoration (FD, FL, HE), pp. 814–818.
SCAMSCAM-2007-LawrieFB #identifier
Extracting Meaning from Abbreviated Identifiers (DL, HF, DB), pp. 213–222.
WCREWCRE-2007-Marinescu #constraints #enterprise
Discovering the Objectual Meaning of Foreign Key Constraints in Enterprise Applications (CM), pp. 100–109.
PLDIPLDI-2007-ScherpelzLC #automation #semantics
Automatic inference of optimizer flow functions from semantic meanings (ERS, SL, CC), pp. 135–145.
DLTDLT-2007-BertoniR #monad
Approximability and Non-approximability Results in Computing the Mean Speedup of Trace Monoids (AB, RR), pp. 72–83.
HCIHCI-IPT-2007-KimC #behaviour #comprehension
Understanding Camera Phone Imaging: Motivations, Behaviors and Meanings (GK, WC), pp. 374–383.
HCIHCI-IPT-2007-ZaharakisK #behaviour #interactive #social #ubiquitous
Social Intelligence as the Means for Achieving Emergent Interactive Behaviour in Ubiquitous Computing Environments (IDZ, ADK), pp. 1018–1029.
HCIHCI-MIE-2007-KwonPKK #recognition #using
Human Shape Tracking for Gait Recognition Using Active Contours with Mean Shift (KSK, SHP, EYK, HJK), pp. 690–699.
HCIHIMI-IIE-2007-LiuK
Skill Transfer from Expert to Novice — Instruction Manuals Made by Means of Groupware (CYL, YK), pp. 423–429.
HCIHIMI-IIE-2007-MaungK #data analysis #web
Web Application for Data Analysis by Means of Evidential Dominance (ZAHM, YK), pp. 749–758.
HCIHIMI-IIE-2007-ZhangWE #collaboration #comprehension
Resolving Assumptions in Art-Technology Collaboration as a Means of Extending Shared Understanding (YZ, AW, EAE), pp. 204–211.
HCIHIMI-MTT-2007-FuchigamiOTO #case study #comparative #interface #process
A Comparative Study of Brain Activities Engaged in Interface Operations by Means of NIRS Trajectory Map (MF, AO, HT, MO), pp. 830–839.
HCIHIMI-MTT-2007-OmoriHMCT #process
Brain Activities Related to Legibility of Text, Studied by Means of Near Infrared Spectroscopy (MO, SH, MM, MC, HT), pp. 894–902.
ICEISICEIS-SAIC-2007-KusterTZKCVBCFT #comparative #evaluation
Service Discovery with SWE-ET and DIANE — A Comparative Evaluation by Means of Solutions to a Common Scenario (UK, AT, MZ, BKR, DC, EDV, MB, SC, FMF, CT), pp. 430–437.
ICMLICML-2007-DingL #adaptation #analysis #clustering #reduction #using
Adaptive dimension reduction using discriminant analysis and K-means clustering (CHQD, TL), pp. 521–528.
RERE-2007-Kof #identification #named
Scenarios: Identifying Missing Objects and Actions by Means of Computational Linguistics (LK), pp. 121–130.
REFSQREFSQ-2007-LaukaitisV #development #information management #natural language
Integrating All Stages of Information Systems Development by Means of Natural Language Processing (AL, OV), pp. 218–231.
DocEngDocEng-2006-Maitre #documentation #multi #xml
Describing multistructured XML documents by means of delay nodes (JLM), pp. 155–164.
HTHT-2006-Zhang #wiki
Wiki means more: hyperreading in Wikipedia (YZ), pp. 23–26.
ICALPICALP-v2-2006-GimbertZ #game studies
Deterministic Priority Mean-Payoff Games as Limits of Discounted Games (HG, WZ), pp. 312–323.
CHICHI-2006-BhatiaM
Listening to your inner voices: investigating means for voice notifications (SB, DSM), pp. 1173–1176.
ICEISICEIS-SAIC-2006-RibeiroRC
Adding Meaning to QoS Negotiation (CMFAR, NSR, PRFC), pp. 106–111.
CIKMCIKM-2006-GoldinMN #algorithm #clustering #distance #sequence
In search of meaning for time series subsequence clustering: matching algorithms based on a new distance measure (DQG, RM, GN), pp. 347–356.
CIKMCIKM-2006-LiuJK #clustering #query
Measuring the meaning in time series clustering of text search queries (BL, RJ, KLK), pp. 836–837.
ECIRECIR-2006-FreschiSB #email #obfuscation #string
Filtering Obfuscated Email Spam by means of Phonetic String Matching (VF, AS, AB), pp. 505–509.
ICMLICML-2006-Carreira-Perpinan #clustering #parametricity #performance
Fast nonparametric clustering with Gaussian blurring mean-shift (MÁCP), pp. 153–160.
ICMLICML-2006-Meila
The uniqueness of a good optimum for K-means (MM), pp. 625–632.
ICPRICPR-v1-2006-BhattacharyaRD #clustering #fuzzy #image #representation #retrieval #semantics #using
Image Representation and Retrieval Using Support Vector Machine and Fuzzy C-means Clustering Based Semantical Spaces (PB, MMR, BCD), pp. 929–935.
ICPRICPR-v1-2006-BouguessaWJ #algorithm #clustering
A K-means-based Algorithm for Projective Clustering (MB, SW, QJ), pp. 888–891.
ICPRICPR-v2-2006-BhattacharyaRD06a #clustering #fuzzy #image #representation #retrieval #semantics #using
Image Representation and Retrieval Using Support Vector Machine and Fuzzy C-means Clustering Based Semantical Spaces (PB, MMR, BCD), pp. 1162–1168.
ICPRICPR-v2-2006-ChengCWF #algorithm #prototype #search-based
A Prototypes-Embedded Genetic K-means Algorithm (SSC, YHC, HMW, HCF), pp. 724–727.
ICPRICPR-v2-2006-KimYL #estimation #image #interactive #modelling #parametricity #random #segmentation #using
New MRF Parameter Estimation Technique for Texture Image Segmentation using Hierarchical GMRF Model Based on Random Spatial Interaction and Mean Field Theory (DHK, IDY, SUL), pp. 365–368.
ICPRICPR-v2-2006-Maruyama #clustering #configuration management #hardware #image #realtime
Real-time K-Means Clustering for Color Images on Reconfigurable Hardware (TM), pp. 816–819.
ICPRICPR-v2-2006-YuW06a #algorithm
Genetic-based K-means algorithm for selection of feature variables (ZY, HSW), pp. 744–747.
ICPRICPR-v3-2006-Morii #algorithm
A Generalized K-Means Algorithm with Semi-Supervised Weight Coefficients (FM), pp. 198–201.
ICPRICPR-v3-2006-QiuXT #clustering #feedback #kernel #performance #using
Efficient Relevance Feedback Using Semi-supervised Kernel-specified K-means Clustering (BQ, CX, QT), pp. 316–319.
ICPRICPR-v4-2006-AbateNRR #invariant #recognition
Ear Recognition by means of a Rotation Invariant Descriptor (AFA, MN, DR, SR), pp. 437–440.
KDDKDD-2006-XiongWC #clustering #metric #perspective #validation
K-means clustering versus validation measures: a data distribution perspective (HX, JW, JC), pp. 779–784.
HTHT-2005-KristoficB #adaptation #education #hypermedia #information management
Improving adaptation in web-based educational hypermedia by means of knowledge discovery (AK, MB), pp. 184–192.
ICDARICDAR-2005-MarinaiMS #documentation #image #layout #reduction #retrieval
Layout based document image retrieval by means of XY tree reduction (SM, EM, GS), pp. 432–436.
ICDARICDAR-2005-SchlapbachKB #feature model #identification
ImprovingWriter Identification by Means of Feature Selection and Extraction (AS, VK, HB), pp. 131–135.
CIAACIAA-J-2004-ChamparnaudCP05
Brute force determinization of nfas by means of state covers (JMC, FC, TP), pp. 441–451.
CIAACIAA-2005-Hogberg #generative #music #transducer
Wind in the Willows — Generating Music by Means of Tree Transducers (JH), pp. 153–162.
EDOCEDOC-2005-VitolinsK #diagrams #modelling #process #semantics #uml #virtual machine
Semantics of UML 2.0 Activity Diagram for Business Modeling by Means of Virtual Machine (VV, AK), pp. 181–194.
ICEISICEIS-v3-2005-EspositoMORS #data mining #detection #mining #novel #realtime
Real Time Detection of Novel Attacks by Means of Data Mining Techniques (ME, CM, FO, SPR, CS), pp. 120–127.
KDDKDD-2005-JagannathanW #clustering #distributed #privacy
Privacy-preserving distributed k-means clustering over arbitrarily partitioned data (GJ, RNW), pp. 593–599.
MLDMMLDM-2005-BunkeDIK #analysis #graph #learning #predict
Analysis of Time Series of Graphs: Prediction of Node Presence by Means of Decision Tree Learning (HB, PJD, CI, MK), pp. 366–375.
SACSAC-2005-BaglioniFT #information management
DrC4.5: Improving C4.5 by means of prior knowledge (MB, BF, FT), pp. 474–481.
SACSAC-2005-JablonskiLMMH #integration
Data logistics as a means of integration in healthcare applications (SJ, RL, CM, SM, WH), pp. 236–241.
SACSAC-2005-XiaPLCS
Indexing continuously changing data with mean-variance tree (YX, SP, SL, RC, RS), pp. 1125–1132.
LICSLICS-2005-ChatterjeeHJ #game studies
Mean-Payoff Parity Games (KC, TAH, MJ), pp. 178–187.
ASEASE-2004-SilvaF #evaluation #framework #object-oriented
Helping Object-Oriented Framework Use and Evaluation by means of Historical Use Information (RPeS, ECF), pp. 278–281.
HTHT-2004-Bernstein #adaptation #metadata
Lust, touch, metadata: meaning and the limits of adaptation (MB), pp. 36–37.
PODSPODS-2004-AgarwalM #clustering
k-Means Projective Clustering (PKA, NHM), pp. 155–165.
ITiCSEITiCSE-2004-Ben-AriBBH #education #question #research #what
What do we mean by theoretically sound research in computer science education? (MBA, AB, SB, CH), pp. 230–231.
IWPCIWPC-2004-CanforaCV #design #empirical
Working in Pairs as a Means for Design Knowledge Building: An Empirical Study (GC, AC, CAV), pp. 62–69.
IWPCIWPC-2004-MennieC #metaprogramming
Giving Meaning to Macros (CAM, CLAC), pp. 79–88.
SCAMSCAM-2004-CeccatoT #aspect-oriented #programming
Adding Distribution to Existing Applications by Means of Aspect Oriented Programming (MC, PT), pp. 107–116.
STOCSTOC-2004-Har-PeledM #clustering #on the
On coresets for k-means and k-median clustering (SHP, SM), pp. 291–300.
CIAACIAA-2004-ChamparnaudCP
Brute Force Determinization of NFAs by Means of State Covers (JMC, FC, TP), pp. 80–89.
ICEISICEIS-v2-2004-CaleroDSSMS #approximate #database #dependence #experience #fuzzy
An Experience in Management of Imprecise Soil Databases by Means of Fuzzy Association Rules and Fuzzy Approximate Dependencies (JC, GD, MSM, DS, MAVM, JMS), pp. 138–146.
ICEISICEIS-v2-2004-CastilhoPL #clustering #information management #process
Informed K-Means: A Clustering Process biased by Prior Knowledge (WFC, HAdP, ML), pp. 469–475.
ICEISICEIS-v2-2004-DykC #education #mining #process #statistics
Warehousing and Mining of Higher Education Data by Means of Statistical Process Control (LVD, PC), pp. 110–115.
ICMLICML-2004-DingH04a #analysis #clustering #component
K-means clustering via principal component analysis (CHQD, XH).
ICPRICPR-v1-2004-AbrantesM #algorithm #framework
The Mean Shift Algorithm and the Unified Framework (AJA, JSM), pp. 244–247.
ICPRICPR-v1-2004-TabboneW04b #adaptation #algorithm #image
Binarization of Color Images from an Adaptation of Possibilistic C-Means Algorithm (ST, LW), pp. 704–707.
ICPRICPR-v2-2004-TanakaT #image #probability
Probabilistic Image Processing based on the Q-Ising Model by Means of the Mean-Field Method and Loopy Belief Propagation (KT, DMT), pp. 40–43.
ICPRICPR-v3-2004-DeguchiKO #algorithm
Object Tracking by the Mean-Shift of Regional Color Distribution Combined with the Particle-Filter Algorithm (KD, OK, TO), pp. 506–509.
ICPRICPR-v4-2004-TothSWA #clustering #detection #using
Detection of Moving Shadows using Mean Shift Clustering and a Significance Test (DT, IS, AW, TA), pp. 260–263.
ICPRICPR-v4-2004-XuF #clustering #difference
Delta-MSE Dissimilarity in Suboptimal K-Means Clustering (MX, PF), pp. 577–580.
KDDKDD-2004-DhillonGK #clustering #kernel #normalisation
Kernel k-means: spectral clustering and normalized cuts (ISD, YG, BK), pp. 551–556.
KDDKDD-2004-Ordonez #algorithm #clustering #programming #sql
Programming the K-means clustering algorithm in SQL (CO), pp. 823–828.
KRKR-2004-Woods #semantics
Meaning and Links: A Semantic Odyssey (WAW), pp. 740–742.
SACSAC-2004-LuLFDB #algorithm #clustering #named #performance #search-based
FGKA: a Fast Genetic K-means Clustering Algorithm (YL, SL, FF, YD, SJB), pp. 622–623.
SACSAC-2004-StefanoSPT #communication #framework
Enforcing agent communication laws by means of a reflective framework (ADS, CS, GP, ET), pp. 462–468.
LDTALDTA-2004-GradaraSVV #model checking #modelling #parallel #source code #thread
Model Checking Multithreaded Programs by Means of Reduced Models (SG, AS, MLV, GV), pp. 55–74.
DATEDATE-2003-CabodiNQ #approximate #bound #model checking #satisfiability #traversal
Improving SAT-Based Bounded Model Checking by Means of BDD-Based Approximate Traversals (GC, SN, SQ), pp. 10898–10905.
ICDARICDAR-2003-BrittoSSSB #algorithm #clustering #low cost #parallel #using
A Low-Cost Parallel K-Means VQ Algorithm Using Cluster Computing (AdSBJ, PSLdS, RS, SdRSdS, DLB), pp. 839–843.
ICDARICDAR-2003-StefanoCM #algorithm #classification #reliability #search-based
Exploiting Reliability for Dynamic Selection of Classifiers by Means of Genetic Algorithms (CDS, ADC, AM), pp. 671–675.
CSEETCSEET-2003-ZuserG #performance
Reflecting Skills and Personality Internally as Means for Team Performance Improvement (WZ, TG), pp. 234–241.
STOCSTOC-2003-KabanetsI #bound #polynomial #proving #testing
Derandomizing polynomial identity tests means proving circuit lower bounds (VK, RI), pp. 355–364.
DLTDLT-2003-ChamparnaudC #algorithm #automaton #nondeterminism #reduction
NFA Reduction Algorithms by Means of Regular Inequalities (JMC, FC), pp. 194–205.
ICEISICEIS-v2-2003-SalemSA #algorithm #self #using
Improving Self-Organizing Feature Map (SOFM) Training Algorithm Using K-Means Initialization (ABMS, MMS, AFA), pp. 399–405.
ICMLICML-2003-Elkan #difference #using
Using the Triangle Inequality to Accelerate k-Means (CE), pp. 147–153.
KDDKDD-2003-VaidyaC #clustering #privacy
Privacy-preserving k-means clustering over vertically partitioned data (JV, CC), pp. 206–215.
SACSAC-2003-BorgerRC #concurrent #modelling #state machine #uml
Modeling the Meaning of Transitions from and to Concurrent States in UML State Machines (EB, ER, AC), pp. 1086–1091.
ICSEICSE-2003-HedinBM #programming #re-engineering
Introducing Software Engineering by means of Extreme Programming (GH, LB, BM), pp. 586–593.
RTARTA-2003-WellsPK #diagrams
Diagrams for Meaning Preservation (JBW, DP, FK), pp. 88–106.
ICSTSAT-2003-Bruni #fault #satisfiability #scalability #set
Solving Error Correction for Large Data Sets by Means of a SAT Solver (RB), pp. 229–241.
DATEDATE-2002-PalkovicMC #optimisation #trade-off
Systematic Power-Performance Trade-Off in MPEG-4 by Means of Selective Function Inlining Steered by Address Optimization Opportunities (MP, MM, FC), pp. 1072–1077.
VLDBVLDB-2002-Bosworth #data transformation #database #web
Data Routing Rather than Databases: The Meaning of the Next Wave of the Web Revolution to Data Management (AB).
ICSMEICSM-2002-MullerTH #programming
Two Controlled Experiments Concerning the Usefulness of Assertions as a Means for Programming (MMM, RT, OH), pp. 84–92.
CHICHI-2002-PirhonenBH #gesture #mobile
Gestural and audio metaphors as a means of control for mobile devices (AP, SAB, CH), pp. 291–298.
ICEISICEIS-2002-GharibMT #algorithm #clustering #using
High Dimensional Data Clustering Using SOFM And K-Means Algorithms (TFG, MGM, MFT), pp. 488–493.
CIKMCIKM-2002-HamerlyE #algorithm #clustering
Alternatives to the k-means algorithm that find better clusterings (GH, CE), pp. 600–607.
ICPRICPR-v2-2002-BazenG #modelling
Elastic Minutiae Matching by Means of Thin-Plate Spline Models (AMB, SHG), pp. 985–988.
ICPRICPR-v2-2002-Lu #robust #using
Block DCT-Based Robust Watermarking Using Side Information Extracted by Mean Filtering (CSL), pp. 1001–1004.
ICPRICPR-v3-2002-BoomgaardW #analysis #equivalence #estimation #on the #robust
On the Equivalence of Local-Mode Finding, Robust Estimation and Mean-Shift Analysis as Used in Early Vision Tasks (RvdB, JvdW), pp. 927–930.
ICPRICPR-v3-2002-OngRV #gesture
Deciphering Layered Meaning in Gestures (SCWO, SR, YVV), p. 815–?.
ICPRICPR-v4-2002-JiangBAK #string
Curve Morphing by Weighted Mean of Strings (XJ, HB, KA, AK), p. 192–?.
ICPRICPR-v4-2002-ZhangR #clustering #kernel #scalability
A Large Scale Clustering Scheme for Kernel K-Means (RZ, AIR), pp. 289–292.
ICPRICPR-v4-2002-ZhuJFL #eye tracking #information retrieval #realtime
Combining Kalman Filtering and Mean Shift for Real Time Eye Tracking under Active IR Illumination (ZZ, QJ, KF, KL), p. 318–?.
ICSEICSE-2002-BlausteinOB #graph #sequence chart
Observing timed systems by means of message sequence chart graphs (SB, FO, VAB), p. 707.
ICSEICSE-2002-JandlRSG #corba #enterprise #integration
Enterprise application integration by means of a generic CORBA LDAP gateway (MJ, WR, AS, KMG), p. 711.
DATEDATE-2001-CabodiCQ #process
Biasing symbolic search by means of dynamic activity profiles (GC, PC, SQ), pp. 9–15.
ITiCSEITiCSE-2001-WilsonPS #distance #online #student
On-line dynamic interviews (ODIN): a means of overcoming distance in student-teacher relations (LW, JAP, RLS), p. 178.
CSMRCSMR-2001-EisenbarthKS #component #concept analysis
Derivation of Feature Component Maps by Means of Concept Analysis (TE, RK, DS), pp. 176–179.
CIAACIAA-2001-DubernardG #automaton #finite #generative #scheduling
Scheduling Hard Sporadic Tasks by Means of Finite Automata and Generating Functions (JPD, DG), pp. 87–100.
VISSOFTSVIS-2001-KorhonenST #algorithm #comprehension #testing #visualisation
Understanding Algorithms by Means of Visualized Path Testing (AK, ES, JT), pp. 256–268.
ICMLICML-2001-WagstaffCRS #clustering
Constrained K-means Clustering with Background Knowledge (KW, CC, SR, SS), pp. 577–584.
SEKESEKE-2001-JorgensenIS #estimation #towards
Software effort estimation by analogy and regression toward the mean (MJ, UI, DIKS), pp. 268–274.
GPCEGCSE-2001-AttardiC #metaprogramming
Reflection Support by Means of Template Metaprogramming (GA, AC), pp. 118–127.
CCCC-2001-MartenaP #alias #analysis #model checking
Alias Analysis by Means of a Model Checker (VM, PSP), pp. 3–19.
IWPCIWPC-2000-Sneed #animation #comprehension
Source Animation as a Means of Program Comprehension (HMS), pp. 179–187.
ICEISICEIS-2000-Sato-Ilic #classification #fuzzy #relational
Classification Based on Relational Fuzzy C-Means for 3-Way Data (MSI), pp. 217–221.
ICEISICEIS-2000-Theaker #case study #industrial
Case Study: “Industry Strength” — It’s True Meaning for High-Tech SMEs (CJT), p. XLVI.
ICMLICML-2000-PellegM #clustering #estimation #named #performance
X-means: Extending K-means with Efficient Estimation of the Number of Clusters (DP, AWM), pp. 727–734.
ICPRICPR-v1-2000-NoordamBB #clustering #fuzzy #geometry #image #multi #segmentation
Geometrically Guided Fuzzy C-Means Clustering for Multivariate Image Segmentation (JCN, WHAMVdB, LMCB), pp. 1462–1465.
ICPRICPR-v2-2000-BaesensVVD #feature model #network #optimisation
Wrapped Feature Selection by Means of Guided Neural Network Optimization (BB, SV, JV, GD), pp. 2113–2116.
ICPRICPR-v2-2000-SelbBL #fuzzy
Fuzzy C-Means in an MDL-Framework (AS, HB, AL), pp. 2740–2743.
ICPRICPR-v2-2000-UgenaAA #independence #network #recognition #speech
Speaker-Independent Speech Recognition by Means of Functional-Link Neural Networks (AU, FdA, MEA), pp. 6018–6021.
ICPRICPR-v3-2000-AdamsSWG #named
MFDTs: Mean Field Dynamic Trees (NJA, AJS, CKIW, ZG), pp. 3151–3154.
SIGIRSIGIR-2000-AmentoTH #documentation #predict #quality #web
Does “authority” mean quality? predicting expert quality ratings of Web documents (BA, LGT, WCH), pp. 296–303.
REICRE-2000-AntonA #certification #requirements #what
What Do You Mean I’ve Been Practicing without a License? Certification and Licensing of Requirements Engineering Professionals (AIA, JMA), p. 151.
REICRE-2000-Mead00a #certification #requirements #what
What Do You Mean I’m Practicing without a License? Certification and Licensing of Requirements Engineering Professionals (NRM), p. 152.
SACSAC-2000-WuL #clustering #fuzzy #named #network
F3MCNN: A Fuzzy Minimum Mean Maximum Clustering Neural Network (LGW, HL), pp. 10–14.
DACDAC-1999-CabodiCQ #process #traversal
Improving Symbolic Traversals by Means of Activity Profiles (GC, PC, SQ), pp. 306–311.
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.
ICDARICDAR-1999-StefanoCM #algorithm #recognition
Handwritten Numeral Recognition by means of Evolutionary Algorithms (CDS, ADC, AM), pp. 804–807.
IWPCIWPC-1999-HarmanFHBD #approximate #decidability
Program Simplification as a Means of Approximating Undecidable Propositions (MH, CF, RMH, DB, SD), pp. 208–217.
CIAAWIA-1999-PaunT #finite #multi #transducer
Multiset Processing by Means of Systems of Finite State Transducers (GP, GT), pp. 140–157.
IFMIFM-1999-Mery #automaton #requirements
Requirements for a Temporal B — Assigning Temporal Meaning to Abstract Machines... and to Abstract Systems (DM), pp. 395–414.
HCIHCI-EI-1999-Imaz #design #interactive
Designing Interactions through Meaning (MI), pp. 1252–1256.
HCIHCI-EI-1999-MachateS #gesture #interactive
Let Your Hands Talk — Gestures as a Means of Interaction (JM, SS), pp. 291–295.
HCIHCI-EI-1999-Matsuda #algorithm #ambiguity #search-based
Genetic Algorithm (GA) as a Means of Ambiguous Decision Support by AHP (NM), pp. 764–768.
EDOCEDOC-1999-Persson #ontology
Shibboleth of many meanings. An essay on the ontology of business objects (EP), pp. 2–17.
ECIRACIR-1999-ThornleyL #information retrieval
IR and the Dialectic of Meaning (CT, RL).
KDDKDD-1999-PellegM #algorithm #geometry #reasoning
Accelerating Exact k-means Algorithms with Geometric Reasoning (DP, AWM), pp. 277–281.
MLDMMLDM-1999-Jahn #image #learning #preprocessor
Unsupervised Learning of Local Mean Gray Values for Image Pre-processing (HJ), pp. 64–74.
TOOLSTOOLS-USA-1999-DeugoOAW #communication #component
Communication as a Means to Differentiate Objects, Components and Agents (DD, FO, BA, MW), pp. 376–386.
CSMRCSMR-1998-CalzolariTA #maintenance #modelling
Modeling Maintenance Effort by Means of Dynamic Systems (FC, PT, GA), pp. 150–156.
ICMLICML-1998-BradleyF #clustering
Refining Initial Points for K-Means Clustering (PSB, UMF), pp. 91–99.
ICPRICPR-1998-WakaharaO #clustering
Extended mean shift in handwriting clustering (TW, KO), pp. 384–388.
KRKR-1998-Mani #formal method #problem
A Theory of Granularity and its Application to Problems of Polysemy and Underspecification of Meaning (IM), pp. 245–257.
ICTSSIWTCS-1998-Grunsky #automaton #testing
Testing of Automata: From Experiments to Representations by Means of Fragments (ISG), pp. 3–14.
DATEEDTC-1997-BoglioloBM #adaptation #behaviour #modelling
Adaptive least mean square behavioral power modeling (AB, LB, GDM), pp. 404–410.
CSEETCSEET-1997-Mayr #education #enterprise #re-engineering
Teaching Software Engineering by Means of a “Virtual Enterprise” (HM), pp. 176–184.
HCIHCI-SEC-1997-BlanchonF #what
Asking Users About What They Mean: Two Experiments & Results (HB, LF), pp. 609–612.
HCIHCI-SEC-1997-ShiozawaM #interactive #visualisation
WWW Visualization Giving Meanings to Interactive Manipulations (HS, YM), pp. 791–794.
TOOLSTOOLS-PACIFIC-1997-Hoffman #analysis #object-oriented
A Practical Notation for Object Oriented Analysis with a Formal Meaning (JH), pp. 225–237.
ASEKBSE-1996-Jr.B #algebra #algorithm #synthesis
Synthesis of Local Search Algorithms by Algebraic Means (RPGJ, PDB), p. 7.
TACASTACAS-1996-DamonJ #performance #specification
Efficient Search as a Means of Executing Specifications (CD, DJ), pp. 70–86.
ICALPICALP-1996-Glabbeek #specification
The Meaning of Negative Premises in Transition System Specifications II (RJvG), pp. 502–513.
ICALPICALP-1996-Raymond #data flow #network #regular expression
Recognizing Regular Expressions by Means of Dataflow Networks (PR), pp. 336–347.
ICMLICML-1996-Saerens #fault #learning
Non Mean Square Error Criteria for the Training of Learning Machines (MS), pp. 427–434.
ICPRICPR-1996-AkhmetshinL #difference #fourier #image #principle #re-engineering
The reconstruction of signals and images from the noisy Fourier transform phase by means of the generalized difference principle (AMA, IL), pp. 370–375.
ICPRICPR-1996-FinchWH #relational
Relational matching with mean field annealing (AMF, RCW, ERH), pp. 359–363.
ICPRICPR-1996-Zhao0C #image #segmentation
Simplified Gaussian and mean curvatures to range image segmentation (CZ, DZ, YC), pp. 427–431.
DACDAC-1995-KruiskampL #algorithm #named #search-based #synthesis
DARWIN: CMOS Opamp Synthesis by Means of a Genetic Algorithm (WK, DL), pp. 433–438.
ICDARICDAR-v2-1995-BraunCGM #image #preprocessor
Preprocessing raw binary images by means of contours (AB, TC, JMG, EM), pp. 640–643.
ICDARICDAR-v2-1995-Zarri #approach #documentation #information management #knowledge-based #representation
The “Narrative Knowledge Representation Language”, a knowledge-based approach for representing the “meaning” of textual documents (GPZ), pp. 545–548.
RTARTA-1995-Burghardt #set
Regular Substitution Sets: A Means of Controlling E-Unification (JB), pp. 382–396.
ESOPESOP-1994-Amtoft #fixpoint #re-engineering
Local Type Reconstruction by Means of Symbolic Fixed Point Iteration (TA), pp. 43–57.
SASSAS-1994-HalbwachsPR #approximate #hybrid #linear #verification
Verification of Linear Hybrid Systems by Means of Convex Approximations (NH, YEP, PR), pp. 223–237.
CSCWCSCW-1994-KatzenbergM #summary
Meaning-Making in the Creation of Useful Summary Reports (BK, JPM), pp. 199–206.
ICMLICML-1994-GiordanaSZ #algorithm #concept #learning #search-based
Learning Disjunctive Concepts by Means of Genetic Algorithms (AG, LS, FZ), pp. 96–104.
KRKR-1994-Rao #formal method #recognition #towards
Means-End Plan Recognition — Towards a Theory of Reactive Recognition (ASR), pp. 497–508.
ECOOPECOOP-1994-Pree #design #object-oriented #reuse
Meta Patterns — A Means For Capturing the Essentials of Reusable Object-Oriented Design (WP), pp. 150–162.
ICLPICLP-1994-JacquetM #named
PP-clauses: A Means for Handling Resources (JMJ, LM), p. 743.
SASWSA-1993-MaffeisG #architecture #dependence
Combining Dependability with Architectural Adatability by Means of the SIGNAL Language (OM, PLG), pp. 99–110.
ICMLICML-1993-DattaK #concept #learning #multi
Concept Sharing: A Means to Improve Multi-Concept Learning (PD, DFK), pp. 89–96.
PPDPPLILP-1993-CorsiniMRC #abstract interpretation #bottom-up #constraints #finite #performance #prolog #theorem proving
Efficient Bottom-up Abstract Interpretation of Prolog by Means of Constraint Solving over Symbolic Finite Domains (MMC, KM, AR, BLC), pp. 75–91.
FSEFSE-1993-Bergadano #generative #learning #testing
Test Case Generation by Means of Learning Techniques (FB), pp. 149–162.
FSEFSE-1993-Griswold #data flow
Direct Update of Data Flow Representations for a Meaning-Preserving Program Restructuring Tool (WGG), pp. 42–55.
ICLPICLP-1993-CorsiniR #analysis #fault #safety
Safety Analysis by Means of Fault Trees: An Application for Open Boolean Solvers (MMC, AR), p. 834.
CSCWCSCW-1992-KuuttiA #concept #identification #process
Identifying Potential CSCW Applications by Means of Activity Theory Concepts: A Case Example (KK, TA), pp. 233–240.
ICALPICALP-1991-BolG #specification
The Meaning of Negative Premises in Transition System Specifications (RNB, JFG), pp. 481–494.
PPDPPLILP-1991-Ait-KaciP #towards
Towards a Meaning of LIFE (HAK, AP), pp. 255–274.
ICLPICLP-1991-Lever #proving
Proving Program Properties by Means of SLS-Resolution (JML), pp. 614–628.
ICMLML-1989-YangF #clustering #concept
Conceptual Clustering of Mean-Ends Plans (HY, DHF), pp. 232–234.
SIGMODSIGMOD-1987-StempleMS #design #feedback #on the #transaction
On the Modes and Meaning of Feedback to Transaction Designers (DWS, SM, TS), pp. 374–386.
HCIHCI-CE-1987-Tominaga #specification
A Computer Method for Specifying Colors by Means of Color Naming (ST), pp. 131–138.
POPLPOPL-1985-Lamport #concurrent #specification #what #why
What It Means for a Concurrent Program to Satisfy a Specification: Why No One Has Specified Priority (LL), pp. 78–83.
ICSEICSE-1985-PottsBCM #design #simulation #specification #validation
Discrete Event Simulation as a Means of Validating JSD Design Specifications (CP, AB, BHC, RM), pp. 119–127.
PODSPODS-1984-TaySG #database #performance
A Mean Value Performance Model for Locking in Databases: The Waiting Case (YCT, RS, NG), pp. 311–322.
ICALPICALP-1984-Bidoit #algebra #equation #exception #fault #specification
Algebraic Specification of Exception Handling and Error Recovery by Means of Declarations and Equations (MB), pp. 95–108.
ICSEICSE-1984-MiliD #verification
A System for Classifying Program Verification Methods: Assigning Meanings to Program Verification Methods (AM, JD), pp. 499–509.
POPLPOPL-1982-Komorowski #data type #implementation #partial evaluation #prolog
Partial Evaluation as a Means for Inferencing Data Structures in an Applicative Language: A Theory and Implementation in the Case of Prolog (HJK), pp. 255–267.
ICALPICALP-1980-BergstraT #data type #equation #finite #specification
A Characterisation of Computable Data Types by Means of a Finite Equational Specification Method (JAB, JVT), pp. 76–90.
CCSDCG-1980-Madsen #attribute grammar #on the #semantics
On defining semantics by means of extended attribute grammars (OLM), pp. 259–299.
SIGMODSIGMOD-1979-Codd #database #relational
Extending the Data Base Relational Model to Capture More Meaning (Abstract) (EFC), p. 161.
DACDAC-1978-Kleine #automation #design #documentation #process
Automating the software design process by means of software design and documentation language (HK), pp. 371–379.
ICALPICALP-1977-Dieterich #context-free grammar #fault #parsing
Parsing and Syntactic Error Recovery for Context-Free Grammars by Means of Coarse Structures (EWD), pp. 180–192.
SOSPSOSP-1973-BrunoCS #independence #scheduling
Scheduling Independent Tasks to Reduce Mean Finishing Time (Extended Abstract) (JLB, EGCJ, RS), pp. 102–103.

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.