BibSLEIGH — random tag

random

random

Tag #random

910 papers:

POPL-2020-WangFCDX #probability #proving #source code #termination: Proving expected sensitivity of probabilistic programs with randomized variable-dependent termination time (PW, HF0, KC, YD, MX), p. 30.
CoG-2019-Sovrano #experience #network: Combining Experience Replay with Exploration by Random Network Distillation (FS), pp. 1–8.
CIKM-2019-ChenSTCS #network #performance: Fast and Accurate Network Embeddings via Very Sparse Random Projection (HC, SFS, YT, MC, SS), pp. 399–408.
CIKM-2019-FujiwaraIKKAU #algorithm #bound #incremental #performance: Fast Random Forest Algorithm via Incremental Upper Bound (YF, YI, SK, AK, JA, NU), pp. 2205–2208.
CIKM-2019-HeSLJPP #named #network: HeteSpaceyWalk: A Heterogeneous Spacey Random Walk for Heterogeneous Information Network Embedding (YH, YS, JL, CJ, JP, HP), pp. 639–648.
CIKM-2019-IslamLL00 #classification #semantics: A Semantics Aware Random Forest for Text Classification (MZI, JL, JL, LL0, WK0), pp. 1061–1070.
CIKM-2019-YanLWLWZG #classification #image #multi #using: Imbalance Rectification in Deep Logistic Regression for Multi-Label Image Classification Using Random Noise Samples (WY, RL, JW, YL, JW, PZ, XG), pp. 1131–1140.
ICML-2019-AssadiBM #composition #distributed: Distributed Weighted Matching via Randomized Composable Coresets (SA, MB, VSM), pp. 333–343.
ICML-2019-BeatsonA #optimisation #performance: Efficient optimization of loops and limits with randomized telescoping sums (AB, RPA), pp. 534–543.
ICML-2019-ChitraR: Random Walks on Hypergraphs with Edge-Dependent Vertex Weights (UC, BJR), pp. 1172–1181.
ICML-2019-ClemenconLB #on the: On Medians of (Randomized) Pairwise Means (SC, PL, PB), pp. 1272–1281.
ICML-2019-CohenRK #robust: Certified Adversarial Robustness via Randomized Smoothing (JMC, ER, JZK), pp. 1310–1320.
ICML-2019-HaochenS #finite: Random Shuffling Beats SGD after Finite Epochs (JH, SS), pp. 2624–2633.
ICML-2019-LiTOS #analysis #fourier #towards: Towards a Unified Analysis of Random Fourier Features (ZL, JFT, DO, DS), pp. 3905–3914.
ICML-2019-Maheswaranathan: Guided evolutionary strategies: augmenting random search with surrogate gradients (NM, LM, GT, DC, JSD), pp. 4264–4273.
ICML-2019-OprescuSW #orthogonal: Orthogonal Random Forest for Causal Inference (MO, VS, ZSW), pp. 4932–4941.
ICML-2019-TiomokoCBG #estimation #matrix #metric #scalability: Random Matrix Improved Covariance Estimation for a Large Class of Metrics (MT, RC, FB, GG), pp. 6254–6263.
ICML-2019-WangCAD #estimation #learning #policy: Random Expert Distillation: Imitation Learning via Expert Policy Support Estimation (RW, CC, PVA, YD), pp. 6536–6544.
ICML-2019-WangZ0Q #learning #recommendation #robust: Doubly Robust Joint Learning for Recommendation on Data Missing Not at Random (XW, RZ0, YS0, JQ0), pp. 6638–6647.
ICML-2019-ZhangL #incremental #kernel #learning #online #sketching: Incremental Randomized Sketching for Online Kernel Learning (XZ, SL), pp. 7394–7403.
ICML-2019-ZhangP #correlation #modelling: Random Function Priors for Correlation Modeling (AZ, JWP), pp. 7424–7433.
ICML-2019-ZhangX #incremental: A Composite Randomized Incremental Gradient Method (JZ, LX), pp. 7454–7462.
KDD-2019-GaoPH #graph #network: Conditional Random Field Enhanced Graph Convolutional Neural Networks (HG, JP, HH), pp. 276–284.
KDD-2019-HuangSLH #graph #network: Graph Recurrent Networks With Attributed Random Walks (XH, QS, YL, XH), pp. 732–740.
KDD-2019-LiST #classification #higher-order #markov #multi #network #predict: Multi-task Recurrent Neural Networks and Higher-order Markov Random Fields for Stock Price Movement Prediction: Multi-task RNN and Higer-order MRFs for Stock Price Classification (CL, DS, DT), pp. 1141–1151.
KDD-2019-RolnickAPKMN #clustering #design: Randomized Experimental Design via Geographic Clustering (DR, KA, JPA, SK, VSM, AN), pp. 2745–2753.
KDD-2019-WuYHZX0JA #kernel #performance #string: Efficient Global String Kernel with Random Features: Beyond Counting Substructures (LW, IEHY, SH, LZ0, KX, LM0, SJ, CCA), pp. 520–528.
KDD-2019-WuYZXZPXA #graph #kernel #scalability #using: Scalable Global Alignment Graph Kernel Using Random Features: From Node Embedding to Graph Embedding (LW, IEHY, ZZ0, KX, LZ0, XP0, YX, CCA), pp. 1418–1428.
POPL-2019-TassarottiH #concurrent #logic #source code: A separation logic for concurrent randomized programs (JT, RH0), p. 30.
ICSE-2019-JoshiFM #algorithm #approximate #profiling #source code #statistics: Statistical algorithmic profiling for randomized approximate programs (KJ, VF, SM), pp. 608–618.
ICSE-2019-YangZSS00X #debugging #difference #test coverage #testing #tool support: Hunting for bugs in code coverage tools via randomized differential testing (YY, YZ, HS, ZS, ZZ0, LX0, BX), pp. 488–498.
CASE-2019-ImaniCT0 #analysis #modelling: Random Forest Modeling for Survival Analysis of Cancer Recurrences (FI, RC, CT, HY0), pp. 399–404.
CASE-2019-ZhangH #modelling #optimisation: Enhancing Random Search with Surrogate Models for Lipschitz Continuous Optimization (QZ, JH), pp. 768–773.
SANER-2018-JayM #difference #testing: Structured random differential testing of instruction decoders (NJ, BPM), pp. 84–94.
CIAA-2018-BerlinkovN #automaton: Synchronizing Random Almost-Group Automata (MVB, CN), pp. 84–96.
IFM-2018-DimjasevicHLR #object-oriented #testing: Study of Integrating Random and Symbolic Testing for Object-Oriented Software (MD, FH, KSL, ZR), pp. 89–109.
ICFP-2018-WandCGC #equivalence #probability #recursion: Contextual equivalence for a probabilistic language with continuous random variables and recursion (MW, RC, TG, AC), p. 30.
DiGRA-2018-NielsenG #game studies #video: Are Loot Boxes Gambling? Random reward mechanisms in video games (RKLN, PG).
CIKM-2018-SunZY #encoding #privacy: Randomized Bit Vector: Privacy-Preserving Encoding Mechanism (LS, LZ, XY), pp. 1263–1272.
ICML-2018-BojchevskiSZG #generative #graph #named: NetGAN: Generating Graphs via Random Walks (AB, OS, DZ, SG), pp. 609–618.
ICML-2018-DiakonikolasO #coordination: Alternating Randomized Block Coordinate Descent (JD, LO), pp. 1232–1240.
ICML-2018-DoikovR #polynomial: Randomized Block Cubic Newton Method (ND, PR), pp. 1289–1297.
ICML-2018-HaghiriGL: Comparison-Based Random Forests (SH, DG, UvL), pp. 1866–1875.
ICML-2018-KangP: Improving Sign Random Projections With Additional Information (KK, WWP), pp. 2484–2492.
ICML-2018-LiaoC #on the: On the Spectrum of Random Features Maps of High Dimensional Data (ZL, RC), pp. 3069–3077.
ICML-2018-LiaoC18a #approach #learning #matrix: The Dynamics of Learning: A Random Matrix Approach (ZL, RC), pp. 3078–3087.
ICML-2018-LopesWM #algorithm #estimation #fault: Error Estimation for Randomized Least-Squares Algorithms via the Bootstrap (MEL, SW, MWM), pp. 3223–3232.
ICML-2018-SharmaNK #clique #problem #using: Solving Partial Assignment Problems using Random Clique Complexes (CS, DN, MK), pp. 4593–4602.
ICML-2018-SibliniMK #clustering #learning #multi #performance: CRAFTML, an Efficient Clustering-based Random Forest for Extreme Multi-label Learning (WS, FM, PK), pp. 4671–4680.
ICML-2018-Sinha #clustering #matrix #using: K-means clustering using random matrix sparsification (KS), pp. 4691–4699.
ICML-2018-ZhaoX #modelling: Composite Marginal Likelihood Methods for Random Utility Models (ZZ, LX), pp. 5917–5926.
ICPR-2018-00040MLZLY #segmentation: A Method for PET-CT Lung Cancer Segmentation based on Improved Random Walk (ZL0, YS0, CM, QL, YZ, HL, DY), pp. 1187–1192.
ICPR-2018-ChoiCT #authentication #mobile #network #probability: One-class Random Maxout Probabilistic Network for Mobile Touchstroke Authentication (SC, IC, ABJT), pp. 3359–3364.
ICPR-2018-DangCLOT #approach: A randomized hierarchical trees indexing approach for camera-based information spotting (QBD, MC, MML, JMO, CDT), pp. 3692–3697.
ICPR-2018-KurzendorferBSB #analysis #classification #segmentation #using: Myocardial Scar Segmentation in LGE-MRI using Fractal Analysis and Random Forest Classification (TK, KB, SS, AB, CF, AKM), pp. 3168–3173.
ICPR-2018-NabilIMSQS #detection #network: Deep Recurrent Electricity Theft Detection in AMI Networks with Random Tuning of Hyper-parameters (MN, MI0, MMEAM, MS, KAQ, ES), pp. 740–745.
ICPR-2018-UchiyamaO: Transparent Random Dot Markers (HU, YO), pp. 254–259.
ICPR-2018-WangXS #music #semantics: Semantic Music Annotation by Label-Specific Conditional Random Fields (QW, YX, FS), pp. 2941–2946.
ICPR-2018-XuCG #learning #modelling #multi #using: Common Random Subgraph Modeling Using Multiple Instance Learning (TX, DKYC, IG), pp. 1205–1210.
KDD-2018-GiesekeI: Training Big Random Forests with Little Resources (FG, CI), pp. 1445–1454.
KDD-2018-PangCCL #detection #learning: Learning Representations of Ultrahigh-dimensional Data for Random Distance-based Outlier Detection (GP, LC, LC, HL), pp. 2041–2050.
KDD-2018-Pouget-AbadieMP #clustering #optimisation: Optimizing Cluster-based Randomized Experiments under Monotonicity (JPA, VSM, DCP, EMA), pp. 2090–2099.
KDD-2018-WuCYXXA #clustering #scalability #using: Scalable Spectral Clustering Using Random Binning Features (LW, PYC, IEHY, FX, YX, CCA), pp. 2506–2515.
OOPSLA-2018-OzkanMNBW #distributed #probability #testing: Randomized testing of distributed systems with probabilistic guarantees (BKO, RM, FN, MTB, GW), p. 28.
PLATEAU-2018-UesbeckS #database #programming: A Randomized Controlled Trial on the Impact of Polyglot Programming in a Database Context (PMU, AS), p. 8.
CASE-2018-SahuguedeFCL: Mapping Chronicles to a $k$-dimensional Euclidean Space via Random Projections (AS, SF, ELC, MVLL), pp. 1177–1182.
CASE-2018-SpenrathP #heuristic #network #using: Using Neural Networks for Heuristic Grasp Planning in Random Bin Picking (FS, AP), pp. 258–263.
CAV-2018-BauerCS0 #model checking #protocol #security: Model Checking Indistinguishability of Randomized Security Protocols (MSB, RC, APS, MV0), pp. 117–135.
TAP-2018-BernardHK #approach #approximate #modelling #scalability: An Approximation-Based Approach for the Random Exploration of Large Models (JB0, PCH, OK), pp. 27–43.
Haskell-2017-LampropoulosSF #functional: Ode on a random urn (functional pearl) (LL, ASZ, KF), pp. 26–37.
AIIDE-2017-ClarkF #performance #scalability #search-based: Fast Random Genetic Search for Large-Scale RTS Combat Scenarios (CC, AF), pp. 165–171.
ICML-2017-AvronKMMVZ #approximate #bound #fourier #kernel #statistics: Random Fourier Features for Kernel Ridge Regression: Approximation Bounds and Statistical Guarantees (HA, MK, CM, CM, AV, AZ), pp. 253–262.
ICML-2017-CutajarBMF #process: Random Feature Expansions for Deep Gaussian Processes (KC, EVB, PM, MF), pp. 884–893.
ICML-2017-LeeHGJC #graph: Bayesian inference on random simple graphs with power law degree distributions (JL, CH, ZG, LFJ, SC), pp. 2004–2013.
ICML-2017-PenningtonB #geometry #matrix #network: Geometry of Neural Network Loss Surfaces via Random Matrix Theory (JP, YB), pp. 2798–2806.
ICML-2017-RubinsteinA #difference #privacy: Pain-Free Random Differential Privacy with Sensitivity Sampling (BIPR, FA), pp. 2950–2959.
ICML-2017-ZhouLZ #equilibrium #game studies #identification #nash: Identify the Nash Equilibrium in Static Games with Random Payoffs (YZ, JL, JZ0), pp. 4160–4169.
KDD-2017-Li #fourier #kernel #normalisation: Linearized GMM Kernels and Normalized Random Fourier Features (PL0), pp. 315–324.
KDD-2017-SaveskiPSDGXA #detection #network: Detecting Network Effects: Randomizing Over Randomized Experiments (MS, JPA, GSJ, WD, SG, YX, EMA), pp. 1027–1035.
KDD-2017-SpringS #learning #scalability: Scalable and Sustainable Deep Learning via Randomized Hashing (RS, AS), pp. 445–454.
KDD-2017-WangAL #kernel #performance #re-engineering: Randomized Feature Engineering as a Fast and Accurate Alternative to Kernel Methods (SW, CCA, HL0), pp. 485–494.
Onward-2017-LamZC #generative #interactive #named #testing: ChimpCheck: property-based randomized test generation for interactive apps (ESLL, PZ, BYEC), pp. 58–77.
LOPSTR-2017-Barany #generative: Liveness-Driven Random Program Generation (GB), pp. 112–127.
ASE-2017-Abdelrasoul #order #scheduling #using: Promoting secondary orders of event pairs in randomized scheduling using a randomized stride (MA), pp. 741–752.
ESEC-FSE-2017-OhBMS #product line: Finding near-optimal configurations in product lines by random sampling (JO, DSB, MM, NS), pp. 61–71.
CASE-2017-BaeM #markov #multi: Markovian property for the delays in multiclass deterministic flow lines with random arrivals (SYB, JRM), pp. 729–730.
ESOP-2017-CulpepperC #equivalence #probability #source code: Contextual Equivalence for Probabilistic Programs with Continuous Random Variables and Scoring (RC, AC), pp. 368–392.
SANER-2016-MendesVHS #identification #using: Identifying Utility Functions Using Random Forests (TM, MTV, ACH, AS), pp. 614–618.
FSCD-2016-OostromT #normalisation: Normalisation by Random Descent (VvO, YT), p. 18.
Haskell-2016-GriecoCB #automation #fuzzing #named: QuickFuzz: an automatic random fuzzer for common file formats (GG, MC, PB), pp. 13–20.
CIG-2016-CazenaveLTT #game studies #learning #using: Learning opening books in partially observable games: Using random seeds in Phantom Go (TC, JL0, FT, OT), pp. 1–7.
DiGRA-FDG-2016-SoaresLPM #approach #geometry: Rapidly-Exploring Random Tree approach for Geometry Friends (RS, FL, RP, FSM).
CIKM-2016-LiuLLC #composition #named #personalisation #rank #scalability: PowerWalk: Scalable Personalized PageRank via Random Walks with Vertex-Centric Decomposition (QL, ZL, JCSL, JC), pp. 195–204.
ICML-2016-AdamsSTPKM #data type #smarttech: Hierarchical Span-Based Conditional Random Fields for Labeling and Segmenting Events in Wearable Sensor Data Streams (RJA, NS, ET, AP, SK0, BMM), pp. 334–343.
ICML-2016-CouilletWAS #approach #matrix #network: A Random Matrix Approach to Echo-State Neural Networks (RC, GW, HTA, HS), pp. 517–525.
ICML-2016-GuhaMRS #detection #robust: Robust Random Cut Forest Based Anomaly Detection on Streams (SG, NM, GR, OS), pp. 2712–2721.
ICML-2016-OsbandRW: Generalization and Exploration via Randomized Value Functions (IO, BVR, ZW), pp. 2377–2386.
ICML-2016-PandeyD #metric #on the #representation: On collapsed representation of hierarchical Completely Random Measures (GP0, AD), pp. 1605–1613.
ICPR-2016-AydinKAA #automation #predict #using: Automatic personality prediction from audiovisual data using random forest regression (BA, AAK, OA, LA), pp. 37–42.
ICPR-2016-CarbonneauGG #identification #learning #multi #using: Witness identification in multiple instance learning using random subspaces (MAC, EG, GG), pp. 3639–3644.
ICPR-2016-HosseinKhaniKSH #image #realtime: Real-time removal of random value impulse noise in medical images (ZH, NK, SMRS, MH, SS, KW, KN), pp. 3916–3921.
ICPR-2016-KimuraKSK #classification #multi #performance #scalability: Fast random k-labELsets for large-scale multi-label classification (KK, MK, LS, SK), pp. 438–443.
ICPR-2016-Nakazawa #image #using: Noise stable image registration using RANdom RESAmple Consensus (AN), pp. 853–858.
ICPR-2016-PrasathKOGHSP #classification #segmentation #using: HEp-2 cell classification and segmentation using motif texture patterns and spatial features with random forests (VBSP, YMK, ZAO, JBG, AH, GS, KP), pp. 90–95.
ICPR-2016-RakicevicRPP #estimation #multi: Multi-modal Neural Conditional Ordinal Random Fields for agreement level estimation (NR, OR, SP, MP), pp. 2228–2233.
ICPR-2016-VinhEPBLR #modelling #robust #using: Training robust models using Random Projection (XVN, SME, SP, JB0, CL, KR), pp. 531–536.
ICPR-2016-YeZL #classification #documentation #network #online: Joint training of conditional random fields and neural networks for stroke classification in online handwritten documents (JYY, YMZ, CLL), pp. 3264–3269.
KDD-2016-AlvesAM: Burstiness Scale: A Parsimonious Model for Characterizing Random Series of Events (RAdSA, RMA, POSVdM), pp. 1405–1414.
KDD-2016-WuYCY #convergence #performance: Revisiting Random Binning Features: Fast Convergence and Strong Parallelizability (LW, IEHY, JC, RY), pp. 1265–1274.
CASE-2016-FaalO #algorithm: Regionally Growing Random Trees: A synergistic motion planning and control algorithm for dynamic systems (SGF, CDO), pp. 141–147.
CASE-2016-HaradaWTKNO: Initial experiments on learning-based randomized bin-picking allowing finger contact with neighboring objects (KH, WW, TT, KK, KN, HO), pp. 1196–1202.
CAV-2016-LinR #liveness: Liveness of Randomised Parameterised Systems under Arbitrary Schedulers (AWL, PR), pp. 112–133.
HT-2015-WeningerJG #case study: Random Voting Effects in Social-Digital Spaces: A Case Study of Reddit Post Submissions (TW, TJJ, MG), pp. 293–297.
SIGMOD-2015-ShinJSK #approach #graph #named #scalability: BEAR: Block Elimination Approach for Random Walk with Restart on Large Graphs (KS, JJ, LS, UK), pp. 1571–1585.
EDM-2015-LangHOW #student: The Impact of Incorporating Student Confidence Items into an Intelligent Tutor: A Randomized Controlled Trial (CL, NTH, KO, YW), pp. 144–149.
EDM-2015-SalesP #algebra #effectiveness: Exploring Causal Mechanisms in a Randomized Effectiveness Trial of the Cognitive Tutor Algebra I Program (AS, JP), pp. 504–507.
CIAA-2015-HeamJ #automaton #generative #morphism #on the: On the Uniform Random Generation of Non Deterministic Automata Up to Isomorphism (PCH, JLJ), pp. 140–152.
CIAA-2015-HeamJ15a #automaton #generative #realtime: Random Generation and Enumeration of Accessible Deterministic Real-Time Pushdown Automata (PCH, JLJ), pp. 153–164.
ICALP-v1-2015-AgrawalIKP #complexity #encoding #perspective #statistics: Statistical Randomized Encodings: A Complexity Theoretic View (SA, YI, DK, APC), pp. 1–13.
ICALP-v1-2015-Avigdor-Elgrabli #on the #order: On the Randomized Competitive Ratio of Reordering Buffer Management with Non-Uniform Costs (NAE, SI, BM, YR), pp. 78–90.
ICALP-v1-2015-BjorklundDH #exponential #problem #set #strict: The Parity of Set Systems Under Random Restrictions with Applications to Exponential Time Problems (AB, HD, TH), pp. 231–242.
ICALP-v2-2015-FriedrichK #graph #on the: On the Diameter of Hyperbolic Random Graphs (TF, AK), pp. 614–625.
LATA-2015-DaiW #algorithm #parallel #sequence: A Parallel Algorithm for Finding All Minimal Maximum Subsequences via Random Walk (HKD, ZW), pp. 133–144.
CHI-2015-Al-AmeenWS #multi #towards: Towards Making Random Passwords Memorable: Leveraging Users’ Cognitive Ability Through Multiple Cues (MNAA, MKW, SS), pp. 2315–2324.
HCI-IT-2015-SakoNK #estimation: Violin Fingering Estimation According to the Performer’s Skill Level Based on Conditional Random Field (SS, WN, TK), pp. 485–494.
ICML-2015-EneN #coordination: Random Coordinate Descent Methods for Minimizing Decomposable Submodular Functions (AE, HLN), pp. 787–795.
ICML-2015-JerniteRS #approach #learning #markov #modelling #performance: A Fast Variational Approach for Learning Markov Random Field Language Models (YJ, AMR, DS), pp. 2209–2217.
ICML-2015-NanWS: Feature-Budgeted Random Forest (FN, JW, VS), pp. 1983–1991.
ICML-2015-NutiniSLFK #coordination #performance: Coordinate Descent Converges Faster with the Gauss-Southwell Rule Than Random Selection (JN, MWS, IHL, MPF, HAK), pp. 1632–1641.
ICML-2015-RaskuttiM #algorithm #sketching #statistics: Statistical and Algorithmic Perspectives on Randomized Sketching for Ordinary Least-Squares (GR, MM), pp. 617–625.
ICML-2015-TanseyPSR #exponential #markov #product line: Vector-Space Markov Random Fields via Exponential Families (WT, OHMP, ASS, PR), pp. 684–692.
ICML-2015-Yang0JZ15a #reduction: Theory of Dual-sparse Regularized Randomized Reduction (TY, LZ, RJ, SZ), pp. 305–314.
ICML-2015-ZhuE #approach #hybrid #probability #using: A Hybrid Approach for Probabilistic Inference using Random Projections (MZ, SE), pp. 2039–2047.
KDD-2015-CuiCHC: Optimal Action Extraction for Random Forests and Boosted Trees (ZC, WC, YH, YC), pp. 179–188.
KDD-2015-Kaban #bound: Improved Bounds on the Dot Product under Random Projection and Random Sign Projection (AK), pp. 487–496.
RecSys-2015-ChristoffelPNB #recommendation #scalability: Blockbusters and Wallflowers: Accurate, Diverse, and Scalable Recommendations with Random Walks (FC, BP, CN, AB), pp. 163–170.
SIGIR-2015-Carterette #effectiveness #testing: The Best Published Result is Random: Sequential Testing and its Effect on Reported Effectiveness (BC), pp. 747–750.
SIGIR-2015-DaiKC #distributed #how: How Random Decisions Affect Selective Distributed Search (ZD, YK, JC), pp. 771–774.
SIGIR-2015-NguyenKNZ #documentation #web: A Time-aware Random Walk Model for Finding Important Documents in Web Archives (TNN, NK, CN, XZ), pp. 915–918.
SIGIR-2015-SallesGRR #automation #classification #effectiveness #fault #named: BROOF: Exploiting Out-of-Bag Errors, Boosting and Random Forests for Effective Automated Classification (TS, MAG, VR, LCdR), pp. 353–362.
SIGIR-2015-TranTCN #optimisation #ranking #web: A Random Walk Model for Optimization of Search Impact in Web Frontier Ranking (GT, AT, BBC, WN), pp. 153–162.
SAC-2015-CalvagnaFT #case study #combinator #consistency #effectiveness #testing: Random versus combinatorial effectiveness in software conformance testing: a case study (AC, AF, ET), pp. 1797–1802.
SAC-2015-JeremicPM #array #performance: Improving random write performance in heterogeneous erasure-coded drive arrays by offloading code block requests (NJ, HP, GM), pp. 2007–2014.
CASE-2015-BaeM #markov #modelling #multi: Markovian modeling of multiclass deterministic flow lines with random arrivals: The case of a single-channel (SYB, JRM), pp. 649–654.
DAC-2015-RozicYDV #generative #performance: Highly efficient entropy extraction for true random number generators on FPGAs (VR, BY, WD, IV), p. 6.
DATE-2015-YangRMDV #embedded #framework #generative #on the fly #platform #testing: Embedded HW/SW platform for on-the-fly testing of true random number generators (BY, VR, NM, WD, IV), pp. 345–350.
ESOP-2015-FetscherCPHF #automation #generative #type system: Making Random Judgments: Automatically Generating Well-Typed Terms from the Definition of a Type-System (BF, KC, MHP, JH, RBF), pp. 383–405.
STOC-2015-AbbeSW #fault: Reed-Muller Codes for Random Erasures and Errors (EA, AS, AW), pp. 297–306.
STOC-2015-BitanskyGLPT #encoding: Succinct Randomized Encodings and their Applications (NB, SG, HL, RP, ST), pp. 439–448.
STOC-2015-Czumaj #network #permutation #using: Random Permutations using Switching Networks (AC), pp. 703–712.
STOC-2015-FeldmanPV #complexity #on the #problem #satisfiability: On the Complexity of Random Satisfiability Problems with Planted Solutions (VF, WP, SV), pp. 77–86.
STOC-2015-KorulaMZ #online #order: Online Submodular Welfare Maximization: Greedy Beats 1/2 in Random Order (NK, VSM, MZ), pp. 889–898.
STOC-2015-MirrokniZ #composition #distributed: Randomized Composable Core-sets for Distributed Submodular Maximization (VSM, MZ), pp. 153–162.
STOC-2015-Nikolov #problem: Randomized Rounding for the Largest Simplex Problem (AN), pp. 861–870.
ISSTA-2015-LeSS: Randomized stress-testing of link-time optimizers (VL, CS, ZS), pp. 327–337.
DRR-2014-TaoTX #documentation #learning #using: Document page structure learning for fixed-layout e-books using conditional random fields (XT, ZT, CX), p. ?–9.
SIGMOD-2014-WuJZ #graph #nearest neighbour #performance #query #scalability: Fast and unified local search for random walk based k-nearest-neighbor query in large graphs (YW, RJ, XZ), pp. 1139–1150.
VLDB-2014-YuMS #using: Reverse Top-k Search using Random Walk with Restart (AWY, NM, HS), pp. 401–412.
DLT-2014-Gusev #automaton: Synchronizing Automata with Random Inputs — (VVG), pp. 68–75.
ICALP-v1-2014-FouqueT #generative: Close to Uniform Prime Number Generation with Fewer Random Bits (PAF, MT), pp. 991–1002.
ICALP-v1-2014-Tzameret #algorithm #problem #satisfiability: Sparser Random 3-SAT Refutation Algorithms and the Interpolation Problem — (IT), pp. 1015–1026.
ICALP-v1-2014-Yin #graph: Spatial Mixing of Coloring Random Graphs (YY), pp. 1075–1086.
ICALP-v2-2014-GiakkoupisSS #graph: Randomized Rumor Spreading in Dynamic Graphs (GG, TS, AS), pp. 495–507.
LATA-2014-Khanna: Matchings, Random Walks, and Sampling (SK), pp. 32–33.
FLOPS-2014-ClaessenDP #generative: Generating Constrained Random Data with Uniform Distribution (KC, JD, MHP), pp. 18–34.
CIG-2014-LeeceJ #game studies #markov #modelling #using: Opponent state modeling in RTS games with limited information using Markov random fields (MAL, AJ), pp. 1–7.
CIKM-2014-GuoB #robust: Robust Entity Linking via Random Walks (ZG, DB), pp. 499–508.
ECIR-2014-MarcheggianiTE0 #aspect-oriented #mining #multi: Hierarchical Multi-label Conditional Random Fields for Aspect-Oriented Opinion Mining (DM, OT, AE, FS), pp. 273–285.
ICML-c1-2014-DenilMF: Narrowing the Gap: Random Forests In Theory and In Practice (MD, DM, NdF), pp. 665–673.
ICML-c1-2014-OrabonaHSJ #on the: On Measure Concentration of Random Maximum A-Posteriori Perturbations (FO, TH, ADS, TSJ), pp. 432–440.
ICML-c2-2014-0001MS: Coding for Random Projections (PL, MM, AS), pp. 676–684.
ICML-c2-2014-AhmedTBZDKB #detection: Hierarchical Conditional Random Fields for Outlier Detection: An Application to Detecting Epileptogenic Cortical Malformations (BA, TT, KB, YZ, OD, RK, CEB), pp. 1080–1088.
ICML-c2-2014-AnarakiH #memory management #performance: Memory and Computation Efficient PCA via Very Sparse Random Projections (FPA, SMH), pp. 1341–1349.
ICML-c2-2014-ChwialkowskiG #independence #kernel #process: A Kernel Independence Test for Random Processes (KC, AG), pp. 1422–1430.
ICML-c2-2014-HamidXGD: Compact Random Feature Maps (RH, YX, AG, DD), pp. 19–27.
ICML-c2-2014-KnowlesGP #infinity #metric #normalisation #using: A reversible infinite HMM using normalised random measures (DAK, ZG, KP), pp. 1998–2006.
ICML-c2-2014-Lopez-PazSSGS #analysis #component: Randomized Nonlinear Component Analysis (DLP, SS, AJS, ZG, BS), pp. 1359–1367.
ICML-c2-2014-MizrahiDF #learning #linear #markov #parallel: Linear and Parallel Learning of Markov Random Fields (YDM, MD, NdF), pp. 199–207.
ICPR-2014-AggarwalM #algorithm #metric #multi: Extension of Sparse Randomized Kaczmarz Algorithm for Multiple Measurement Vectors (HKA, AM), pp. 1014–1019.
ICPR-2014-BaecchiTSBB #recognition: Fisher Vectors over Random Density Forests for Object Recognition (CB, FT, LS, ADB, ADB), pp. 4328–4333.
ICPR-2014-CordellaSFF #classification #reliability: Random Forest for Reliable Pre-classification of Handwritten Characters (LPC, CDS, FF, ASdF), pp. 1319–1324.
ICPR-2014-Desrosiers #adaptation #approach #image #performance #segmentation: A Fast and Adaptive Random Walks Approach for the Unsupervised Segmentation of Natural Images (CD), pp. 130–135.
ICPR-2014-DuZCW #flexibility #learning #linear: Learning Flexible Binary Code for Linear Projection Based Hashing with Random Forest (SD, WZ, SC, YW), pp. 2685–2690.
ICPR-2014-GavriilidisT #classification #kernel #using: Random Walk Kernel Applications to Classification Using Support Vector Machines (VG, AT), pp. 3898–3903.
ICPR-2014-HeDY0PJ #multi #using #visual notation: Visual Tracking Using Multi-stage Random Simple Features (YH, ZD, MY, LC, MP, YJ), pp. 4104–4109.
ICPR-2014-HooKPC #comprehension #image #learning: Enhanced Random Forest with Image/Patch-Level Learning for Image Understanding (WLH, TKK, YP, CSC), pp. 3434–3439.
ICPR-2014-HusainDT #using: Recognizing Point Clouds Using Conditional Random Fields (FH, BD, CT), pp. 4257–4262.
ICPR-2014-KaradagV #image #markov: Fusion of Image Segmentations under Markov, Random Fields (ÖÖK, FTYV), pp. 930–935.
ICPR-2014-MaB #detection #incremental: Compound Exemplar Based Object Detection by Incremental Random Forest (KM, JBA), pp. 2407–2412.
ICPR-2014-OkadaFWP #analysis: Microenvironment-Based Protein Function Analysis by Random Forest (KO, LF, MW, DP), pp. 3138–3143.
ICPR-2014-PandaKC #graph #scalability #summary #using #video: Scalable Video Summarization Using Skeleton Graph and Random Walk (RP, SKK, ASC), pp. 3481–3486.
ICPR-2014-StraehleKKH #learning #multi: Multiple Instance Learning with Response-Optimized Random Forests (CNS, MK, UK, FAH), pp. 3768–3773.
ICPR-2014-TerissiPG #classification #using: Lip Reading Using Wavelet-Based Features and Random Forests Classification (LDT, MP, JCG), pp. 791–796.
ICPR-2014-WangCH #hybrid #markov #multi #using #video: Wide Baseline Multi-view Video Matting Using a Hybrid Markov Random Field (TW, JPC, AH), pp. 136–141.
KDD-2014-LuM #difference #estimation #exponential #graph #privacy: Exponential random graph estimation under differential privacy (WL, GM), pp. 921–930.
KDIR-2014-DomeniconiMMP #ontology: Discovering New Gene Functionalities from Random Perturbations of Known Gene Ontological Annotations (GD, MM, GM, PP), pp. 107–116.
KDIR-2014-KudamaL #semantics #using: Semantic Annotation of UMLS using Conditional Random Fields (SK, RBL), pp. 335–341.
SEKE-2014-ZhangCL #adaptation #sequence #testing: An Application of Adaptive Random Sequence in Test Case Prioritization (XZ, TYC, HL), pp. 126–131.
SIGIR-2014-LengCL #image #learning #retrieval #scalability: Random subspace for binary codes learning in large scale image retrieval (CL, JC, HL), pp. 1031–1034.
SIGIR-2014-ZhuNG #adaptation #learning #social: An adaptive teleportation random walk model for learning social tag relevance (XZ, WN, MG), pp. 223–232.
ICSE-2014-QiMLDW #automation #program repair: The strength of random search on automated program repair (YQ, XM, YL, ZD, CW), pp. 254–265.
SAC-2014-HuangCLWL #adaptation #interactive #testing: Adaptive random prioritization for interaction test suites (RH, JC, ZL, RW, YL), pp. 1058–1063.
DAC-2014-RahmanXFZST #generative #independence #named: TI-TRNG: Technology Independent True Random Number Generator (MTR, KX, DF, XZ, JS, MT), p. 6.
DAC-2014-SutariaRZRMC #modelling #simulation #validation: BTI-Induced Aging under Random Stress Waveforms: Modeling, Simulation and Silicon Validation (KS, AR, RZ, RR, YM, YC), p. 6.
DATE-2014-BanerjeeD #calculus #constraints #generative #realtime #sequence: Acceptance and random generation of event sequences under real time calculus constraints (KB, PD), pp. 1–6.
DATE-2014-MatsutaniKFKTKBMA #3d: Low-latency wireless 3D NoCs via randomized shortcut chips (HM, MK, IF, TK, YT, TK, PB, RM, HA), pp. 1–6.
PDP-2014-GogolevM #classification #network: Density Classification in Asynchronous Random Networks with Faulty Nodes (AG, LM), pp. 256–261.
STOC-2014-DingSS #satisfiability: Satisfiability threshold for random regular NAE-SAT (JD, AS, NS), pp. 814–822.
CAV-2014-0001A #invariant #using: From Invariant Checking to Invariant Inference Using Randomized Search (RS, AA), pp. 88–105.
LICS-CSL-2014-Khoussainov #infinity: A quest for algorithmically random infinite structures (BK), p. 9.
SAT-2014-Bulatov0 #approximate #satisfiability: Approximating Highly Satisfiable Random 2-SAT (AAB, CW), pp. 384–398.
DocEng-2013-SatkhozhinaAA #recognition #using: Optical font recognition using conditional random field (AS, IA, JPA), pp. 119–122.
ICDAR-2013-DelayeL #documentation #online: Graphics Extraction from Heterogeneous Online Documents with Hierarchical Random Fields (AD, CLL), pp. 1007–1011.
ICDAR-2013-RayCC #recognition #using: Character Recognition Using Conditional Random Field Based Recognition Engine (AR, AC, SC), pp. 18–22.
ICDAR-2013-ShivramZSNG #online #recognition #segmentation #word: Segmentation Based Online Word Recognition: A Conditional Random Field Driven Beam Search Strategy (AS, BZ, SS, MN, VG), pp. 852–856.
ICDAR-2013-ZhouTLW #markov #recognition #using: Minimum Risk Training for Handwritten Chinese/Japanese Text Recognition Using Semi-Markov Conditional Random Fields (XDZ, FT, CLL, HW), pp. 940–944.
VLDB-2013-ZhaoCSZZ #on the: On the Embeddability of Random Walk Distances (XZ, AC, ADS, HZ, BYZ), pp. 1690–1701.
ICALP-v1-2013-BorosEGM #algorithm #game studies #probability #pseudo: A Pseudo-Polynomial Algorithm for Mean Payoff Stochastic Games with Perfect Information and a Few Random Positions (EB, KME, VG, KM), pp. 220–231.
ICALP-v1-2013-BringmannF #generative #geometry #graph #performance: Exact and Efficient Generation of Geometric Random Variates and Random Graphs (KB, TF), pp. 267–278.
ICALP-v1-2013-BulanekKS #on the #online: On Randomized Online Labeling with Polynomially Many Labels (JB, MK, MES), pp. 291–302.
ICALP-v1-2013-GrossiRRV #string: Dynamic Compressed Strings with Random Access (RG, RR, SRS, RV), pp. 504–515.
ICALP-v1-2013-Leonardos #bound #complexity #recursion: An Improved Lower Bound for the Randomized Decision Tree Complexity of Recursive Majority, (NL), pp. 696–708.
ICALP-v1-2013-MoruzN #algorithm #bound: Improved Space Bounds for Strongly Competitive Randomized Paging Algorithms (GM, AN), pp. 757–768.
ICALP-v2-2013-SpirakisNR #graph: A Guided Tour in Random Intersection Graphs (PGS, SEN, CR), pp. 29–35.
CIKM-2013-AkibaIY #linear #network #scalability: Linear-time enumeration of maximal K-edge-connected subgraphs in large networks by random contraction (TA, YI, YY), pp. 909–918.
CIKM-2013-SchneiderV #clustering #performance: Fast parameterless density-based clustering via random projections (JS, MV), pp. 861–866.
CIKM-2013-WangLZ #approach #graph #metric #multi #towards: Towards metric fusion on multi-view data: a cross-view based graph random walk approach (YW, XL, QZ), pp. 805–810.
ICML-c1-2013-AfkanpourGSB #algorithm #kernel #learning #multi #scalability: A Randomized Mirror Descent Algorithm for Large Scale Multiple Kernel Learning (AA, AG, CS, MB), pp. 374–382.
ICML-c3-2013-ChenRBT #metric #normalisation: Dependent Normalized Random Measures (CC, VR, WLB, YWT), pp. 969–977.
ICML-c3-2013-DenilMF #consistency #online: Consistency of Online Random Forests (MD, DM, NdF), pp. 1256–1264.
ICML-c3-2013-DingRIS #topic: Topic Discovery through Data Dependent and Random Projections (WD, MHR, PI, VS), pp. 1202–1210.
ICML-c3-2013-KraehenbuehlK #convergence #learning #parametricity: Parameter Learning and Convergent Inference for Dense Random Fields (PK, VK), pp. 513–521.
ICML-c3-2013-Meng #scalability: Scalable Simple Random Sampling and Stratified Sampling (XM), pp. 531–539.
ICML-c3-2013-WytockK #algorithm #energy #theory and practice: Sparse Gaussian Conditional Random Fields: Algorithms, Theory, and Application to Energy Forecasting (MW, JZK), pp. 1265–1273.
KDIR-KMIS-2013-Lindner #constraints #parsing #using: Using Conditional Random Fields with Constraints to Train Support Vector Machines — Locating and Parsing Bibliographic References (SL), pp. 28–36.
KDIR-KMIS-2013-MelnichenkoB #automation #image #low level: Automatic Image Annotation with Low-level Features and Conditional Random Fields (AM, AB), pp. 197–201.
MLDM-2013-DincA #classification #evaluation #image #using: Evaluation of Hyperspectral Image Classification Using Random Forest and Fukunaga-Koontz Transform (SD, RSA), pp. 234–245.
MLDM-2013-SouzaP #recognition #word: Sign Language Recognition with Support Vector Machines and Hidden Conditional Random Fields: Going from Fingerspelling to Natural Articulated Words (CRdS, EBP), pp. 84–98.
RecSys-2013-Kyrola #named: DrunkardMob: billions of random walks on just a PC (AK), pp. 257–264.
SEKE-2013-Alegroth #concept #proving #testing #user interface #visual notation: Random Visual GUI Testing: Proof of Concept (EA), pp. 178–183.
SIGIR-2013-GaoXX #query #using: Query expansion using path-constrained random walks (JG, GX, JX), pp. 563–572.
SIGIR-2013-RaiberK #clustering #documentation #markov #ranking #using: Ranking document clusters using markov random fields (FR, OK), pp. 333–342.
SIGIR-2013-YuL #incremental #named: IRWR: incremental random walk with restart (WY, XL), pp. 1017–1020.
ASE-2013-ZhangGMK: Operator-based and random mutant selection: Better together (LZ, MG, DM, SK), pp. 92–102.
SAC-2013-AlmeidaKG #data type: Random rules from data streams (EA, PK, JG), pp. 813–814.
CASE-2013-KimM #equilibrium #on the: On the equilibrium probabilities of deterministic flow lines with random arrivals (WsK, JRM), pp. 723–729.
CASE-2013-SoviziK #matrix #nondeterminism #parallel #using: Uncertainty characterization in serial and parallel manipulators using random matrix theory (JS, VNK), pp. 312–317.
DAC-2013-ChenWBA #reuse #simulation #verification: Simulation knowledge extraction and reuse in constrained random processor verification (WC, LCW, JB, MSA), p. 6.
DAC-2013-WuH #constraints #framework #multi #robust #set #theorem proving #verification: A robust constraint solving framework for multiple constraint sets in constrained random verification (BHW, CY(H), p. 7.
DATE-2013-BraojosAA #classification #embedded #using: A methodology for embedded classification of heartbeats using random projections (RB, GA, DA), pp. 899–904.
DATE-2013-ZhaiYZ #algorithm #float: GPU-friendly floating random walk algorithm for capacitance extraction of VLSI interconnects (KZ, WY, HZ), pp. 1661–1666.
HPCA-2013-KoibuchiFMC: Layout-conscious random topologies for HPC off-chip interconnects (MK, IF, HM, HC), pp. 484–495.
STOC-2013-CaputoMSS #algorithm: Random lattice triangulations: structure and algorithms (PC, FM, AS, AS), pp. 615–624.
STOC-2013-Wootters #fault #linear #on the #scalability: On the list decodability of random linear codes with large error rates (MW), pp. 853–860.
VMCAI-2013-BiondiLMW #information management #protocol: Quantifying Information Leakage of Randomized Protocols (FB, AL, PM, AW), pp. 68–87.
PODS-2012-HuangYZ #algorithm #distributed: Randomized algorithms for tracking distributed count, frequencies, and ranks (ZH, KY, QZ), pp. 295–306.
VLDB-2012-FujiwaraNOK #performance: Fast and Exact Top-k Search for Random Walk with Restart (YF, MN, MO, MK), pp. 442–453.
ICALP-v1-2012-AchlioptasM #bound #satisfiability: Unsatisfiability Bounds for Random CSPs from an Energetic Interpolation Method (DA, RMM), pp. 1–12.
ICALP-v1-2012-JanssonSS #memory management #named: CRAM: Compressed Random Access Memory (JJ, KS, WKS), pp. 510–521.
ICALP-v2-2012-GugelmannPP #clustering #graph #sequence: Random Hyperbolic Graphs: Degree Sequence and Clustering — (LG, KP, UP), pp. 573–585.
ICALP-v2-2012-KrystaV #design #on the fly #online: Online Mechanism Design (Randomized Rounding on the Fly) (PK, BV), pp. 636–647.
ICALP-v2-2012-Vocking #multi: Randomized Mechanisms for Multi-unit Auctions — (BV), pp. 27–29.
CIKM-2012-Cohen #learning #metric #similarity: Learning similarity measures based on random walks (WWC), p. 3.
CIKM-2012-LinDH0S #automation #image #using #visual notation: Automatic image annotation using tag-related random search over visual neighbors (ZL, GD, MH, JW, JS), pp. 1784–1788.
CIKM-2012-RiondatoDFU #algorithm #approximate #mining #named #parallel #pipes and filters: PARMA: a parallel randomized algorithm for approximate association rules mining in MapReduce (MR, JAD, RF, EU), pp. 85–94.
CIKM-2012-XueKRKP #network #social: Delineating social network data anonymization via random edge perturbation (MX, PK, CR, PK, HKP), pp. 475–484.
ECIR-2012-LucchesePSVV #how: How Random Walks Can Help Tourism (CL, RP, FS, HV, RV), pp. 195–206.
ICML-2012-AlamgirL #distance #graph #nearest neighbour: Shortest path distance in random k-nearest neighbor graphs (MA, UvL), p. 163.
ICML-2012-ChenDB #metric #modelling #normalisation #topic: Dependent Hierarchical Normalized Random Measures for Dynamic Topic Modeling (CC, ND, WLB), p. 95.
ICML-2012-HazanJ #on the: On the Partition Function and Random Maximum A-Posteriori Perturbations (TH, TSJ), p. 217.
ICML-2012-KimKO #metric #parametricity #process #topic: Dirichlet Process with Mixed Random Measures: A Nonparametric Topic Model for Labeled Data (DK, SK, AHO), p. 90.
ICML-2012-ShiSHH #question: Is margin preserved after random projection? (QS, CS, RH, AvdH), p. 86.
ICPR-2012-DriraADSB #3d #novel #recognition: 3D dynamic expression recognition based on a novel Deformation Vector Field and Random Forest (HD, BBA, MD, AS, SB), pp. 1104–1107.
ICPR-2012-DuttaGLBP #documentation #graph #kernel #visual notation: Combination of product graph and random walk kernel for symbol spotting in graphical documents (AD, JG, JL, HB, UP), pp. 1663–1666.
ICPR-2012-JiangFZT #detection: Active Shape Model with random forest for facial features detection (WJ, YF, ZZ, YT), pp. 593–596.
ICPR-2012-LeeLCY #lightweight #representation #using: Lightweight Random Ferns using binary representation (SL, SWL, YNC, HSY), pp. 1342–1345.
ICPR-2012-MorinDD #approach #multi #segmentation: A random walk approach for multiatlas-based segmentation (JPM, CD, LD), pp. 3636–3639.
ICPR-2012-RaoYBQL #online #robust #visual notation: Online Random Ferns for robust visual tracking (CR, CY, XB, WQ, WL), pp. 1447–1450.
ICPR-2012-SuLT #documentation #framework #image #learning #markov #using: A learning framework for degraded document image binarization using Markov Random Field (BS, SL, CLT), pp. 3200–3203.
ICPR-2012-VillamizarGSM #learning #online #using: Online human-assisted learning using Random Ferns (MV, AG, AS, FMN), pp. 2821–2824.
ICPR-2012-ZhangRZY #detection: Contour detection via random forest (CZ, XR, YZ, MHY), pp. 2772–2775.
KDD-2012-XiongJXC #dependence #learning #metric: Random forests for metric learning with implicit pairwise position dependence (CX, DMJ, RX, JJC), pp. 958–966.
KDIR-2012-ChueaphunKMC #nearest neighbour #recognition #using: Lanna Dharma Printed Character Recognition using k-Nearest Neighbor and Conditional Random Fields (CC, AK, SM, JC), pp. 169–174.
KDIR-2012-LindnerH #constraints #learning #maintenance #parsing: Parsing and Maintaining Bibliographic References — Semi-supervised Learning of Conditional Random Fields with Constraints (SL, WH), pp. 233–238.
MLDM-2012-OshiroPB #how #question: How Many Trees in a Random Forest? (TMO, PSP, JAB), pp. 154–168.
POPL-2012-ZhuMKR #approximate #performance #program transformation: Randomized accuracy-aware program transformations for efficient approximate computations (ZAZ, SM, JAK, MCR), pp. 441–454.
ICSE-2012-NistorLPGM #automation #clustering #generative #named #parallel #performance #testing #thread: Ballerina: Automatic generation and clustering of efficient random unit tests for multithreaded code (AN, QL, MP, TRG, DM), pp. 727–737.
CASE-2012-KimM #modelling #on the #probability #throughput: On the throughput of deterministic flow lines with random state dependent setups: Stochastic models and applications (WsK, JRM), pp. 650–655.
CASE-2012-ParulkarSK #automation #performance: Fast randomized planner for SLAM automation (AP, PS, KMK), pp. 765–770.
DAC-2012-PaekMSSK #markov #named: PowerField: a transient temperature-to-power technique based on Markov random field theory (SP, SHM, WS, JS, LSK), pp. 630–635.
DATE-2012-VeljkovicRV #generative #implementation #low cost #on the fly #testing: Low-cost implementations of on-the-fly tests for random number generators (FV, VR, IV), pp. 959–964.
STOC-2012-Applebaum #generative #locality #pseudo: Pseudorandom generators with long stretch and low locality from random local one-way functions (BA), pp. 805–816.
STOC-2012-GiakkoupisW #bound: A tight RMR lower bound for randomized mutual exclusion (GG, PW), pp. 983–1002.
STOC-2012-HardtR #matrix: Beating randomized response on incoherent matrices (MH, AR), pp. 1255–1268.
STOC-2012-Molloy #graph: The freezing threshold for k-colourings of a random graph (MM), pp. 921–930.
STOC-2012-VaziraniV #generative #quantum: Certifiable quantum dice: or, true random number generation secure against quantum adversaries (UVV, TV), pp. 61–76.
ICLP-J-2012-IslamRR #logic programming #probability #source code: Inference in probabilistic logic programs with continuous random variables (MAI, CRR, IVR), pp. 505–523.
LICS-2012-MullerT: Short Propositional Refutations for Dense Random 3CNF Formulas (SM, IT), pp. 501–510.
SAT-2012-AchlioptasM #algorithm #bound #exponential #satisfiability: Exponential Lower Bounds for DPLL Algorithms on Satisfiable Random 3-CNF Formulas (DA, RMM), pp. 327–340.
SAT-2012-Hugel #named #satisfiability: SATLab: X-Raying Random k-SAT — (TH), pp. 424–429.
TAP-2012-CreignouES #framework #satisfiability #specification: A Framework for the Specification of Random SAT and QSAT Formulas (NC, UE, MS), pp. 163–168.
ICDAR-2011-MandalRP #documentation #segmentation #using: Signature Segmentation from Machine Printed Documents Using Conditional Random Field (RM, PPR, UP), pp. 1170–1174.
ICDAR-2011-PengCPN #using #video: Text Extraction from Video Using Conditional Random Fields (XP, HC, RP, PN), pp. 1029–1033.
ICDAR-2011-VinelDA #feature model #linear #optimisation: Joint Optimization of Hidden Conditional Random Fields and Non Linear Feature Extraction (AV, TMTD, TA), pp. 513–517.
ICDAR-2011-ZhangLYDW #recognition #using: An Improved Scene Text Extraction Method Using Conditional Random Field and Optical Character Recognition (HZ, CL, CY, XD, KW), pp. 708–712.
ICDAR-2011-ZhouYWWNL #using: Transcript Mapping for Handwritten Text Lines Using Conditional Random Fields (XDZ, FY, DHW, QFW, MN, CLL), pp. 58–62.
VLDB-2011-Jin0MD #database #web: Randomized Generalization for Aggregate Suppression Over Hidden Web Databases (XJ, NZ, AM, GD), pp. 1099–1110.
CIAA-2011-CarninoF #automaton #generative #markov #using: Random Generation of Deterministic Acyclic Automata Using Markov Chains (VC, SDF), pp. 65–75.
CIAA-2011-SkvortsovT #automaton #case study #word: Experimental Study of the Shortest Reset Word of Random Automata (ES, ET), pp. 290–298.
ICALP-v1-2011-AllenderFG #power of #string: Limits on the Computational Power of Random Strings (EA, LF, WIG), pp. 293–304.
ICALP-v1-2011-Coja-OghlanP #process #satisfiability: The Decimation Process in Random k-SAT (ACO, AYPP), pp. 305–316.
ICALP-v1-2011-MagniezNSX #bound #complexity #recursion: Improved Bounds for the Randomized Decision Tree Complexity of Recursive Majority (FM, AN, MS, DX), pp. 317–329.
ICALP-v2-2011-DoerrF: Asymptotically Optimal Randomized Rumor Spreading (BD, MF), pp. 502–513.
CIG-2011-HelmstetterLTTWY: Random positions in Go (BH, CSL, FT, OT, MHW, SJY), pp. 250–257.
ICEIS-J-2011-Moghadampour11b #algorithm #search-based: Outperforming Mutation Operator with Random Building Block Operator in Genetic Algorithms (GM), pp. 178–192.
ICEIS-v2-2011-Moghadampour #algorithm #search-based: Random Building Block Operator for Genetic Algorithms (GM), pp. 54–62.
CIKM-2011-CuiLYJJHGCD #framework #multi: Multi-view random walk framework for search task discovery from click-through log (JC, HL, JY, LJ, RJ, JH, YG, ZC, XD), pp. 135–140.
CIKM-2011-LiuCZH #learning: Learning conditional random fields with latent sparse features for acronym expansion finding (JL, JC, YZ, YH), pp. 867–872.
CIKM-2011-LiYL #power of #predict: Link prediction: the power of maximal entropy random walk (RHL, JXY, JL), pp. 1147–1156.
CIKM-2011-WangZLBW #classification #multi #using: Using random walks for multi-label classification (CW, WZ, ZL, YB, JW), pp. 2197–2200.
ECIR-2011-ZhouH #comprehension #learning #natural language: Learning Conditional Random Fields from Unaligned Data for Natural Language Understanding (DZ, YH), pp. 283–288.
ICML-2011-Gould #learning #linear #markov: Max-margin Learning for Lower Linear Envelope Potentials in Binary Markov Random Fields (SG), pp. 193–200.
ICML-2011-SaxeKCBSN #learning #on the: On Random Weights and Unsupervised Feature Learning (AMS, PWK, ZC, MB, BS, AYN), pp. 1089–1096.
ICML-2011-ZhouT #composition #matrix #named: GoDec: Randomized Lowrank & Sparse Matrix Decomposition in Noisy Case (TZ, DT), pp. 33–40.
KDD-2011-BoleyLPG #performance: Direct local pattern sampling by efficient two-step random procedures (MB, CL, DP, TG), pp. 582–590.
KDD-2011-WilkinsonAN #classification #named: CHIRP: a new classifier based on composite hypercubes on iterated random projections (LW, AA, DTN), pp. 6–14.
MLDM-2011-AlshukriCZ #bound #detection #incremental #using: Incremental Web-Site Boundary Detection Using Random Walks (AA, FC, MZ), pp. 414–427.
MLDM-2011-AttigP #biology #comparison #image #set: A Comparison between Haralick’s Texture Descriptor and the Texture Descriptor Based on Random Sets for Biological Images (AA, PP), pp. 524–538.
RecSys-2011-LeeSKLL #graph #multi #ranking #recommendation: Random walk based entity ranking on graph for multidimensional recommendation (SL, SiS, MK, DL, SgL), pp. 93–100.
SIGIR-2011-WangWZH #learning #online: Learning online discussion structures by conditional random fields (HW, CW, CZ, JH), pp. 435–444.
ICSE-2011-ArcuriB #algorithm #re-engineering #statistics #testing #using: A practical guide for using statistical tests to assess randomized algorithms in software engineering (AA, LCB), pp. 1–10.
SAC-2011-Muramatsu #algorithm #online #verification: Random forgery attacks against DTW-based online signature verification algorithm (DM), pp. 27–28.
SAC-2011-SimKM #adaptation #approach #embedded #fuzzing #linux: Fuzzing the out-of-memory killer on embedded Linux: an adaptive random approach (KYS, FCK, RGM), pp. 387–392.
CASE-2011-LeH #analysis: Marginal analysis on binary pairwise Gibbs random fields (TL, CNH), pp. 316–321.
DAC-2011-AadithyaVDR #impact analysis #named #predict #probability: MUSTARD: a coupled, stochastic/deterministic, discrete/continuous technique for predicting the impact of random telegraph noise on SRAMs and DRAMs (KVA, SV, AD, JSR), pp. 292–297.
DAC-2011-LinLCHC: Common-centroid capacitor placement considering systematic and random mismatches in analog integrated circuits (CWL, JML, YCC, CPH, SJC), pp. 528–533.
DATE-2011-AadithyaDVR #modelling #named #simulation: SAMURAI: An accurate method for modelling and simulating non-stationary Random Telegraph Noise in SRAMs (KVA, AD, SV, JSR), pp. 1113–1118.
DATE-2011-BoghratiS #analysis #grid #performance #power management: A scaled random walk solver for fast power grid analysis (BB, SSS), pp. 38–43.
PDP-2011-KermarrecLT #convergence #independence: Converging Quickly to Independent Uniform Random Topologies (AMK, VL, CT), pp. 159–166.
FASE-2011-SharmaGAFM #question #testing: Testing Container Classes: Random or Systematic? (RS, MG, AA, GF, DM), pp. 262–277.
STOC-2011-DughmiRY #combinator #optimisation #towards: From convex optimization to randomized mechanisms: toward optimal combinatorial auctions (SD, TR, QY), pp. 149–158.
STOC-2011-FriedmannHZ #algorithm #bound: Subexponential lower bounds for randomized pivoting rules for the simplex algorithm (OF, TDH, UZ), pp. 283–292.
STOC-2011-GolabHW #distributed #implementation: Linearizable implementations do not suffice for randomized distributed computation (WMG, LH, PW), pp. 373–382.
STOC-2011-HolensteinKT #equivalence #revisited: The equivalence of the random oracle model and the ideal cipher model, revisited (TH, RK, ST), pp. 89–98.
STOC-2011-LenzenW #bound #parallel: Tight bounds for parallel randomized load balancing: extended abstract (CL, RW), pp. 11–20.
STOC-2011-MahdianY #approach #online: Online bipartite matching with random arrivals: an approach based on strongly factor-revealing LPs (MM, QY), pp. 597–606.
CSL-2011-Eickmeyer #first-order #logic: Non-Definability Results for Randomised First-Order Logic (KE), pp. 218–232.
ICST-2011-HeamN #data type #generative #named #recursion #testing: Seed: An Easy-to-Use Random Generator of Recursive Data Structures for Testing (PCH, CN), pp. 60–69.
LICS-2011-Goubault-LarrecqV: Continuous Random Variables (JGL, DV), pp. 97–106.
LICS-2011-LeC #algorithm #formal method: Formalizing Randomized Matching Algorithms (DTML, SAC), pp. 185–194.
SAT-2011-GableskeH #named #satisfiability #using: EagleUP: Solving Random 3-SAT Using SLS with Unit Propagation (OG, MH), pp. 367–368.
QoSA-2010-BabkaTB #modelling #performance #predict #validation: Validating Model-Driven Performance Predictions on Random Software Systems (VB, PT, LB), pp. 3–19.
DocEng-2010-SpenglerG #documentation #layout #web: Document structure meets page layout: loopy random fields for web news content extraction (AS, PG), pp. 151–160.
JCDL-2010-AngroshCS #identification #library #towards #using: Context identification of sentences in related work sections using a conditional random field: towards intelligent digital libraries (MAA, SC, NS), pp. 293–302.
ICALP-v1-2010-FountoulakisP #multi #power of: Orientability of Random Hypergraphs and the Power of Multiple Choices (NF, KP), pp. 348–359.
ICALP-v2-2010-BerenbrinkCEG #performance: Efficient Information Exchange in the Random Phone-Call Model (PB, JC, RE, LG), pp. 127–138.
ICALP-v2-2010-EvenM #algorithm #online: An O(logn)-Competitive Online Centralized Randomized Packet-Routing Algorithm for Lines (GE, MM), pp. 139–150.
ICALP-v2-2010-Zetzsche #on the: On Erasing Productions in Random Context Grammars (GZ), pp. 175–186.
LATA-2010-PolicritiTV: A Randomized Numerical Aligner (rNA) (AP, AIT, FV), pp. 512–523.
IFM-2010-Baier #distributed #model checking #on the: On Model Checking Techniques for Randomized Distributed Systems (CB), pp. 1–11.
CIKM-2010-LangMWL #concept #markov #using: Improved latent concept expansion using hierarchical markov random fields (HL, DM, BW, JTL), pp. 249–258.
ICML-2010-BradleyG #learning: Learning Tree Conditional Random Fields (JKB, CG), pp. 127–134.
ICML-2010-Cesa-BianchiGVZ #graph #predict: Random Spanning Trees and the Prediction of Weighted Graphs (NCB, CG, FV, GZ), pp. 175–182.
ICML-2010-DeselaersF #learning #multi: A Conditional Random Field for Multiple-Instance Learning (TD, VF), pp. 287–294.
ICML-2010-LizotteBM #analysis #learning #multi #performance: Efficient Reinforcement Learning with Multiple Reward Functions for Randomized Controlled Trial Analysis (DJL, MHB, SAM), pp. 695–702.
ICML-2010-ZhuX #topic: Conditional Topic Random Fields (JZ, EPX), pp. 1239–1246.
ICPR-2010-AbdalaWJ #clustering: Ensemble Clustering via Random Walker Consensus Strategy (DDA, PW, XJ), pp. 1433–1436.
ICPR-2010-ArmanoH #prototype: Random Prototype-based Oracle for Selection-fusion Ensembles (GA, NH), pp. 77–80.
ICPR-2010-AslanAFACX #3d #image #segmentation: 3D Vertebrae Segmentation in CT Images with Random Noises (MSA, AMA, AAF, BA, DC, PX), pp. 2290–2293.
ICPR-2010-BoltonG #framework #learning #multi #optimisation #set: Cross Entropy Optimization of the Random Set Framework for Multiple Instance Learning (JB, PDG), pp. 3907–3910.
ICPR-2010-CaoZL #markov #using: Human Body Parts Tracking Using Sequential Markov Random Fields (XQC, JZ, ZQL), pp. 1759–1762.
ICPR-2010-CiompiPR #approach #using: A Meta-Learning Approach to Conditional Random Fields Using Error-Correcting Output Codes (FC, OP, PR), pp. 710–713.
ICPR-2010-ElmezainAM #gesture #recognition #robust #segmentation #using: A Robust Method for Hand Gesture Segmentation and Recognition Using Forward Spotting Scheme in Conditional Random Fields (ME, AAH, BM), pp. 3850–3853.
ICPR-2010-GangehKD #categorisation: Random Subspace Method in Text Categorization (MJG, MSK, RPWD), pp. 2049–2052.
ICPR-2010-GodecLSB #naive bayes #online: On-Line Random Naive Bayes for Tracking (MG, CL, AS, HB), pp. 3545–3548.
ICPR-2010-HarandiAABL #recognition: Directed Random Subspace Method for Face Recognition (MTH, MNA, BNA, AB, BCL), pp. 2688–2691.
ICPR-2010-HuangDF #classification #estimation #multi: Head Pose Estimation Based on Random Forests for Multiclass Classification (CH, XD, CF), pp. 934–937.
ICPR-2010-KimL #markov #monte carlo #optimisation #using: Continuous Markov Random Field Optimization Using Fusion Move Driven Markov Chain Monte Carlo Technique (WK, KML), pp. 1364–1367.
ICPR-2010-KinnunenKLLK #categorisation #set #visual notation: Making Visual Object Categorization More Challenging: Randomized Caltech-101 Data Set (TK, JKK, LL, JL, HK), pp. 476–479.
ICPR-2010-LariosSSMLD #identification #kernel: Haar Random Forest Features and SVM Spatial Matching Kernel for Stonefly Species Identification (NL, BS, LGS, GMM, JL, TGD), pp. 2624–2627.
ICPR-2010-LuWD #detection: Part Detection, Description and Selection Based on Hidden Conditional Random Fields (WL, SW, XD), pp. 657–660.
ICPR-2010-MaTW #analysis #using: Nonlinear Blind Source Separation Using Slow Feature Analysis with Random Features (KM, QT, JW), pp. 830–833.
ICPR-2010-OkumuraTA #recognition #segmentation: Generic Object Recognition by Tree Conditional Random Field Based on Hierarchical Segmentation (TO, TT, YA), pp. 3025–3028.
ICPR-2010-RahtuSH #using: Compressing Sparse Feature Vectors Using Random Ortho-Projections (ER, MS, JH), pp. 1397–1400.
ICPR-2010-SonaA #multi: Multivariate Brain Mapping by Random Subspaces (DS, PA), pp. 2576–2579.
ICPR-2010-SulicPKK #distributed #reduction #using: Dimensionality Reduction for Distributed Vision Systems Using Random Projection (VS, JP, MK, SK), pp. 380–383.
ICPR-2010-TsagkatakisS #distance #modelling #recognition: Manifold Modeling with Learned Distance in Random Projection Space for Face Recognition (GT, AES), pp. 653–656.
ICPR-2010-VillamizarMAS #category theory #detection #multi #performance: Shared Random Ferns for Efficient Detection of Multiple Categories (MV, FMN, JAC, AS), pp. 388–391.
ICPR-2010-WangH #multi #recognition #using: Cancelable Face Recognition Using Random Multiplicative Transform (YW, DH), pp. 1261–1264.
ICPR-2010-WoloszynskiK #classification: A Measure of Competence Based on Randomized Reference Classifier for Dynamic Ensemble Selection (TW, MK), pp. 4194–4197.
ICPR-2010-YangL10a #recognition #robust: Robust Sign Language Recognition with Hierarchical Conditional Random Fields (HDY, SWL), pp. 2202–2205.
ICPR-2010-ZhangW10a #modelling #validation: LLN-based Model-Driven Validation of Data Points for Random Sample Consensus Methods (LZ, DW), pp. 3436–3439.
KDD-2010-LaoC #execution #modelling #performance #query #retrieval: Fast query execution for retrieval models based on path-constrained random walks (NL, WWC), pp. 881–888.
KDD-2010-LinC #outsourcing #privacy: Privacy-preserving outsourcing support vector machines with random transformation (KPL, MSC), pp. 363–372.
KDD-2010-Steck #recommendation #testing: Training and testing of recommender systems on data missing not at random (HS), pp. 713–722.
KDD-2010-ZhuLX #feature model #incremental #learning #markov #named #performance: Grafting-light: fast, incremental feature selection and structure learning of Markov random fields (JZ, NL, EPX), pp. 303–312.
KDIR-2010-CamposMO #recognition #using: Recognition of Gene/Protein Names using Conditional Random Fields (DC, SM, JLO), pp. 275–280.
KDIR-2010-ZhangSF: Conditional Random Fields for Term Extraction (XZ, YS, ACF), pp. 414–417.
KEOD-2010-ChatterjeeB #documentation #network #summary #using: Single Document Text Summarization using Random Indexing and Neural Networks (NC, AB), pp. 171–176.
SIGIR-2010-BuscherDC #quality #web: The good, the bad, and the random: an eye-tracking study of ad quality in web search (GB, STD, EC), pp. 42–49.
QAPL-2010-BarsottiW #abstraction #automation #probability #verification: Automatic Probabilistic Program Verification through Random Variable Abstraction (DB, NW), pp. 34–47.
ASE-2010-ZhengZLX #generative #recommendation #sequence #testing: Random unit-test generation with MUT-aware sequence recommendation (WZ, QZ, MRL, TX), pp. 293–296.
ICSE-2010-LaiCC #detection #parallel #source code #testing #thread: Detecting atomic-set serializability violations in multithreaded programs through active randomized testing (ZL, SCC, WKC), pp. 235–244.
ICSE-2010-ZhangHHXM #question: Is operator-based mutant selection superior to random mutant selection? (LZ, SSH, JJH, TX, HM), pp. 435–444.
SAC-2010-FernandesLR #classification: The impact of random samples in ensemble classifiers (PF, LL, DDAR), pp. 1002–1009.
SAC-2010-LeeKM #named #performance: ReSSD: a software layer for resuscitating SSDs from poor small random write performance (YL, JSK, SM), pp. 242–243.
SAC-2010-LeeKWAHP #3d #finite #using: Tracking random finite objects using 3D-LIDAR in marine environments (KWL, BK, WSW, MA, FSH, NMP), pp. 1282–1287.
SAC-2010-ZhangZ #analysis #canonical #correlation: Canonical random correlation analysis (JZ, DZ), pp. 1111–1112.
ASPLOS-2010-BurckhardtKMN #debugging #probability: A randomized scheduler with probabilistic guarantees of finding bugs (SB, PK, MM, SN), pp. 167–178.
CASE-2010-HanSL #predict: Modified generalized predictive power control for wireless networked systems with random delays (CH, DS, ZL), pp. 509–514.
DATE-2010-ChenLWZXZ #memory management #self: A nondestructive self-reference scheme for Spin-Transfer Torque Random Access Memory (STT-RAM) (YC, HL, XW, WZ, WX, TZ), pp. 148–153.
DATE-2010-ChenW #adaptation #memory management: An adaptive code rate EDAC scheme for random access memory (CYC, CWW), pp. 735–740.
PDP-2010-BrugnoliHS #collaboration #detection #grid #scheduling: Grid Scheduling Based on Collaborative Random Early Detection Strategies (MB, EH, MAS), pp. 35–42.
STOC-2010-BayatiGT #approach #combinator #graph #scalability: Combinatorial approach to the interpolation method and scaling limits in sparse random graphs (MB, DG, PT), pp. 105–114.
STOC-2010-GaoW: Load balancing and orientability thresholds for random hypergraphs (PG, NCW), pp. 97–104.
STOC-2010-GuruswamiHK #linear #on the: On the list-decodability of random linear codes (VG, JH, SK), pp. 409–416.
STOC-2010-KasiviswanathanRSU #correlation #matrix: The price of privately releasing contingency tables and the spectra of random matrices with correlated rows (SPK, MR, AS, JU), pp. 775–784.
STOC-2010-KoppartyS #fault #linear #testing: Local list-decoding and testing of random linear codes from high error (SK, SS), pp. 417–426.
TACAS-2010-ParizekK #component #detection #fault #java #performance #using: Efficient Detection of Errors in Java Components Using Random Environment and Restarts (PP, TK), pp. 451–465.
ICTSS-2010-ArcuriIB #black box #embedded #realtime #search-based #testing #using: Black-Box System Testing of Real-Time Embedded Systems Using Random and Search-Based Testing (AA, MZZI, LCB), pp. 95–110.
SAT-2010-RathiARS #bound #satisfiability: Bounds on Threshold of Regular Random k-SAT (VR, EA, LKR, MS), pp. 264–277.
ICDAR-2009-MontreuilGHN #2d #documentation #layout #using: Unconstrained Handwritten Document Layout Extraction Using 2D Conditional Random Fields (FM, EG, LH, SN), pp. 853–857.
ICDAR-2009-PanHL #image #locality: Text Localization in Natural Scene Images Based on Conditional Random Field (YFP, XH, CLL), pp. 6–10.
ICDAR-2009-PengSGSB #documentation #identification #markov: Markov Random Field Based Text Identification from Annotated Machine Printed Documents (XP, SS, VG, RS, KB), pp. 431–435.
ICDAR-2009-ZhouLN #online #recognition #string #using: Online Handwritten Japanese Character String Recognition Using Conditional Random Fields (XDZ, CLL, MN), pp. 521–525.
JCDL-2009-TreeratpitukG #using: Disambiguating authors in academic publications using random forests (PT, CLG), pp. 39–48.
VLDB-2009-ChenLFCYH #graph #mining #summary: Mining Graph Patterns Efficiently via Randomized Summaries (CC, CXL, MF, MC, XY, JH), pp. 742–753.
VLDB-2009-SarmaLNX #algorithm #multi #streaming: Randomized Multi-pass Streaming Skyline Algorithms (ADS, AL, DN, J(X), pp. 85–96.
VLDB-2009-XiaoTC #multi #privacy: Optimal Random Perturbation at Multiple Privacy Levels (XX, YT, MC), pp. 814–825.
EDM-2009-PardosH #order #problem #set: Determining the Significance of Item Order In Randomized Problem Sets (ZAP, NTH), pp. 111–120.
CIAA-2009-HeamNS #automaton #generative: Random Generation of Deterministic Tree (Walking) Automata (PCH, CN, SS), pp. 115–124.
ICALP-v1-2009-Coja-Oghlan #algorithm #satisfiability: A Better Algorithm for Random k-SAT (ACO), pp. 292–303.
ICALP-v1-2009-ElsasserS #bound #multi: Tight Bounds for the Cover Time of Multiple Random Walks (RE, TS), pp. 415–426.
ICALP-v1-2009-GuhaH #bound #order #theorem: Revisiting the Direct Sum Theorem and Space Lower Bounds in Random Order Streams (SG, ZH), pp. 513–524.
ICALP-v2-2009-CooperFR #multi: Multiple Random Walks and Interacting Particle Systems (CC, AMF, TR), pp. 399–410.
ICALP-v2-2009-CooperIKK #graph #using: Derandomizing Random Walks in Undirected Graphs Using Locally Fair Exploration Strategies (CC, DI, RK, AK), pp. 411–422.
FM-2009-HasanAATA #reasoning: Formal Reasoning about Expectation Properties for Continuous Random Variables (OH, NA, BA, ST, RA), pp. 435–450.
IFM-2009-BuiN #verification: Formal Verification Based on Guided Random Walks (THB, AN), pp. 72–87.
ICEIS-J-2009-SchclarR #classification: Random Projection Ensemble Classifiers (AS, LR), pp. 309–316.
CIKM-2009-DaM #named #optimisation: RS-Wrapper: random write optimization for solid state drive (DZ, XM), pp. 1457–1460.
CIKM-2009-PattanasriMM #comprehension #graph #named: ComprehEnRank: estimating comprehension in classroom by absorbing random walks on a cognitive graph (NP, MM, MM), pp. 1769–1772.
CIKM-2009-XinKDL #framework #multi #recommendation #social: A social recommendation framework based on multi-scale continuous conditional random fields (XX, IK, HD, MRL), pp. 1247–1256.
ICML-2009-PlathTN #classification #image #multi #segmentation #using: Multi-class image segmentation using conditional random fields and global classification (NP, MT, SN), pp. 817–824.
ICML-2009-QianJZHW #higher-order #sequence: Sparse higher order conditional random fields for improved sequence labeling (XQ, XJ, QZ, XH, LW), pp. 849–856.
ICML-2009-YuLZG #collaboration #parametricity #predict #scalability #using: Large-scale collaborative prediction using a nonparametric random effects model (KY, JDL, SZ, YG), pp. 1185–1192.
KDD-2009-ChenCBT #learning #optimisation: Constrained optimization for validation-guided conditional random field learning (MC, YC, MRB, AET), pp. 189–198.
KDD-2009-FrenoTG #estimation #hybrid #pseudo #scalability: Scalable pseudo-likelihood estimation in hybrid random fields (AF, ET, MG), pp. 319–328.
KDD-2009-JamaliE #named #recommendation #trust: TrustWalker: a random walk model for combining trust-based and item-based recommendation (MJ, ME), pp. 397–406.
KDD-2009-LiDJEL #recommendation: Grocery shopping recommendations based on basket-sensitive random walk (ML, MBD, IHJ, WED, PJGL), pp. 1215–1224.
MLDM-2009-LiHLG #concept #detection #streaming: Concept Drifting Detection on Noisy Streaming Data in Random Ensemble Decision Trees (PPL, XH, QL, YG), pp. 236–250.
MLDM-2009-SakaiI #clustering #performance: Fast Spectral Clustering with Random Projection and Sampling (TS, AI), pp. 372–384.
SIGIR-2009-KeikhaCC #using: Blog distillation using random walks (MK, MJC, FC), pp. 638–639.
SIGIR-2009-Lease #markov #query: An improved markov random field model for supporting verbose queries (ML), pp. 476–483.
SIGIR-2009-LiWA #query: Extracting structured information from user queries with semi-supervised conditional random fields (XL, YYW, AA), pp. 572–579.
ECMDA-FA-2009-MougenotDBS #generative #metamodelling: Uniform Random Generation of Huge Metamodel Instances (AM, AD, XB, MS), pp. 130–145.
PLDI-2009-JoshiPSN #detection #program analysis: A randomized dynamic program analysis technique for detecting real deadlocks (PJ, CSP, KS, MN), pp. 110–120.
CASE-2009-ZiedSN #maintenance #probability: An optimal production/maintenance planning under stochastic random demand, service level and failure rate (ZH, SD, NR), pp. 292–297.
STOC-2009-FriedrichS: Near-perfect load balancing by randomized rounding (TF, TS), pp. 121–130.
STOC-2009-KannanN #linear #programming: Random walks on polytopes and an affine interior point method for linear programming (RK, HN), pp. 561–570.
STOC-2009-KolaitisK #graph #quantifier: Random graphs and the parity quantifier (PGK, SK), pp. 705–714.
STOC-2009-Sellie #learning: Exact learning of random DNF over the uniform distribution (LS), pp. 45–54.
ICLP-2009-Namasivayam #logic programming #source code: Study of Random Logic Programs (GN), pp. 555–556.
MBT-2009-DadeauLH #automaton #generative #on the #testing #using: On the Use of Uniform Random Generation of Automata for Testing (FD, JL, PCH), pp. 37–51.
VMCAI-2009-KiddRDV #debugging #using: Finding Concurrency-Related Bugs Using Random Isolation (NK, TWR, JD, MV), pp. 198–213.
VLDB-2008-NathG #maintenance #online #scalability: Online maintenance of very large random samples on flash storage (SN, PBG), pp. 970–983.
SIGITE-2008-DaileyW: Constructing random polygons (DD, DW), pp. 119–124.
ICALP-A-2008-AvinKL #evolution #graph #how: How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs) (CA, MK, ZL), pp. 121–132.
ICALP-A-2008-CheboluFM #graph: Finding a Maximum Matching in a Sparse Random Graph in O(n) Expected Time (PC, AMF, PM), pp. 161–172.
ICALP-A-2008-KaoS #approximate #self: Randomized Self-assembly for Approximate Shapes (MYK, RTS), pp. 370–384.
ICALP-A-2008-PemmarajuS #symmetry: The Randomized Coloring Procedure with Symmetry-Breaking (SVP, AS), pp. 306–319.
ICALP-A-2008-Pritchard #distributed #performance: Fast Distributed Computation of Cuts Via Random Circulations (DP), pp. 145–160.
LATA-2008-BordihnH #distributed: Random Context in Regulated Rewriting VersusCooperating Distributed Grammar Systems (HB, MH), pp. 125–136.
CIKM-2008-LuLH #on the #similarity: On low dimensional random projections and similarity search (YEL, PL, SH), pp. 749–758.
CIKM-2008-WijayaB #rank #rating: A random walk on the red carpet: rating movies with user reviews and pagerank (DTW, SB), pp. 951–960.
CIKM-2008-XinLTL #comprehension #using: Academic conference homepage understanding using constrained hierarchical conditional random fields (XX, JL, JT, QL), pp. 1301–1310.
ICML-2008-LongS #classification: Random classification noise defeats all convex potential boosters (PML, RAS), pp. 608–615.
ICPR-2008-BelleDS #detection #realtime #recognition: Randomized trees for real-time one-step face detection and recognition (VB, TD, SS), pp. 1–4.
ICPR-2008-ChenHCZL #adaptation #detection #markov: Change detection based on adaptive Markov Random Fields (KC, CH, JC, ZZ, HL), pp. 1–4.
ICPR-2008-GuoYZZY #embedded #markov #using: Face super-resolution using 8-connected Markov Random Fields with embedded prior (KG, XY, RZ, GZ, SY), pp. 1–4.
ICPR-2008-HainesW #using: Combining shape-from-shading and stereo using Gaussian-Markov random fields (TSFH, RCW), pp. 1–4.
ICPR-2008-KimuraPTYK #markov #modelling #probability #visual notation: Dynamic Markov random fields for stochastic modeling of visual attention (AK, DP, TT, JY, KK), pp. 1–5.
ICPR-2008-LevadaMT #image #markov #modelling #on the #probability: On the asymptotic variances of Gaussian Markov Random Field model hyperparameters in stochastic image modeling (ALML, NDAM, AT), pp. 1–4.
ICPR-2008-RysavyFEO #classification #segmentation: Classifiability criteria for refining of random walks segmentation (SR, AF, RE, KO), pp. 1–4.
ICPR-2008-ShenCLB #using: Stereo matching using random walks (RS, IC, XL, AB), pp. 1–4.
ICPR-2008-SinghNGBSP #hybrid #using: Hybrid SVM — Random Forest classication system for oral cancer screening using LIF spectra (RKS, SKN, LG, SB, CS, KMP), pp. 1–4.
ICPR-2008-VachaH #invariant #markov: Illumination invariants based on Markov random fields (PV, MH), pp. 1–4.
ICPR-2008-WattuyaRPJ #approach #multi: A random walker based approach to combining multiple segmentations (PW, KR, JSP, XJ), pp. 1–4.
RecSys-2008-YildirimK #collaboration #problem: A random walk method for alleviating the sparsity problem in collaborative filtering (HY, MSK), pp. 131–138.
SIGIR-2008-SerdyukovRH08a #modelling: Modeling expert finding as an absorbing random walk (PS, HR, DH), pp. 797–798.
ASE-2008-Yom-TovTUH #automation #concurrent #debugging #source code: Automatic Debugging of Concurrent Programs through Active Sampling of Low Dimensional Random Projections (EYT, RT, SU, SH), pp. 307–316.
FSE-2008-ParkS #concurrent #detection #source code: Randomized active atomicity violation detection in concurrent programs (CSP, KS), pp. 135–145.
SAC-2008-DegesysBR: Synchronization of strongly pulse-coupled oscillators with refractory periods and random medium access (JD, PB, JR), pp. 1976–1980.
SAC-2008-MartinottoJCGDP #generative #network: Generation of continuous random networks by simulated annealing (ALM, FJ, LAC, VG, RVD, CAP), pp. 48–49.
CASE-2008-XuDAG #3d #using: Motion planning for steerable needles in 3D environments with obstacles using rapidly-exploring Random Trees and backchaining (JX, VD, RA, KG), pp. 41–46.
CGO-2008-SalverdakZ #predict: Accurate critical path prediction via random trace construction (PS, CT, CBZ), pp. 64–73.
DAC-2008-LiASR #array #design #memory management #modelling #probability #statistics: Modeling of failure probability and statistical design of spin-torque transfer magnetic random access memory (STT MRAM) array for yield enhancement (JL, CA, SSS, KR), pp. 278–283.
DATE-2008-Liu08a #correlation #performance #simulation: Spatial Correlation Extraction via Random Field Simulation and Production Chip Performance Regression (BL), pp. 527–532.
DATE-2008-PlazaMB #constraints #generative #using: Random Stimulus Generation using Entropy and XOR Constraints (SP, ILM, VB), pp. 664–669.
DATE-2008-ZengC #analysis #polynomial: Deep Submicron Interconnect Timing Model with Quadratic Random Variable Analysis (JKZ, CPC), pp. 1091–1094.
FoSSaCS-2008-GimbertH #game studies #probability: Simple Stochastic Games with Few Random Vertices Are Easy to Solve (HG, FH), pp. 5–19.
STOC-2008-BansalBN #algorithm: Randomized competitive algorithms for generalized caching (NB, NB, JN), pp. 235–244.
STOC-2008-CoteMP: Randomized k-server on hierarchical binary trees (AC, AM, LJP), pp. 227–234.
STOC-2008-DasguptaF: Random projection trees and low dimensional manifolds (SD, YF), pp. 537–546.
STOC-2008-FriezeVV #graph: Logconcave random graphs (AMF, SV, JV), pp. 779–788.
CAV-2008-KimJRSPKS #analysis #simulation: Application of Formal Word-Level Analysis to Constrained Random Simulation (HK, HJ, KR, PS, JP, RPK, FS), pp. 487–490.
MBT-2008-GaudelDGLOP #modelling: Coverage-biased Random Exploration of Models (MCG, AD, SDG, RL, JO, SP), pp. 3–14.
SAT-2008-CreignouDER #quantifier: New Results on the Phase Transition for Random Quantified Boolean Formulas (NC, HD, UE, RR), pp. 34–47.
SAT-2008-Gao #algorithm #complexity #problem: Random Instances of W[2]-Complete Problems: Thresholds, Complexity, and Algorithms (YG), pp. 91–104.
DRR-2007-ShettySBS #documentation #segmentation #using: Segmentation and labeling of documents using conditional random fields (SS, HS, MJB, SNS).
ICDAR-2007-BernardAH #recognition #using: Using Random Forests for Handwritten Digit Recognition (SB, SA, LH), pp. 1043–1047.
ICDAR-2007-NicolasDPH #2d #documentation #image #segmentation #using: Document Image Segmentation Using a 2D Conditional Random Field Model (SN, JD, TP, LH), pp. 407–411.
ICDAR-2007-ShettySS #recognition #using #word: Handwritten Word Recognition Using Conditional Random Fields (SS, HS, SNS), pp. 1098–1102.
ICDAR-2007-ZhouLQA #classification #markov: Text/Non-text Ink Stroke Classification in Japanese Handwriting Based on Markov Random Fields (XDZ, CLL, SQ, ÉA), pp. 377–381.
SIGMOD-2007-DasguptaDM #approach #database: A random walk approach to sampling hidden databases (AD, GD, HM), pp. 629–640.
VLDB-2007-XuJ #algorithm #query: Randomized Algorithms for Data Reconciliation in Wide Area Aggregate Query Processing (FX, CJ), pp. 639–650.
ICALP-2007-ChandranGS: Ring Signatures of Sub-linear Size Without Random Oracles (NC, JG, AS), pp. 423–434.
ICALP-2007-Coja-OghlanPS #graph #on the: On the Chromatic Number of Random Graphs (ACO, KP, AS), pp. 777–788.
RTA-2007-Oostrom: Random Descent (VvO), pp. 314–328.
HCI-AS-2007-ZhangLL #algorithm #fault: A Routing Algorithm for Random Error Tolerance in Network-on-Chip (LZ, HL, XL), pp. 1210–1219.
ICEIS-J-2007-LiuCM07a #comparison #recognition: Named Entity Recognition in Biomedical Literature: A Comparison of Support Vector Machines and Conditional Random Fields (FL, YC, BM), pp. 137–147.
CIKM-2007-ButtcherC: Index compression is good, especially for random access (SB, CLAC), pp. 761–770.
CIKM-2007-FanizzidE #clustering #concept #induction #knowledge base #metric #semantics: Randomized metric induction and evolutionary conceptual clustering for semantic knowledge bases (NF, Cd, FE), pp. 51–60.
CIKM-2007-Metzler #automation #feature model #information retrieval #markov: Automatic feature selection in the markov random field model for information retrieval (DM), pp. 253–262.
ICML-2007-AgarwalC #graph #learning #rank: Learning random walks to rank nodes in graphs (AA, SC), pp. 9–16.
ICML-2007-Azran #algorithm #learning #markov #multi: The rendezvous algorithm: multiclass semi-supervised learning with Markov random walks (AA), pp. 49–56.
ICML-2007-SuttonM #performance #pseudo: Piecewise pseudolikelihood for efficient training of conditional random fields (CAS, AM), pp. 863–870.
ICML-2007-ZhangAV #learning #multi: Conditional random fields for multi-agent reinforcement learning (XZ, DA, SVNV), pp. 1143–1150.
ICML-2007-ZhuNZW #markov #web: Dynamic hierarchical Markov random fields and their application to web data extraction (JZ, ZN, BZ, JRW), pp. 1175–1182.
KDD-2007-Li #reduction: Very sparse stable random projections for dimension reduction in lalpha (0 <alpha<=2) norm (PL0), pp. 440–449.
SIGIR-2007-BlancoL #information retrieval: Random walk term weighting for information retrieval (RB, CL), pp. 829–830.
SIGIR-2007-CraswellS #graph: Random walks on the click graph (NC, MS), pp. 239–246.
SIGIR-2007-MetzlerC #concept #markov #using: Latent concept expansion using markov random fields (DM, WBC), pp. 311–318.
ESEC-FSE-2007-SaulFDB #recommendation: Recommending random walks (ZMS, VF, PTD, CB), pp. 15–24.
ICSE-2007-DwyerEPP #parallel: Parallel Randomized State-Space Search (MBD, SGE, SP, RP), pp. 3–12.
ICSE-2007-GroceHJ #difference #testing #verification: Randomized Differential Testing as a Prelude to Formal Verification (AG, GJH, RJ), pp. 621–631.
SAC-2007-LiuT #game studies: Eigen-distribution on assignments for game trees with random properties (CL, KT), pp. 78–79.
SAC-2007-MilsztajnG #3d #algorithm #markov #search-based #segmentation #using: Three-dimensional segmentation of brain tissues using Markov random fields and genetic algorithms (FM, KdG), pp. 745–746.
SAC-2007-SarfrazR #algorithm #image #polynomial #using: A randomized knot insertion algorithm for outline capture of planar images using cubic spline (MS, AR), pp. 71–75.
SAC-2007-SchusterS #documentation #estimation #natural language #query #web: NL sampler: random sampling of web documents based on natural language with query hit estimation (DS, AS), pp. 812–818.
SAC-2007-WuIOKM #adaptation #peer-to-peer #protocol: An adaptive randomized search protocol in peer-to-peer systems (YW, TI, FO, HK, TM), pp. 533–537.
SAC-2007-ZhangZZMY #algorithm #streaming: A priority random sampling algorithm for time-based sliding windows over weighted streaming data (LZ, ZL, YQZ, YM, ZY), pp. 453–456.
CASE-2007-LamiriDX: Operating Room Planning with Random Surgery Times (ML, JD, XX), pp. 521–526.
CASE-2007-TanonkouBX #design #multi #network: Design of multi-commodity distribution network with random demands and supply lead-times (GAT, LB, XX), pp. 698–703.
DAC-2007-AmbroseRP #analysis #injection #named: RIJID: Random Code Injection to Mask Power Analysis based Side Channel Attacks (JAA, RGR, SP), pp. 489–492.
DAC-2007-GuSK #modelling #statistics: Width-dependent Statistical Leakage Modeling for Random Dopant Induced Threshold Voltage Shift (JG, SSS, CHK), pp. 87–92.
DAC-2007-Levitan #graph: You Can Get There From Here: Connectivity of Random Graphs on Grids (SPL), pp. 272–273.
DATE-2007-HaastregtK #interactive #optimisation #performance #using: Interactive presentation: Feasibility of combined area and performance optimization for superscalar processors using random search (SvH, PMWK), pp. 606–611.
DATE-2007-ZhuP #algorithm #graph #probability: Random sampling of moment graph: a stochastic Krylov-reduction algorithm (ZZ, JRP), pp. 1502–1507.
STOC-2007-AttiyaC #bound: Tight bounds for asynchronous randomized consensus (HA, KC), pp. 155–164.
STOC-2007-BeameJR #algorithm #bound: Lower bounds for randomized read/write stream algorithms (PB, TSJ, AR), pp. 689–698.
STOC-2007-BrinkmanKL #graph #reduction: Vertex cuts, random walks, and dimension reduction in series-parallel graphs (BB, AK, JRL), pp. 621–630.
CAV-2007-MatsliahS #approximate #encryption #model checking: Underapproximation for Model-Checking Based on Random Cryptographic Constructions (AM, OS), pp. 339–351.
PODS-2006-GroheHS #bound #scalability #set: Randomized computations on large data sets: tight lower bounds (MG, AH, NS), pp. 243–252.
PODS-2006-MotwaniX #evolution #graph #modelling #web: Evolution of page popularity under random web graph models (RM, YX), pp. 134–142.
SIGMOD-2006-RusuD #estimation #performance: Fast range-summable random variables for efficient aggregate estimation (FR, AD), pp. 193–204.
VLDB-2006-DrineasM #algorithm #matrix #set: Randomized Algorithms for Matrices and Massive Data Sets (PD, MWM), p. 1269.
ITiCSE-2006-Nau: A random number (RWN), p. 345.
CIAA-2006-Tischler #automaton #finite #refinement #video: Refinement of Near Random Access Video Coding with Weighted Finite Automata (GT), pp. 46–57.
ICALP-v1-2006-Coja-Oghlan #adaptation #clustering #graph #heuristic: An Adaptive Spectral Heuristic for Partitioning Random Graphs (ACO), pp. 691–702.
ICALP-v1-2006-Coja-OghlanL #graph: The Spectral Gap of Random Graphs with Given Expected Degrees (ACO, AL), pp. 15–26.
ICALP-v1-2006-Radhakrishnan #lazy evaluation #using: Gap Amplification in PCPs Using Lazy Random Walks (JR), pp. 96–107.
SEFM-2006-RaymondJR: Describing and Executing Random Reactive Systems (PR, EJ, YR), pp. 216–225.
ICEIS-DISI-2006-LongboZMYY #algorithm #data type: Random Sampling Algorithms for Landmark Windows over Data Streams (LZ, ZL, YM, WY, JY), pp. 103–107.
ICML-2006-RavikumarL #estimation #markov #metric #polynomial #programming: Quadratic programming relaxations for metric labeling and Markov random field MAP estimation (PDR, JDL), pp. 737–744.
ICML-2006-VishwanathanSSM #probability: Accelerated training of conditional random fields with stochastic gradient methods (SVNV, NNS, MWS, KPM), pp. 969–976.
ICPR-v1-2006-DemonceauxV #adaptation #markov: Adaptative Markov Random Fields for Omnidirectional Vision (CD, PV), pp. 848–851.
ICPR-v1-2006-GaoW #recognition: Boosting in Random Subspaces for Face Recognition (YG, YW), pp. 519–522.
ICPR-v1-2006-ZengL #markov #segmentation #using: Stroke Segmentation of Chinese Characters Using Markov Random Fields (JZ, ZQL), pp. 868–871.
ICPR-v1-2006-ZengL06a #fuzzy #markov #recognition: Type-2 Fuzzy Markov Random Fields to Handwritten Character Recognition (JZ, ZQL), pp. 1162–65.
ICPR-v2-2006-KimYL #estimation #image #interactive #modelling #parametricity #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.
ICPR-v2-2006-PriorW #fault #parametricity #probability #using: Parameter Tuning using the Out-of-Bootstrap Generalisation Error Estimate for Stochastic Discrimination and Random Forests (MP, TW), pp. 498–501.
ICPR-v2-2006-YangS #detection #using: Detecting Coarticulation in Sign Language using Conditional Random Fields (RY, SS), pp. 108–112.
ICPR-v3-2006-KongHXTG #video: A Conditional Random Field Model for Video Super-resolution (DK, MH, WX, HT, YG), pp. 619–622.
ICPR-v3-2006-ZhongW #detection #markov: Object Detection Based on Combination of Conditional Random Field and Markov Random Field (PZ, RW), pp. 160–163.
ICPR-v4-2006-KoSB: A New Objective Function for Ensemble Selection in Random Subspaces (AHRK, RS, AdSBJ), pp. 185–188.
KDD-2006-FanMY #framework #performance #summary: A general framework for accurate and fast regression by data summarization in random decision trees (WF, JM, PSY), pp. 136–146.
KDD-2006-LiHC: Very sparse random projections (PL, TH, KWC), pp. 287–296.
SIGIR-2006-HarabagiuLH #modelling: Answering complex questions with random walk models (SMH, VFL, AH), pp. 220–227.
CASE-2006-TanonkouBX #design #network: Distribution network design with random demand and unreliable suppliers (GAT, LB, XX), pp. 15–20.
PDP-2006-HeichlerK #distributed #parallel #query: A Distributed Query Structure to Explore Random Mappings in Parallel (JH, JK), pp. 173–177.
STOC-2006-AchlioptasR #constraints #geometry #on the #problem: On the solution-space geometry of random constraint satisfaction problems (DA, FRT), pp. 130–139.
STOC-2006-DobzinskiNS #combinator: Truthful randomized mechanisms for combinatorial auctions (SD, NN, MS), pp. 644–652.
STOC-2006-Impagliazzo #algorithm #question: Can every randomized algorithm be derandomized? (RI), pp. 373–374.
STOC-2006-KelnerS #algorithm #linear #polynomial #programming: A randomized polynomial-time simplex algorithm for linear programming (JAK, DAS), pp. 51–60.
STOC-2006-Zhang #bound #quantum: New upper and lower bounds for randomized and quantum local search (SZ), pp. 634–643.
SAT-2006-Zhang: A Complete Random Jump Strategy with Guiding Paths (HZ), pp. 96–101.
ICDAR-2005-NicolasKPH #documentation #markov #segmentation #using: Handwritten Document Segmentation Using Hidden Markov Random Fields (SN, YK, TP, LH), pp. 212–216.
ICDAR-2005-Szummer #diagrams #learning: Learning Diagram Parts with Hidden Random Fields (MS), pp. 1188–1193.
ICDAR-2005-ZengL #markov #recognition: Markov Random Fields for Handwritten Chinese Character Recognition (JZ, ZQL), pp. 101–105.
PODS-2005-GroheS #bound #memory management #sorting: Lower bounds for sorting with few random accesses to external memory (MG, NS), pp. 238–249.
SIGMOD-2005-HuangDC: Deriving Private Information from Randomized Data (ZH, WD, BC), pp. 37–48.
VLDB-2005-PandeyROCC #ranking: Shuffling a Stacked Deck: The Case for Partially Randomized Ranking of Search Engine Results (SP, SR, CO, JC, SC), pp. 781–792.
ICALP-2005-AvinE #geometry #graph #on the: On the Cover Time of Random Geometric Graphs (CA, GE), pp. 677–689.
ICALP-2005-DiehlM #bound #polynomial: Time-Space Lower Bounds for the Polynomial-Time Hierarchy on Randomized Machines (SD, DvM), pp. 982–993.
ICALP-2005-EfthymiouS #graph #on the: On the Existence of Hamiltonian Cycles in Random Intersection Graphs (CE, PGS), pp. 690–701.
ICALP-2005-Hast #approximate #linear #named: Approximating — Outperforming a Random Assignment with Almost a Linear Factor (GH), pp. 956–968.
ICALP-2005-KaoSS #design #performance #word: Randomized Fast Design of Short DNA Words (MYK, MS, RTS), pp. 1275–1286.
ICALP-2005-Kavitha #algorithm #graph: An Õ(m2n) Randomized Algorithm to Compute a Minimum Cycle Basis of a Directed Graph (TK), pp. 273–284.
ICALP-2005-Mislove: Discrete Random Variables over Domains (MWM), pp. 1006–1017.
ICALP-2005-RadhakrishnanRS #fourier #on the #power of #problem: On the Power of Random Bases in Fourier Sampling: Hidden Subgroup Problem in the Heisenberg Group (JR, MR, PS), pp. 1399–1411.
CIKM-2005-Collins-ThompsonC #modelling #query #using: Query expansion using random walk models (KCT, JC), pp. 704–711.
ICML-2005-RothY #integer #linear #programming: Integer linear programming inference for conditional random fields (DR, WtY), pp. 736–743.
ICML-2005-WangWGSC #markov #modelling #semantics: Exploiting syntactic, semantic and lexical regularities in language modeling via directed Markov random fields (SW, SW, RG, DS, LC), pp. 948–955.
ICML-2005-ZhuNWZM #2d #information management #web: 2D Conditional Random Fields for Web information extraction (JZ, ZN, JRW, BZ, WYM), pp. 1044–1051.
MLDM-2005-KotsiantisTP #estimation: Bagging Random Trees for Estimation of Tissue Softness (SBK, GET, PEP), pp. 674–681.
MLDM-2005-XiaWZL #data mining #mining #modelling: Mixture Random Effect Model Based Meta-analysis for Medical Data Mining (YX, SW, CZ, SL), pp. 630–640.
SIGIR-2005-MetzlerC #dependence #markov: A Markov random field model for term dependencies (DM, WBC), pp. 472–479.
POPL-2005-GulwaniN #analysis #interprocedural #precise #using: Precise interprocedural analysis using random interpretation (SG, GCN), pp. 324–337.
SAC-2005-WanMA #array #markov #similarity #using: Cleaning microarray expression data using Markov random fields based on profile similarity (RW, HM, KFA), pp. 206–207.
DAC-2005-BhardwajV: Leakage minimization of nano-scale circuits in the presence of systematic and random variations (SB, SBKV), pp. 541–546.
STOC-2005-Alekhnovich #bound: Lower bounds for k-DNF resolution on random 3-CNFs (MA), pp. 251–256.
STOC-2005-HajiaghayiKLR #graph: Oblivious routing in directed graphs with random demands (MTH, JHK, TL, HR), pp. 193–201.
STOC-2005-Raz: Extractors with weak random seeds (RR), pp. 11–20.
STOC-2005-Regev #encryption #fault #learning #linear #on the: On lattices, learning with errors, random linear codes, and cryptography (OR), pp. 84–93.
STOC-2005-SanghviV #complexity: The round complexity of two-party random selection (SS, SPV), pp. 338–347.
STOC-2005-TaoV #matrix #on the: On random pm 1 matrices: singularity and determinant (TT, VHV), pp. 431–440.
STOC-2005-Vu #matrix: Spectral norm of random matrices (VHV), pp. 423–430.
SAT-J-2004-Interian05 #algorithm #approximate: Approximation Algorithm for Random MAX- kSAT (YI), pp. 173–182.
SAT-J-2004-Sinopalnikov05 #satisfiability: Satisfiability Threshold of the Skewed Random k-SAT (DAS), pp. 263–275.
CAV-2005-NeculaG #algorithm #program analysis #verification: Randomized Algorithms for Program Analysis and Verification (GCN, SG), p. 1.
LICS-2005-Atserias05a: Definability on a Random 3-CNF Formula (AA), pp. 458–466.
SAT-2005-HeuleM #bound #linear #programming #satisfiability #using: Observed Lower Bounds for Random 3-SAT Phase Transition Density Using Linear Programming (MH, HvM), pp. 122–134.
SAT-2005-Prestwich: Random Walk with Continuously Smoothed Variable Weights (SDP), pp. 203–215.
SAT-2005-SeitzAO #behaviour #satisfiability: Threshold Behaviour of WalkSAT and Focused Metropolis Search on Random 3-Satisfiability (SS, MA, PO), pp. 475–481.
ECDL-2004-FrankeG #automation #documentation #scalability #set #strict: Automated Indexing with Restricted Random Walks on Large Document Sets (MF, AGS), pp. 232–243.
SIGMOD-2004-JermainePA #maintenance #online #scalability: Online Maintenance of Very Large Random Samples (CJ, AP, SA), pp. 299–310.
ICALP-2004-CzumajS #approximate #clustering: Sublinear-Time Approximation for Clustering Via Random Sampling (AC, CS), pp. 396–407.
ICALP-2004-FeigeO #scalability: Easily Refutable Subformulas of Large Random 3CNF Formulas (UF, EO), pp. 519–530.
ICALP-2004-NikoletseasRS #graph #independence #performance #scalability #set: The Existence and Efficient Construction of Large Independent Sets in General Random Intersection Graphs (SEN, CR, PGS), pp. 1029–1040.
ICML-2004-BlumLRR #learning #using: Semi-supervised learning using randomized mincuts (AB, JDL, MRR, RR).
ICML-2004-DietterichAB: Training conditional random fields via gradient tree boosting (TGD, AA, YB).
ICML-2004-LaffertyZL #clique #kernel #representation: Kernel conditional random fields: representation and clique selection (JDL, XZ, YL).
ICML-2004-SuttonRM #modelling #probability #sequence: Dynamic conditional random fields: factorized probabilistic models for labeling and segmenting sequence data (CAS, KR, AM).
ICML-2004-ToutanovaMN #dependence #learning #modelling #word: Learning random walk models for inducing word dependency distributions (KT, CDM, AYN).
ICPR-v1-2004-ClausiY #comparison #markov #segmentation #using: Texture Segmentation Comparison Using Grey Level Co-Occurrence Probabilities and Markov Random Fields (DAC, BY), pp. 584–587.
ICPR-v1-2004-SunG #image #markov #segmentation: Bayesian Image Segmentation Based on an Inhomogeneous Hidden Markov Random Field (JS, DG), pp. 596–599.
ICPR-v1-2004-TremblaySM #algorithm #multi #nearest neighbour #optimisation #search-based #using: Optimizing Nearest Neighbour in Random Subspaces using a Multi-Objective Genetic Algorithm (GT, RS, PM), p. 208.
ICPR-v2-2004-FarmerBJ #feature model #scalability #using: Large Scale Feature Selection Using Modified Random Mutation Hill Climbing (MEF, SB, AKJ), pp. 287–290.
ICPR-v3-2004-AntoniolC #approach #array #image #markov: A Markov Random Field Approach to Microarray Image Gridding (GA, MC), pp. 550–553.
ICPR-v3-2004-GoriMS #graph #using: Graph matching using Random Walks (MG, MM, LS), pp. 394–397.
ICPR-v3-2004-HuangMP #hybrid #markov #recognition #using: A Hybrid Face Recognition Method using Markov Random Fields (RH, DNM, VP), pp. 157–160.
KDD-2004-TruongLB #dataset #learning #using: Learning a complex metabolomic dataset using random forests and support vector machines (YT, XL, CB), pp. 835–840.
AdaEurope-2004-GiriMJK #ada #approach #safety #testing: A Randomised Test Approach to Testing Safety Critical Ada Code (SKG, AM, YVJ, KK), pp. 190–199.
POPL-2004-GulwaniN #using: Global value numbering using random interpretation (SG, GCN), pp. 342–352.
ASE-2004-Andrews #case study #data type #testing: Case Study of Coverage-Checked Random Data Structure Testing (JHA), pp. 316–319.
SAC-2004-RaisanenWH #comparison #optimisation: A comparison of randomized and evolutionary approaches for optimizing base station site selection (LR, RMW, SH), pp. 1159–1165.
DATE-v1-2004-OngHCW #multi: Random Jitter Extraction Technique in a Multi-Gigahertz Signal (CKO, DH, KTC, LCW), pp. 286–291.
STOC-2004-AchlioptasN #graph: The two possible values of the chromatic number of a random graph (DA, AN), pp. 587–593.
STOC-2004-Feige #bound #graph #independence #on the: On sums of independent random variables with unbounded variance, and estimating the average degree in a graph (UF), pp. 594–603.
STOC-2004-GoelRK #geometry #graph: Sharp thresholds For monotone properties in random geometric graphs (AG, SR, BK), pp. 580–586.
STOC-2004-MankuNW #lookahead #network #power of: Know thy neighbor’s neighbor: the power of lookahead in randomized P2P networks (GSM, MN, UW), pp. 54–63.
CSL-2004-Atserias #complexity #satisfiability: Notions of Average-Case Complexity for Random 3-SAT (AA), pp. 1–5.
IJCAR-2004-BartheCT #formal method: A Machine-Checked Formalization of the Generic Model and the Random Oracle Model (GB, JC, ST), pp. 385–399.
SAT-2004-Connamacher #constraints #problem: A Random Constraint Satisfaction Problem That Seems Hard for DPLL (HSC), pp. 3–11.
SAT-2004-Interian #algorithm #approximate: Approximation Algorithm for Random MAX-kSAT (YI), pp. 64–68.
ICDAR-2003-ZhengLD03a #documentation #identification #image #markov #using: Text Identification in Noisy Document Images Using Markov Random Field (YZ, HL, DSD), p. 599–?.
ICALP-2003-BodirskyGK #generative #graph: Generating Labeled Planar Graphs Uniformly at Random (MB, CG, MK), pp. 1095–1107.
ICALP-2003-Coja-OghlanMS #approximate #graph: MAX k-CUT and Approximating the Chromatic Number of Random Graphs (ACO, CM, VS), pp. 200–211.
ICALP-2003-IkedaKOY #finite #graph: Impact of Local Topological Information on Random Walks on Finite Graphs (SI, IK, NO, MY), pp. 1054–1067.
ICML-2003-FernB03a #approach #clustering: Random Projection for High Dimensional Data Clustering: A Cluster Ensemble Approach (XZF, CEB), pp. 186–193.
KDD-2003-DuZ #data mining #mining #privacy #using: Using randomized response techniques for privacy-preserving data mining (WD, JZZ), pp. 505–510.
KDD-2003-FradkinM #machine learning: Experiments with random projections for machine learning (DF, DM), pp. 517–522.
MLDM-2003-ImiyaTOH #bound #detection #set: Detecting the Boundary Curve of Planar Random Point Set (AI, KT, HO, VH), pp. 413–424.
SIGIR-2003-LavrenkoP #modelling #music: Music modeling with random fields (VL, JP), pp. 389–390.
SIGIR-2003-PintoMWC #using: Table extraction using conditional random fields (DP, AM, XW, WBC), pp. 235–242.
POPL-2003-GulwaniN #using: Discovering affine equalities using random interpretation (SG, GCN), pp. 74–84.
SAC-2003-KatzerKS #array #markov: A Markov Random Field Model of Microarray Gridding (MK, FK, GS), pp. 72–77.
DAC-2003-QianNS #network: Random walks in a supply network (HQ, SRN, SSS), pp. 93–98.
DATE-2003-PolianBR #markov #optimisation #pseudo: Evolutionary Optimization of Markov Sources for Pseudo Random Scan BIST (IP, BB, SMR), pp. 11184–11185.
STOC-2003-AchlioptasP #satisfiability: The threshold for random k-SAT is 2k (ln 2 — O(k)) (DA, YP), pp. 223–231.
STOC-2003-BeierV #polynomial: Random knapsack in expected polynomial time (RB, BV), pp. 232–241.
STOC-2003-DietzfelbingerW #graph: Almost random graphs with simple hash functions (MD, PW), pp. 629–638.
STOC-2003-KimV #generative #graph: Generating random regular graphs (JHK, VHV), pp. 213–222.
CADE-2003-GulwaniN: A Randomized Satisfability Procedure for Arithmetic and Uninterpreted Function Symbols (SG, GCN), pp. 167–181.
LICS-2003-Lynch #convergence #graph #sequence: Convergence Law for Random Graphs with Specified Degree Sequence (JFL), p. 301–?.
SAT-2003-BraunsteinZ #overview #satisfiability: Survey and Belief Propagation on Random K-SAT (AB, RZ), pp. 519–528.
SAT-2003-DequenD #named #performance #satisfiability: kcnfs: An Efficient Solver for Random k-SAT Formulae (GD, OD), pp. 486–501.
SAT-2003-Parisi #approach #on the #probability #problem #satisfiability: On the Probabilistic Approach to the Random Satisfiability Problem (GP), pp. 203–213.
SAT-2003-SemerjianM #case study #physics #problem #satisfiability: A Study of Pure Random Walk on Random Satisfiability Problems with “Physical” Methods (GS, RM), pp. 120–134.
ICALP-2002-AdlerRSSV #graph: Randomized Pursuit-Evasion in Graphs (MA, HR, NS, CS, BV), pp. 901–912.
ICALP-2002-Brattka #recursion #set: Random Numbers and an Incomplete Immune Recursive Set (VB), pp. 950–961.
ICALP-2002-DuchonFLS: Random Sampling from Boltzmann Principles (PD, PF, GL, GS), pp. 501–513.
ICML-2002-ChisholmT #learning: Learning Decision Rules by Randomized Iterative Local Search (MC, PT), pp. 75–82.
ICML-2002-StracuzziU: Randomized Variable Elimination (DJS, PEU), pp. 594–601.
ICPR-v1-2002-Meas-YedidTO #analysis #clustering #image #markov #segmentation: Color Image Segmentation Based on Markov Random Field Clustering for Histological Image Analysis (VMY, ST, JCOM), pp. 796–799.
ICPR-v1-2002-TakizawaYMTIM #3d #image #markov #modelling #recognition #using: Recognition of Lung Nodules from X-ray CT Images Using 3D Markov Random Field Models (HT, SY, TM, YT, TI, MM), pp. 99–102.
ICPR-v2-2002-KamijoIS #image #invariant #markov #segmentation: Illumination Invariant Segmentation of Spatio-Temporal Images by Spatio-Temporal Markov Random Field Model (SK, KI, MS), pp. 617–622.
ICPR-v2-2002-RiviereMMTPF #graph #learning #markov #relational #using: Relational Graph Labelling Using Learning Techniques and Markov Random Fields (DR, JFM, JMM, FT, DPO, VF), pp. 172–175.
ICPR-v3-2002-CaputoBN #markov #recognition #robust #using: Robust Appearance-Based Object Recognition Using a Fully Connected Markov Random Field (BC, SB, HN), pp. 565–568.
ICPR-v3-2002-WolfD #markov #quality #using: Binarization of Low Quality Text Using a Markov Random Field Model (CW, DSD), pp. 160–163.
ICPR-v4-2002-ChenOB #markov #recognition #segmentation: Text Segmentation and Recognition in Complex Background Based on Markov Random Field (DC, JMO, HB), pp. 227–230.
ICPR-v4-2002-DassJL #detection #markov #modelling #synthesis #using: Face Detection and Synthesis Using Markov Random Field Models (SCD, AKJ, XL), pp. 201–204.
KDD-2002-KolczSK #classification #performance: Efficient handling of high-dimensional feature spaces by randomized classifier ensembles (AK, XS, JKK), pp. 307–313.
STOC-2002-Albers #on the #online #scheduling: On randomized online scheduling (SA), pp. 134–143.
STOC-2002-AlonVKK #approximate #problem: Random sampling and approximation of MAX-CSP problems (NA, WFdlV, RK, MK), pp. 232–239.
STOC-2002-BertsimasV #source code: Solving convex programs by random walks (DB, SV), pp. 109–115.
STOC-2002-Gacs #scheduling: Clairvoyant scheduling of random walks (PG), pp. 99–108.
STOC-2002-GoldbergKP #complexity: The complexity of choosing an H-colouring (nearly) uniformly at random (LAG, SK, MP), pp. 53–62.
STOC-2002-HastadV #on the: On the advantage over a random assignment (JH, SV), pp. 43–52.
STOC-2002-KargerL #graph: Random sampling in residual graphs (DRK, MSL), pp. 63–66.
STOC-2002-Molloy02a #constraints #modelling #problem: Models and thresholds for random constraint satisfaction problems (MM), pp. 209–217.
LICS-2002-Atserias #satisfiability: Unsatisfiable Random Formulas Are Hard to Certify (AA), pp. 325–334.
SAT-2002-CreignouD #problem #satisfiability: Random generalized satisfiability problems (NC, HD), p. 2.
SAT-2002-DuboisD #satisfiability: Renormalization as a function of clause lengths for solving random k-SAT formulae (OD, GD), p. 15.
SAT-2002-FormanS #named #parallel #satisfiability: NAGSAT: A randomized, complete, parallel solver for 3-SAT (SF, AMS), p. 45.
SAT-2002-Kullmann #adaptation #branch #database #encryption #normalisation #satisfiability #standard #towards #using: Towards an adaptive density based branching rule for SAT solvers, using a database for mixed random conjunctive normal forms built upon the Advanced Encryption Standard (AES) (OK), p. 8.
SAT-2002-MonassonC #algorithm #analysis #exponential #satisfiability #scalability: Restart method and exponential acceleration of random 3-SAT instances resolutions: A large deviation analysis of the Davis-Putnam-Loveland-Logemann algorithm (RM, SC), p. 11.
ICDAR-2001-BagdanovW #classification #documentation #fine-grained #first-order #graph #using: Fine-Grained Document Genre Classification Using First Order Random Graphs (ADB, MW), pp. 79–85.
ICDAR-2001-JustinoBS #using #verification: Off-line Signature Verification Using HMM for Random, Simple and Skilled Forgeries (EJRJ, FB, RS), pp. 1031–1034.
PODS-2001-Achlioptas: Database-friendly random projections (DA).
CIAA-2001-Zijl #generative: Random Number Generation with +-NFAs (LvZ), pp. 263–273.
DLT-2001-HromkovicS #automaton #on the #power of: On the Power of Randomized Pushdown Automata (JH, GS), pp. 262–271.
ICALP-2001-ChakrabartiK #bound #complexity #graph: Improved Lower Bounds on the Randomized Complexity of Graph Properties (AC, SK), pp. 285–296.
ICALP-2001-Dodis: New Imperfect Random Source with Applications to Coin-Flipping (YD), pp. 297–309.
ICALP-2001-FriedmanG #satisfiability: Recognizing More Unsatisfiable Random 3-SAT Instances Efficiently (JF, AG), pp. 310–321.
ICML-2001-LaffertyMP #modelling #probability #sequence: Conditional Random Fields: Probabilistic Models for Segmenting and Labeling Sequence Data (JDL, AM, FCNP), pp. 282–289.
KDD-2001-BinghamM #image #reduction: Random projection in dimensionality reduction: applications to image and text data (EB, HM), pp. 245–250.
KDD-2001-HarelK #clustering #using: Clustering spatial data using random walks (DH, YK), pp. 281–286.
SAC-2001-DowellB #graph #mobile #monte carlo #network #simulation #validation: Connectivity of random graphs and mobile networks: validation of Monte Carlo simulation results (LJD, MLB), pp. 77–81.
DAC-2001-Pomeranz #testing: Random Limited-Scan to Improve Random Pattern Testing of Scan Circuits (IP), pp. 145–150.
CAV-2001-KwiatkowskaNS #automation #distributed #protocol #using #verification: Automated Verification of a Randomized Distributed Consensus Protocol Using Cadence SMV and PRISM (MZK, GN, RS), pp. 194–206.
IJCAR-2001-Patel-SchneiderS #generative: A New System and Methodology for Generating Random Modal Formulae (PFPS, RS), pp. 464–468.
SAT-2001-CoccoM #analysis #backtracking #physics #satisfiability #statistics: Statistical physics analysis of the backtrack resolution of random 3-SAT instances (SC, RM), pp. 36–47.
VLDB-2000-Bar-YossefBCFW #approximate #query #web: Approximating Aggregate Queries about Web Pages via Random Walks (ZBY, ACB, SC, JF, DW), pp. 535–544.
CIAA-2000-DvorskyS #word: Word Random Access Compression (JD, VS), pp. 331–332.
ICPR-v1-2000-KamijoMIS #markov #robust: Occlusion Robust Tracking Utilizing Spatio-Temporal Markov Random Field Model (SK, YM, KI, MS), pp. 1140–1144.
ICPR-v1-2000-Pilu #invariant #optimisation: Optimizing Random Patterns for Invariants-based Matching (MP), pp. 1716–1719.
ICPR-v2-2000-Baram #pattern matching #pattern recognition #recognition: Random Embedding Machines for Low-Complexity Pattern Recognition (YB), pp. 2748–2754.
ICPR-v2-2000-KimK #estimation #graph #parametricity #recognition: Minimum Entropy Estimation of Hierarchical Random Graph Parameters for Character Recognition (HYK, JHK), pp. 6050–6053.
ICPR-v2-2000-WangZCF #approach #markov #recognition: Hidden Markov Random Field Based Approach for Off-Line Handwritten Chinese Character Recognition (QW, RZ, ZC, DDF), pp. 2347–2350.
ICPR-v3-2000-GravierSC #automation #markov #recognition #speech: A Markov Random Field Model for Automatic Speech Recognition (GG, MS, GC), pp. 3258–3261.
ICPR-v3-2000-OukilS #algorithm #energy #markov: Markovian Random Fields Energy Minimization Algorithms (AO, AS), pp. 3522–3525.
ICPR-v3-2000-PagetL #analysis #markov #parametricity #testing: Nonparametric Markov Random Field Model Analysis of the MeasTex Test Suite (RP, IDL), pp. 3939–3942.
ICPR-v3-2000-SmolkaW #image: Edge Preserving Image Smoothing Based on Self Avoiding Random Walk (BS, KWW), pp. 3668–3671.
ICPR-v3-2000-SziranyiT: Random Paintbrush Transformation (TS, ZT), pp. 3155–3158.
SAC-2000-MarchioriS #algorithm #constraints #problem #search-based: A Genetic Local Search Algorithm for Random Binary Constraint Satisfaction Problems (EM, AGS), pp. 458–462.
PDP-2000-Dembinski #distributed: Distributed and randomized enumeration (PD), pp. 62–66.
STOC-2000-Achlioptas #bound #satisfiability: Setting 2 variables at a time yields a new lower bound for random 3-SAT (DA), pp. 28–37.
STOC-2000-AielloCL #graph: A random graph model for massive graphs (WA, FRKC, LL), pp. 171–180.
STOC-2000-CarrV: Randomized metarounding (RDC, SV), pp. 58–62.
STOC-2000-FaginKKRRRST: Random walks with “back buttons” (RF, ARK, JMK, PR, SR, RR, MS, AT), pp. 484–493.
STOC-2000-Seiden #algorithm #game studies #online: A guessing game and randomized online algorithms (SSS), pp. 592–601.
SIGMOD-1999-ChaudhuriMN #on the: On Random Sampling over Joins (SC, RM, VRN), pp. 263–274.
SIGMOD-1999-MankuRL #dataset #online #order #performance #scalability #statistics: Random Sampling Techniques for Space Efficient Online Computation of Order Statistics of Large Datasets (GSM, SR, BGL), pp. 251–262.
VLDB-1999-DarmontS #named #simulation: VOODB: A Generic Discrete-Event Random Simulation Model To Evaluate the Performances of OODBs (JD, MS), pp. 254–265.
HCI-EI-1999-KetolaHTTV: Ergonomics in VDU Work: a randomized controlled trial (RK, MH, RT, EPT, EVJ), pp. 19–22.
ICEIS-1999-CordeiroD #estimation: Contour Estimation on Piecewise Homogeneous Random Fields (JAMC, JMBD), pp. 183–194.
SAC-1999-BakC #protocol: Randomized Distance-Vector Routing Protocol (SB, JAC), pp. 78–84.
PDP-1999-CaselliR #architecture #distributed #parallel: Randomized motion planning on parallel and distributed architectures (SC, MR), pp. 297–304.
STOC-1999-Schaeffer #scalability: Random Sampling of Large Planar Maps and Convex Polyhedra (GS), pp. 760–769.
SIGMOD-1998-ChaudhuriMN #how #question: Random Sampling for Histogram Construction: How much is enough? (SC, RM, VRN), pp. 436–447.
ICML-1998-PiaterCZA #performance: A Randomized ANOVA Procedure for Comparing Performance Curves (JHP, PRC, XZ, MA), pp. 430–438.
ICPR-1998-Gimelfarb98a #image #modelling #on the: On the maximum likelihood potential estimates for Gibbs random field image models (GLG), pp. 1598–1600.
ICPR-1998-GoktepeAYY #image #markov #modelling #segmentation #using: Unsupervised texture based image segmentation by simulated annealing using Markov random field and Potts models (MG, VA, NY, CY), pp. 820–822.
ICPR-1998-HuTT: Direct triangle extraction by a randomized Hough technique (ZH, MT, HTT), pp. 717–719.
ICPR-1998-PagetL #markov #multi #parametricity #recognition #synthesis: Texture synthesis and unsupervised recognition with a nonparametric multiscale Markov random field model (RP, DL), pp. 1068–1070.
ICPR-1998-WangLL #classification #composition #markov #modelling #using: Texture classification using wavelet decomposition with Markov random field models (LW, JL, SZL), pp. 1613–1615.
KR-1998-Jaeger #infinity #network #reasoning #relational: Reasoning About Infinite Random Structures with Relational Bayesian Networks (MJ), pp. 570–581.
SAC-1998-GaberT #distributed #network: Randomized load distribution of arbitrary trees in distributed networks (JG, BT), pp. 564–568.
SAC-1998-Li98a #algorithm #distributed #online: Deterministic and randomized algorithms for distributed on-line task assignment and load balancing without load status information (KL), pp. 613–622.
FoSSaCS-1998-PorrotDDV #sequence #transducer: Deterministic Rational Transducers and Random Sequences (SP, MD, BD, NKV), pp. 258–272.
STOC-1998-Ajtai #np-hard #problem #reduction: The Shortest Vector Problem in L2 is NP-hard for Randomized Reductions (MA), pp. 10–19.
STOC-1998-BeameKPS #complexity #on the #proving #satisfiability: On the Complexity of Unsatisfiability Proofs for Random k-CNF Formulas (PB, RMK, TP, MES), pp. 561–571.
STOC-1998-CanettiGH #revisited: The Random Oracle Methodology, Revisited (RC, OG, SH), pp. 209–218.
STOC-1998-ColeMHMRSSV #multi #network #protocol: Randomized Protocols for Low Congestion Circuit Routing in Multistage Interconnection Networks (RC, BMM, FMadH, MM, AWR, KS, RKS, BV), pp. 378–388.
STOC-1998-Grigoriev #bound #complexity: Randomized Complexity Lower Bounds (DG), pp. 219–223.
STOC-1998-PeinadoL #embedded #generative #graph: Random Generation of Embedded Graphs and an Extension to Dobrushin Uniqueness (MP, TL), pp. 176–185.
ISSTA-1998-Ntafos #on the #testing: On Random and Partition Testing (SCN), pp. 42–48.
JICSLP-1998-AngelopoulosPW #algorithm #constraints #implementation #logic programming: Implementing Randomised Algorithms in Constraint Logic Programming (NA, ADP, HW), pp. 355–356.
ICDAR-1997-GuoDR #detection: Local correspondence for detecting random forgeries (JKG, DSD, AR), pp. 319–323.
CHI-1997-HornofK #modelling: Cognitive Modeling Reveals Menu Search is Both Random and Systematic (AJH, DEK), pp. 107–114.
DAC-1997-PantDC #energy #logic #network #optimisation #power management: Device-Circuit Optimization for Minimal Energy and Power Consumption in CMOS Random Logic Networks (PP, VD, AC), pp. 403–408.
DAC-1997-TsaiHRM #generative #named: STARBIST: Scan Autocorrelated Random Pattern Generation (KHT, SH, JR, MMS), pp. 472–477.
DAC-1997-WalterLDLMKW #approach #multi #simulation #verification: Hierarchical Random Simulation Approach for the Verification of S/390 CMOS Multiprocessors (JAW, JL, GD, BL, HJM, KWK, BW), pp. 89–94.
EDTC-1997-IwamaHKS #benchmark #metric: Random benchmark circuits with controlled attributes (KI, KH, HK, SS), pp. 90–97.
PDP-1997-Aguilar #heuristic: Task assignment heuristic based on the random neural model (JA), pp. 13–17.
STOC-1997-Aspnes #bound #distributed: Lower Bounds for Distributed Coin-Flipping and Randomized Consensus (JA), pp. 559–568.
STOC-1997-BroderFU #approach #graph: Static and Dynamic Path Selection on Expander Graphs: A Random Walk Approach (AZB, AMF, EU), pp. 531–539.
STOC-1997-ColeH #pattern matching #set: Tree Pattern Matching and Subset Matching in Randomized O(n log3m) Time (RC, RH), pp. 66–75.
STOC-1997-GrigorievK #bound: Randomized Ω(n²) Lower Bound for Knapsack (DG, MK), pp. 76–85.
STOC-1997-Karger #graph #using: Using Random Sampling to Find Maximum Flows in Uncapacitated Undirected Graphs (DRK), pp. 240–249.
STOC-1997-KargerLLPLL #consistency #distributed #protocol #web: Consistent Hashing and Random Trees: Distributed Caching Protocols for Relieving Hot Spots on the World Wide Web (DRK, EL, FTL, RP, MSL, DL), pp. 654–663.
SIGMOD-1996-HillyerS #online #scheduling: Random I/O Scheduling in Online Tertiary Storage Systems (BH, AS), pp. 195–204.
ICALP-1996-AblayevK #branch #on the #power of #source code: On the Power of Randomized Branching Programs (FMA, MK), pp. 348–356.
ICALP-1996-FarachM: Optimal Logarithmic Time Randomized Suffix Tree Construction (MF, SM), pp. 550–561.
ICALP-1996-FlajoletGP #polynomial: Random Polynomials and Polynomial Factorization (PF, XG, DP), pp. 232–243.
ICPR-1996-CooperHY #markov: A Markov random field model of subjective contour perception (PRC, SH, PY), pp. 100–104.
ICPR-1996-DelagnesB #graph #image #markov: Rectilinear structure extraction in textured images with an irregular, graph-based Markov random field model (PD, DB), pp. 800–804.
ICPR-1996-FungLK #2d #detection: Randomized generalized Hough transform for 2-D gray scale object detection (PFF, WSL, IK), pp. 511–515.
ICPR-1996-GonzalezC #classification #functional #markov: The Markov random fields in functional neighbors as a texture model: applications in texture classification (AMG, DC), pp. 815–819.
ICPR-1996-KalviainenBPK #classification: Mixed pixel classification with the randomized Hough transform (HK, PB, MP, JK), pp. 576–580.
ICPR-1996-SmitsD #adaptation #approach #image #markov #segmentation #using: Information fusion in a Markov random field-based image segmentation approach using adaptive neighbourhoods (PCS, SGD), pp. 570–575.
DAC-1996-HuttonGRC #generative: Characterization and Parameterized Random Generation of Digital Circuits (MDH, JPG, JR, DGC), pp. 94–99.
STOC-1996-GrigorievKHS #algebra #bound: A Lower Bound for Randomized Algebraic Decision Trees (DG, MK, FMadH, RS), pp. 612–619.
STOC-1996-Ta-Shma #on the: On Extracting Randomness From Weak Random Sources (ATS), pp. 276–285.
STOC-1996-Wilson #generative: Generating Random Spanning Trees More Quickly than the Cover Time (DBW), pp. 296–303.
LICS-1996-McColm #graph: Zero-One Laws for Gilbert Random Graphs (GLM), pp. 360–369.
ICDAR-v1-1995-Ho: Random decision forests (TKH), pp. 278–282.
ICDAR-v1-1995-ParkL #markov #recognition: Hidden Markov mesh random field: theory and its application to handwritten character recognition (HSP, SWL), pp. 409–412.
ICDAR-v2-1995-BouchaffraM #approach #information retrieval #markov: A Markovian random field approach to information retrieval (DB, JGM), pp. 997–1002.
ICALP-1995-Ben-AmramG #algebra #bound: Lower Bounds on Algebraic Random Access Machines (AMBA, ZG), pp. 360–371.
ICALP-1995-BlundoSPV #on the: On the Number of Random Bits in Totally Private Computation (CB, ADS, GP, UV), pp. 171–182.
ICALP-1995-FreivaldsK #bound: Lower Time Bounds for Randomized Computation (RF, MK), pp. 183–195.
CIKM-1995-ManolopoulosNPV #generative #on the: On the Generation of Aggregated Random Spatial Regions (YM, EN, GP, MV), pp. 318–325.
STOC-1995-AdlerCMR #parallel: Parallel randomized load balancing (MA, SC, MM, LER), pp. 238–247.
STOC-1995-CanettiI #bound #power of #scheduling: Bounding the power of preemption in randomized scheduling (RC, SI), pp. 606–615.
STOC-1995-Feige #graph: Randomized graph products, chromatic numbers, and Lovasz theta-function (UF), pp. 635–640.
STOC-1995-FeigeK #proving: Impossibility results for recycling random bits in two-prover proof systems (UF, JK), pp. 457–468.
STOC-1995-FiatK #locality #multi: Randomized and multipointer paging with locality of reference (AF, ARK), pp. 626–634.
STOC-1995-HenzingerK #algorithm #graph: Randomized dynamic graph algorithms with polylogarithmic time per operation (MRH, VK), pp. 519–527.
STOC-1995-Karger #approximate #network #polynomial #problem #reliability: A randomized fully polynomial time approximation scheme for the all terminal network reliability problem (DRK), pp. 11–17.
STOC-1995-KavrakiLMR #query: Randomized query processing in robot path planning (LEK, JCL, RM, PR), pp. 353–362.
STOC-1995-KremerNR #communication #complexity #on the: On randomized one-round communication complexity (IK, NN, DR), pp. 596–605.
LICS-1995-LynchT #graph #logic: The Infinitary Logic of Sparse Random Graphs (JFL, JT), pp. 46–53.
VLDB-1994-Galindo-LegariaPK #performance #question #why: Fast, Randomized Join-Order Selection — Why Use Transformations? (CAGL, AP, MLK), pp. 85–95.
ICALP-1994-Feige #algorithm #graph #performance: A Fast Randomized LOGSPACE Algorithm for Graph Connectivity (UF), pp. 499–507.
ICALP-1994-FreivaldsK #bound: Lower Space Bounds for Randomized Computation (RF, MK), pp. 580–592.
ICALP-1994-NikolestseasPSY #graph #multi #network #reliability: Short Vertex Disjoint Paths and Multiconnectivity in Random Graphs: Reliable Network Computing (SEN, KVP, PGS, MY), pp. 508–519.
LFP-1994-Chuang #array #functional #implementation #multi: A Randomized Implementation of Multiple Functional Arrays (TRC), pp. 173–184.
ICML-1994-Skalak #algorithm #feature model #prototype: Prototype and Feature Selection by Sampling and Random Mutation Hill Climbing Algorithms (DBS), pp. 293–301.
DAC-1994-IwamaH #generative #logic: Random Generation of Test Instances for Logic Optimizers (KI, KH), pp. 430–434.
STOC-1994-AlonK #graph: A spectral technique for coloring random 3-colorable graphs (NA, NK), pp. 346–355.
STOC-1994-BergDS #incremental #lazy evaluation #on the: On lazy randomized incremental construction (MdB, KD, OS), pp. 105–114.
STOC-1994-BrewerCL #scalability: Scalable expanders: exploiting hierarchical random wiring (EAB, FTC, TL), pp. 144–152.
STOC-1994-GoldreichW #product line #trade-off: Tiny families of functions with random properties (preliminary version): a quality-size trade-off for hashing (OG, AW), pp. 574–584.
STOC-1994-Karger #design #network #problem: Random sampling in cut, flow, and network design problems (DRK), pp. 648–657.
STOC-1994-KleinT #algorithm #linear: A randomized linear-time algorithm for finding minimum spanning trees (PNK, RET), pp. 9–15.
STOC-1994-KollerMS #algorithm #game studies #performance: Fast algorithms for finding randomized strategies in game trees (DK, NM, BvS), pp. 750–759.
STOC-1994-Miltersen #bound #problem: Lower bounds for union-split-find related problems on random access machines (PBM), pp. 625–634.
STOC-1994-Odlyzko: Search for the maximum of a random walk (AMO), pp. 336–345.
CAV-1994-MihailP #on the #protocol #testing: On the Random Walk Method for Protocol Testing (MM, CHP), pp. 132–141.
ICDAR-1993-BrzakovicV #authentication #documentation #recognition: Document recognition/authentication based on medium-embedded random patterns (DB, NV), pp. 95–98.
ICALP-1993-KarpinskiV #on the: On Randomized Versus Deterministic Computation (MK, RV), pp. 227–240.
ICML-1993-SuttonW #learning #online: Online Learning with Random Representations (RSS, SDW), pp. 314–321.
STOC-1993-BarnesF #graph: Short random walks on graphs (GB, UF), pp. 728–737.
STOC-1993-FreundKRRSS #automaton #finite #learning #performance: Efficient learning of typical finite automata from random walks (YF, MJK, DR, RR, RES, LS), pp. 315–324.
STOC-1993-KushilevitzMRZ #bound: Lower bounds for randomized mutual exclusion (EK, YM, MOR, DZ), pp. 154–163.
CSL-1993-GradelM #problem: Approximable Minimization Problems and Optimal Solutions on Random Inputs (EG, AM), pp. 139–149.
VLDB-1992-Antoshenkov #pseudo: Random Sampling from Pseudo-Ranked B+ Trees (GA), pp. 375–382.
ICALP-1992-Mansour #approximate: Randomized Interpolation and Approximation of Sparse Polynomials (YM), pp. 261–272.
DAC-1992-ChakrabortyAB #fault #generative #logic #modelling #testing: Delay Fault Models and Test Generation for Random Logic Sequential Circuits (TJC, VDA, MLB), pp. 165–172.
STOC-1992-AzarBKLP: Biased Random Walks (YA, AZB, ARK, NL, SP), pp. 1–9.
STOC-1992-BeameL #communication #complexity #nondeterminism: Randomized versus Nondeterministic Communication Complexity (PB, JL), pp. 188–199.
STOC-1992-BrightwellOW: Target Shooting with Programmed Random Variables (GB, TJO, PW), pp. 691–698.
STOC-1992-FeigeL #matrix #on the: On the Hardness of Computing the Permanent of Random Matrices (UF, CL), pp. 643–654.
STOC-1992-Kalai #algorithm: A Subexponential Randomized Simplex Algorithm (GK), pp. 475–482.
STOC-1992-KleinS #approximate #parallel: A Parallel Randomized Approximation Scheme for Shortest Paths (PNK, SS), pp. 750–758.
LICS-1992-GroveHK: Random Worlds and Maximum Entropy (AJG, JYH, DK), pp. 22–33.
ICALP-1991-CasasDM: Static on Random Trees (RC, JD, CM), pp. 186–203.
ICALP-1991-Hagerup #generative #parallel #performance #permutation: Fast Parallel Generation of Random Permutations (TH), pp. 405–416.
PLILP-1991-KeslerPR #approach #heuristic: A Randomized Heuristic Approach to Register Allocation (CWK, WJP, TR), pp. 195–206.
DAC-1991-PaterasR #correlation #generative #multi #testing: Generation of Correlated Random Patterns for the Complete Testing of Synthesized Multi-level Circuits (SP, JR), pp. 347–352.
STOC-1991-Babai #finite #generative #graph #transitive: Local Expansion of Vertex-Transitive Graphs and Random Generation in Finite Groups (LB), pp. 164–174.
STOC-1991-KarloffRR #algorithm #bound: Lower Bounds for Randomized k-Server and Motion Planning Algorithms (HJK, YR, YR), pp. 278–288.
SIGMOD-1990-IoannidisK #algorithm #optimisation #query #scalability: Randomized Algorithms for Optimizing Large Join Queries (YEI, YCK), pp. 312–321.
SIGMOD-1990-OlkenRX: Random Sampling from Hash Files (FO, DR, PX), pp. 375–386.
ICALP-1990-BookLT #pseudo #query: Additional Queries to Random and Pseudorandom Oracles (RVB, JHL, ST), pp. 283–293.
ICALP-1990-GuibasKS #diagrams #incremental: Randomized Incremental Construction of Delaunay and Voronoi Diagrams (LJG, DEK, MS), pp. 414–431.
STOC-1990-CoppersmithDRS #algorithm #graph #online: Random Walks on Weighted Graphs, and Applications to On-line Algorithms (DC, PD, PR, MS), pp. 369–378.
STOC-1990-GoddardKS #algorithm #sorting: Optimal Randomized Algorithms for Local Sorting and Set-Maxima (WG, VK, LJS), pp. 45–53.
VLDB-1989-OlkenR: Random Sampling from B+ Trees (FO, DR), pp. 269–277.
ICALP-1989-FeldmanINNRS #generative #modelling #on the: On Dice and Coins: Models of Computation for Random Generation (DF, RI, MN, NN, SR, AS), pp. 319–340.
STOC-1989-DyerFK #algorithm #approximate #polynomial: A Random Polynomial Time Algorithm for Approximating the Volume of Convex Bodies (MED, AMF, RK), pp. 375–381.
STOC-1989-FriedmanKS #graph #on the: On the Second Eigenvalue in Random Regular Graphs (JF, JK, ES), pp. 587–598.
STOC-1989-KurtzMR #morphism: The Isomorphism Conjecture Fails Relative to a Random Oracle (SAK, SRM, JSR), pp. 157–166.
STOC-1989-ReifS #geometry #named: Polling: A New Randomized Sampling Technique for Computational Geometry (JHR, SS), pp. 394–404.
NACLP-1989-Lin #backtracking #parallel #performance: Expected Performance of the Randomized Parallel Backtracking Method (ZL), pp. 677–696.
ICALP-1988-FlajoletGT #probability: Random Allocations and Probabilistic Languages (PF, DG, LT), pp. 239–253.
DAC-1988-Cirit #analysis #testing: Switch Level Random Pattern Testability Analysis (MAC), pp. 587–590.
STOC-1988-Broder #approximate #how: Errata to “How hard is to marry at random? (On the approximation of the permanent)” (AZB), p. 551.
STOC-1988-KarloffR #algorithm #pseudo: Randomized Algorithms and Pseudorandom Numbers (HJK, PR), pp. 310–321.
STOC-1988-KarpZ #bound #parallel: A Randomized Parallel Branch-and-Bound Procedure (RMK, YZ), pp. 290–300.
STOC-1988-VenkatesanL #graph #problem: Random Instances of a Graph Coloring Problem Are Hard (RV, LAL), pp. 217–222.
SIGIR-1987-Losee #database #documentation #modelling #retrieval: The Effect of Database Size on Document Retrieval: Random and Best-First Retrieval Models (RML), pp. 164–169.
DAC-1987-MazumderPF #algorithm #design #parallel #testing: Design and Algorithms for Parallel Testing of Random Access and Content Addressable Memories (PM, JHP, WKF), pp. 689–694.
STOC-1987-AdlemanH #polynomial: Recognizing Primes in Random Polynomial Time (LMA, MDAH), pp. 462–469.
STOC-1987-AggarwalA #algorithm: A Random NC Algorithm for Depth First Search (AA, RJA), pp. 325–334.
STOC-1987-Bach #algorithm #analysis: Realistic Analysis of Some Randomized Algorithms (EB), pp. 453–461.
STOC-1987-LichtensteinLS #process: Imperfect Random Sources and Discrete Controlled Processes (DL, NL, MES), pp. 169–177.
STOC-1987-ShelahS #graph: Threshold Spectra for Random Graphs (SS, JS), pp. 421–424.
VLDB-1986-OlkenR #database #relational: Simple Random Sampling from Relational Databases (FO, DR), pp. 160–169.
STOC-1986-Broder #approximate #how: How hard is to marry at random? (On the approximation of the permanent) (AZB), pp. 50–58.
STOC-1986-Cai #polynomial #probability: With Probability One, A Random Oracle Separates PSPACE from the Polynomial-Time Hierarchy (JyC), pp. 21–29.
STOC-1986-Clarkson #geometry: Further Applications of Random Sampling to Computational Geometry (KLC), pp. 414–423.
ICALP-1985-Jerrum #combinator #generative: Random Generation of Combinatorial Structures from a Uniform Distribution (MJ), pp. 290–299.
DAC-1985-Tendolkar #analysis #fault: Analysis of timing failures due to random AC defects in VLSI modules (NNT), pp. 709–714.
CAAP-1985-ProtasiT #on the: On the Maximum Size of Random Trees (MP, MT), pp. 139–144.
STOC-1985-BollobasFF #algorithm #graph: An Algorithm for Finding Hamilton Cycles in a Random Graph (BB, TIF, AMF), pp. 430–439.
STOC-1985-Bracha #protocol: An O(lg n) Expected Rounds Randomized Byzantine Generals Protocol (GB), pp. 316–326.
STOC-1985-KarpUW: Constructing a Perfect Matching is in Random NC (RMK, EU, AW), pp. 22–32.
STOC-1984-Gonnet #equivalence #polynomial: Determining Equivalence of Expressions in Random Polynomial Time (GHG), pp. 334–341.
STOC-1984-Vishkin #parallel: Randomized Speed-Ups in Parallel Computation (UV), pp. 230–239.
VLDB-1983-Orenstein: A Dynamic Hash File for Random and Sequential Accessing (JAO), pp. 132–141.
STOC-1983-Bach #how #integer: How to Generate Random Integers with Known Factorization (EB), pp. 184–188.
STOC-1983-Myers: The Random Access Hierarchy (DM), pp. 355–364.
DAC-1982-KangKL #adaptation #cpu #design #evolution #layout #logic #matrix: Gate matrix layout of random control logic in a 32-bit CMOS CPU chip adaptable to evolving logic design (SMK, RHK, HFSL), pp. 170–174.
STOC-1982-Kurtz #on the: On the Random Oracle Hypothesis (SAK), pp. 224–230.
ICALP-1981-HeintzS #decidability #polynomial: Absolute Primality of Polynomials is Decidable in Random Polynomial Time in the Number of Variables (JH, MS), pp. 16–28.
DAC-1981-McDermott #analysis #fault: Random fault analysis (RMM), pp. 360–364.
STOC-1981-BertoniMS #polynomial: A Characterization of the Class of Functions Computable in Polynomial Time on Random Access Machines (AB, GM, NS), pp. 168–176.
DAC-1980-ShirakawaOHTO #layout #logic: A layout system for the random logic portion of MOS LSI (IS, NO, TH, ST, HO), pp. 92–99.
STOC-1980-ReifS: Random Matroids (JHR, PGS), pp. 385–397.
ICALP-1979-Schonhage #on the #power of: On the Power of Random Access Machines (AS), pp. 520–529.
STOC-1978-FortuneW #parallel: Parallelism in Random Access Machines (SF, JW), pp. 114–118.
VLDB-J-1975-BayerM76 #on the: On the Encipherment of Search Trees and Random Access Files (RB, JKM), pp. 37–52.
VLDB-1975-BayerM #on the: On the Encipherment of Search Trees and Random Access Files (RB, JKM), p. 452.
SOSP-1973-Fuller #scheduling: Random Arrival and the MTPT Drum Scheduling Discipline (SHF), pp. 54–57.
STOC-1972-CookR #bound: Time-Bounded Random Access Machines (SAC, RAR), pp. 73–80.
SIGFIDET-1971-Nijssen #performance: Efficient Batch Updating of a Random File (GMN), pp. 173–186.
SIGIR-1971-Gustafson #combinator: Elements of the Randomized Combinatorial File Structure (RAG), pp. 163–174.