Stem random$ (all stems)

964 papers:

CASE-2015-BaeM #markov #modelling #multi #random

Markovian modeling of multiclass deterministic flow lines with random arrivals: The case of a single-channel (SYB, JRM), pp. 649–654.

DAC-2015-MilutinovicQAC #estimation #named #performance

PACO: fast average-performance estimation for time-randomized caches (SM, EQ, JA, FJC), p. 6.

DAC-2015-RozicYDV #generative #performance #random

Highly efficient entropy extraction for true random number generators on FPGAs (VR, BY, WD, IV), p. 6.

DAC-2015-SeyedzadehMJM #encoding #memory management #named #pseudo #reduction

PRES: pseudo-random encoding scheme to increase the bit flip reduction in the memory (SMS, RM, AKJ, RGM), p. 6.

DAC-2015-WangSBS #feedback #implementation #probability

Randomness meets feedback: stochastic implementation of logistic map dynamical system (ZW, NS, KB, AS), p. 7.

DATE-2015-Lastras-Montano #configuration management #hybrid #memory management #named

HReRAM: a hybrid reconfigurable resistive random-access memory (MALM, AG, KTC), pp. 1299–1304.

DATE-2015-YangRMDV #embedded #framework #generative #on the fly #random #testing

Embedded HW/SW platform for on-the-fly testing of true random number generators (BY, VR, NM, WD, IV), pp. 345–350.

HT-2015-WeningerJG #case study #random

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 #random #scalability

BEAR: Block Elimination Approach for Random Walk with Restart on Large Graphs (KS, JJ, LS, UK), pp. 1571–1585.

ESOP-2015-FetscherCPHF #automation #generative #random #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 #random

Reed-Muller Codes for Random Erasures and Errors (EA, AS, AW), pp. 297–306.

STOC-2015-BitanskyGLPT #encoding #random

Succinct Randomized Encodings and their Applications (NB, SG, HL, RP, ST), pp. 439–448.

STOC-2015-Czumaj #network #permutation #random #using

Random Permutations using Switching Networks (AC), pp. 703–712.

STOC-2015-FeldmanPV #complexity #on the #problem #random #satisfiability

On the Complexity of Random Satisfiability Problems with Planted Solutions (VF, WP, SV), pp. 77–86.

STOC-2015-HansenZ #algorithm

An Improved Version of the Random-Facet Pivoting Rule for the Simplex Algorithm (TDH, UZ), pp. 209–218.

STOC-2015-KorulaMZ #online #order #random

Online Submodular Welfare Maximization: Greedy Beats 1/2 in Random Order (NK, VSM, MZ), pp. 889–898.

STOC-2015-MirrokniZ #composition #distributed #random

Randomized Composable Core-sets for Distributed Submodular Maximization (VSM, MZ), pp. 153–162.

STOC-2015-Nikolov #problem #random

Randomized Rounding for the Largest Simplex Problem (AN), pp. 861–870.

CIAA-2015-HeamJ #automaton #generative #morphism #on the #random

On the Uniform Random Generation of Non Deterministic Automata Up to Isomorphism (PCH, JLJ), pp. 140–152.

CIAA-2015-HeamJ15a #automaton #generative #random #realtime

Random Generation and Enumeration of Accessible Deterministic Real-Time Pushdown Automata (PCH, JLJ), pp. 153–164.

ICALP-v1-2015-AgrawalIKP #complexity #encoding #perspective #random #statistics

Statistical Randomized Encodings: A Complexity Theoretic View (SA, YI, DK, APC), pp. 1–13.

ICALP-v1-2015-Avigdor-Elgrabli #on the #order #random

On the Randomized Competitive Ratio of Reordering Buffer Management with Non-Uniform Costs (NAE, SI, BM, YR), pp. 78–90.

ICALP-v1-2015-BeigiEG #distributed

Deterministic Randomness Extraction from Generalized and Distributed Santha-Vazirani Sources (SB, OE, AG), pp. 143–154.

ICALP-v1-2015-BjorklundDH #exponential #problem #random #set #strict

The Parity of Set Systems Under Random Restrictions with Applications to Exponential Time Problems (AB, HD, TH), pp. 231–242.

ICALP-v1-2015-LiP #fibonacci

Replacing Mark Bits with Randomness in Fibonacci Heaps (JL, JP), pp. 886–897.

ICALP-v2-2015-FriedrichK #graph #on the #random

On the Diameter of Hyperbolic Random Graphs (TF, AK), pp. 614–625.

LATA-2015-DaiW #algorithm #parallel #random #sequence

A Parallel Algorithm for Finding All Minimal Maximum Subsequences via Random Walk (HKD, ZW), pp. 133–144.

CHI-2015-Al-AmeenWS #multi #random #towards

Towards Making Random Passwords Memorable: Leveraging Users’ Cognitive Ability Through Multiple Cues (MNAA, MKW, SS), pp. 2315–2324.

HCI-IT-2015-SakoNK #estimation #random

Violin Fingering Estimation According to the Performer’s Skill Level Based on Conditional Random Field (SS, WN, TK), pp. 485–494.

ICML-2015-BarbosaENW #dataset #distributed #power of

The Power of Randomization: Distributed Submodular Maximization on Massive Datasets (RdPB, AE, HLN, JW), pp. 1236–1244.

ICML-2015-EneN #coordination #random

Random Coordinate Descent Methods for Minimizing Decomposable Submodular Functions (AE, HLN), pp. 787–795.

ICML-2015-JerniteRS #approach #learning #markov #modelling #performance #random

A Fast Variational Approach for Learning Markov Random Field Language Models (YJ, AMR, DS), pp. 2209–2217.

ICML-2015-NanWS #random

Feature-Budgeted Random Forest (FN, JW, VS), pp. 1983–1991.

ICML-2015-NutiniSLFK #coordination #performance #random

Coordinate Descent Converges Faster with the Gauss-Southwell Rule Than Random Selection (JN, MWS, IHL, MPF, HAK), pp. 1632–1641.

ICML-2015-RaskuttiM #algorithm #random #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 #random

Vector-Space Markov Random Fields via Exponential Families (WT, OHMP, ASS, PR), pp. 684–692.

ICML-2015-Yang0JZ15a #random #reduction

Theory of Dual-sparse Regularized Randomized Reduction (TY, LZ, RJ, SZ), pp. 305–314.

ICML-2015-ZhuE #approach #hybrid #probability #random #using

A Hybrid Approach for Probabilistic Inference using Random Projections (MZ, SE), pp. 2039–2047.

KDD-2015-CuiCHC #random

Optimal Action Extraction for Random Forests and Boosted Trees (ZC, WC, YH, YC), pp. 179–188.

KDD-2015-Kaban #bound #random

Improved Bounds on the Dot Product under Random Projection and Random Sign Projection (AK), pp. 487–496.

KDD-2015-YangLJ #big data #data analysis #optimisation

Big Data Analytics: Optimization and Randomization (TY, QL, RJ), p. 2327.

RecSys-2015-ChristoffelPNB #random #recommendation #scalability

Blockbusters and Wallflowers: Accurate, Diverse, and Scalable Recommendations with Random Walks (FC, BP, CN, AB), pp. 163–170.

SIGIR-2015-Carterette #effectiveness #random #testing

The Best Published Result is Random: Sequential Testing and its Effect on Reported Effectiveness (BC), pp. 747–750.

SIGIR-2015-DaiKC #distributed #how #random

How Random Decisions Affect Selective Distributed Search (ZD, YK, JC), pp. 771–774.

SIGIR-2015-NguyenKNZ #documentation #random #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 #random

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 #random #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 #random #testing

Random versus combinatorial effectiveness in software conformance testing: a case study (AC, AF, ET), pp. 1797–1802.

SAC-2015-JeremicPM #array #performance #random

Improving random write performance in heterogeneous erasure-coded drive arrays by offloading code block requests (NJ, HP, GM), pp. 2007–2014.

ISSTA-2015-LeSS #random

Randomized stress-testing of link-time optimizers (VL, CS, ZS), pp. 327–337.

ISSTA-2015-YatohSIH #generative #random testing #testing

Feedback-controlled random test generation (KY, KS, FI, SH), pp. 316–326.

SAT-2015-CaiLS #named #satisfiability

CCAnr: A Configuration Checking Based Local Search Solver for Non-random Satisfiability (SC, CL, KS), pp. 1–8.

DAC-2014-RahmanXFZST #generative #independence #named #random

TI-TRNG: Technology Independent True Random Number Generator (MTR, KX, DF, XZ, JS, MT), p. 6.

DAC-2014-SutariaRZRMC #modelling #random #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 #random #realtime #sequence

Acceptance and random generation of event sequences under real time calculus constraints (KB, PD), pp. 1–6.

DATE-2014-MatsutaniKFKTKBMA #3d #random

Low-latency wireless 3D NoCs via randomized shortcut chips (HM, MK, IF, TK, YT, TK, PB, RM, HA), pp. 1–6.

DRR-2014-TaoTX #documentation #learning #random #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 #random #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 #random #using

Reverse Top-k Search using Random Walk with Restart (AWY, NM, HS), pp. 401–412.

STOC-2014-CoudronY #constant #infinity

Infinite randomness expansion with a constant number of devices (MC, HY), pp. 427–436.

STOC-2014-DingSS #random #satisfiability

Satisfiability threshold for random regular NAE-SAT (JD, AS, NS), pp. 814–822.

STOC-2014-KesselheimTRV #online

Primal beats dual on online packing LPs in the random-order model (TK, KR, AT, BV), pp. 303–312.

STOC-2014-MillerS #protocol #quantum #robust #using

Robust protocols for securely expanding randomness and distributing keys using untrusted quantum devices (CAM, YS), pp. 417–426.

FLOPS-2014-ClaessenDP #generative #random

Generating Constrained Random Data with Uniform Distribution (KC, JD, MHP), pp. 18–34.

DLT-2014-Gusev #automaton #random

Synchronizing Automata with Random Inputs — (Short Paper) (VVG), pp. 68–75.

ICALP-v1-2014-BavarianGI #communication #on the

On the Role of Shared Randomness in Simultaneous Communication (MB, DG, TI), pp. 150–162.

ICALP-v1-2014-DemaineHLS

Canadians Should Travel Randomly (EDD, YH, CSL, KS), pp. 380–391.

ICALP-v1-2014-FouqueT #generative #random

Close to Uniform Prime Number Generation with Fewer Random Bits (PAF, MT), pp. 991–1002.

ICALP-v1-2014-Tzameret #algorithm #problem #random #satisfiability

Sparser Random 3-SAT Refutation Algorithms and the Interpolation Problem — (Extended Abstract) (IT), pp. 1015–1026.

ICALP-v1-2014-Yin #graph #random

Spatial Mixing of Coloring Random Graphs (YY), pp. 1075–1086.

ICALP-v2-2014-GiakkoupisSS #graph #random

Randomized Rumor Spreading in Dynamic Graphs (GG, TS, AS), pp. 495–507.

LATA-2014-Khanna #random

Matchings, Random Walks, and Sampling (SK), pp. 32–33.

CIKM-2014-GuoB #random #robust

Robust Entity Linking via Random Walks (ZG, DB), pp. 499–508.

ECIR-2014-MarcheggianiTE0 #aspect-oriented #mining #multi #random

Hierarchical Multi-label Conditional Random Fields for Aspect-Oriented Opinion Mining (DM, OT, AE, FS), pp. 273–285.

ICML-c1-2014-DenilMF #random

Narrowing the Gap: Random Forests In Theory and In Practice (MD, DM, NdF), pp. 665–673.

ICML-c1-2014-OrabonaHSJ #on the #random

On Measure Concentration of Random Maximum A-Posteriori Perturbations (FO, TH, ADS, TSJ), pp. 432–440.

ICML-c2-2014-0001MS #random

Coding for Random Projections (PL, MM, AS), pp. 676–684.

ICML-c2-2014-AhmedTBZDKB #detection #random

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 #random

Memory and Computation Efficient PCA via Very Sparse Random Projections (FPA, SMH), pp. 1341–1349.

ICML-c2-2014-ChwialkowskiG #independence #kernel #process #random

A Kernel Independence Test for Random Processes (KC, AG), pp. 1422–1430.

ICML-c2-2014-HamidXGD #random

Compact Random Feature Maps (RH, YX, AG, DD), pp. 19–27.

ICML-c2-2014-Hernandez-LobatoHG14a #matrix #probability

Probabilistic Matrix Factorization with Non-random Missing Data (JMHL, NH, ZG), pp. 1512–1520.

ICML-c2-2014-KnowlesGP #infinity #metric #normalisation #random #using

A reversible infinite HMM using normalised random measures (DAK, ZG, KP), pp. 1998–2006.

ICML-c2-2014-Lopez-PazSSGS #analysis #component #random

Randomized Nonlinear Component Analysis (DLP, SS, AJS, ZG, BS), pp. 1359–1367.

ICML-c2-2014-MizrahiDF #learning #linear #markov #parallel #random

Linear and Parallel Learning of Markov Random Fields (YDM, MD, NdF), pp. 199–207.

ICPR-2014-AggarwalM #algorithm #metric #multi #random

Extension of Sparse Randomized Kaczmarz Algorithm for Multiple Measurement Vectors (HKA, AM), pp. 1014–1019.

ICPR-2014-BaecchiTSBB #random #recognition

Fisher Vectors over Random Density Forests for Object Recognition (CB, FT, LS, ADB, ADB), pp. 4328–4333.

ICPR-2014-CordellaSFF #classification #random #reliability

Random Forest for Reliable Pre-classification of Handwritten Characters (LPC, CDS, FF, ASdF), pp. 1319–1324.

ICPR-2014-Desrosiers #adaptation #approach #image #performance #random #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 #random

Learning Flexible Binary Code for Linear Projection Based Hashing with Random Forest (SD, WZ, SC, YW), pp. 2685–2690.

ICPR-2014-GavriilidisT #classification #kernel #random #using

Random Walk Kernel Applications to Classification Using Support Vector Machines (VG, AT), pp. 3898–3903.

ICPR-2014-HeDY0PJ #multi #random #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 #random

Enhanced Random Forest with Image/Patch-Level Learning for Image Understanding (WLH, TKK, YP, CSC), pp. 3434–3439.

ICPR-2014-HusainDT #random #using

Recognizing Point Clouds Using Conditional Random Fields (FH, BD, CT), pp. 4257–4262.

ICPR-2014-KaradagV #image #markov #random

Fusion of Image Segmentations under Markov, Random Fields (ÖÖK, FTYV), pp. 930–935.

ICPR-2014-MaB #detection #incremental #random

Compound Exemplar Based Object Detection by Incremental Random Forest (KM, JBA), pp. 2407–2412.

ICPR-2014-OkadaFWP #analysis #random

Microenvironment-Based Protein Function Analysis by Random Forest (KO, LF, MW, DP), pp. 3138–3143.

ICPR-2014-PandaKC #graph #random #scalability #summary #using #video

Scalable Video Summarization Using Skeleton Graph and Random Walk (RP, SKK, ASC), pp. 3481–3486.

ICPR-2014-StraehleKKH #learning #multi #random

Multiple Instance Learning with Response-Optimized Random Forests (CNS, MK, UK, FAH), pp. 3768–3773.

ICPR-2014-TerissiPG #classification #random #using

Lip Reading Using Wavelet-Based Features and Random Forests Classification (LDT, MP, JCG), pp. 791–796.

ICPR-2014-WangCH #hybrid #markov #multi #random #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 #random

Exponential random graph estimation under differential privacy (WL, GM), pp. 921–930.

KDIR-2014-DomeniconiMMP #ontology #random

Discovering New Gene Functionalities from Random Perturbations of Known Gene Ontological Annotations (GD, MM, GM, PP), pp. 107–116.

KDIR-2014-KudamaL #random #semantics #using

Semantic Annotation of UMLS using Conditional Random Fields (SK, RBL), pp. 335–341.

RecSys-2014-KimC #collaboration #predict

Bayesian binomial mixture model for collaborative prediction with non-random missing data (YDK, SC), pp. 201–208.

SEKE-2014-HirasakiKT #interactive #random testing #testing

Applying Random Testing to Constrained Interaction Testing (YH, HK, TT), pp. 193–198.

SEKE-2014-ZhangCL #adaptation #random #sequence #testing

An Application of Adaptive Random Sequence in Test Case Prioritization (XZ, TYC, HL), pp. 126–131.

SEKE-2014-ZhuangZL #fine-grained #framework #layout #reuse #runtime

Runtime Code Reuse Attacks: A Dynamic Framework Bypassing Fine-Grained Address Space Layout Randomization (YZ, TZ, ZL), pp. 609–614.

SIGIR-2014-LengCL #image #learning #random #retrieval #scalability

Random subspace for binary codes learning in large scale image retrieval (CL, JC, HL), pp. 1031–1034.

SIGIR-2014-ZhuNG #adaptation #learning #random #social

An adaptive teleportation random walk model for learning social tag relevance (XZ, WN, MG), pp. 223–232.

SAC-2014-ChangHL #adaptation #clustering #optimisation #using

Optimizing FTL mapping cache for random-write workloads using adaptive block partitioning (LPC, SMH, WPL), pp. 1504–1510.

SAC-2014-HuangCLWL #adaptation #interactive #random #testing

Adaptive random prioritization for interaction test suites (RH, JC, ZL, RW, YL), pp. 1058–1063.

ICSE-2014-QiMLDW #automation #program repair #random

The strength of random search on automated program repair (YQ, XM, YL, ZD, CW), pp. 254–265.

CAV-2014-0001A #invariant #random #using

From Invariant Checking to Invariant Inference Using Randomized Search (RS, AA), pp. 88–105.

LICS-CSL-2014-Khoussainov #infinity #random

A quest for algorithmically random infinite structures (BK), p. 9.

SAT-2014-Bulatov0 #approximate #random #satisfiability

Approximating Highly Satisfiable Random 2-SAT (AAB, CW), pp. 384–398.

ASE-2013-KukrejaHT #game studies #testing #using

Randomizing regression tests using game theory (NK, WGJH, MT), pp. 616–621.

ASE-2013-ZhangGMK #random

Operator-based and random mutant selection: Better together (LZ, MG, DM, SK), pp. 92–102.

CASE-2013-KimM #equilibrium #on the #random

On the equilibrium probabilities of deterministic flow lines with random arrivals (WsK, JRM), pp. 723–729.

CASE-2013-SoviziK #matrix #nondeterminism #parallel #random #using

Uncertainty characterization in serial and parallel manipulators using random matrix theory (JS, VNK), pp. 312–317.

DAC-2013-ChenWBA #random #reuse #simulation #verification

Simulation knowledge extraction and reuse in constrained random processor verification (WC, LCW, JB, MSA), p. 6.

DAC-2013-KinsmanKN #generative #sequence #validation

Hardware-efficient on-chip generation of time-extensive constrained-random sequences for in-system validation (ABK, HFK, NN), p. 6.

DAC-2013-WuH #constraints #framework #multi #random #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 #random #using

A methodology for embedded classification of heartbeats using random projections (RB, GA, DA), pp. 899–904.

DATE-2013-ZhaiYZ #algorithm #float #random

GPU-friendly floating random walk algorithm for capacitance extraction of VLSI interconnects (KZ, WY, HZ), pp. 1661–1666.

DocEng-2013-SatkhozhinaAA #random #recognition #using

Optical font recognition using conditional random field (AS, IA, JPA), pp. 119–122.

ICDAR-2013-DelayeL #documentation #online #random

Graphics Extraction from Heterogeneous Online Documents with Hierarchical Random Fields (AD, CLL), pp. 1007–1011.

ICDAR-2013-RayCC #random #recognition #using

Character Recognition Using Conditional Random Field Based Recognition Engine (AR, AC, SC), pp. 18–22.

ICDAR-2013-ShivramZSNG #online #random #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 #random #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-Thonangi0 #permutation

Permuting Data on Random-Access Block Storage (RT, JY), pp. 721–732.

VLDB-2013-ZhaoCSZZ #on the #random

On the Embeddability of Random Walk Distances (XZ, AC, ADS, HZ, BYZ), pp. 1690–1701.

STOC-2013-CaputoMSS #algorithm #random

Random lattice triangulations: structure and algorithms (PC, FM, AS, AS), pp. 615–624.

STOC-2013-Wootters #fault #linear #on the #random #scalability

On the list decodability of random linear codes with large error rates (MW), pp. 853–860.

ICALP-v1-2013-BorosEGM #algorithm #game studies #probability #pseudo #random

A Pseudo-Polynomial Algorithm for Mean Payoff Stochastic Games with Perfect Information and a Few Random Positions (EB, KME, VG, KM), pp. 220–231.

ICALP-v1-2013-BringmannF #generative #geometry #graph #performance #random

Exact and Efficient Generation of Geometric Random Variates and Random Graphs (KB, TF), pp. 267–278.

ICALP-v1-2013-BulanekKS #on the #online #random

On Randomized Online Labeling with Polynomially Many Labels (JB, MK, MES), pp. 291–302.

ICALP-v1-2013-GrossiRRV #random #string

Dynamic Compressed Strings with Random Access (RG, RR, SRS, RV), pp. 504–515.

ICALP-v1-2013-Leonardos #bound #complexity #random #recursion

An Improved Lower Bound for the Randomized Decision Tree Complexity of Recursive Majority, (NL), pp. 696–708.

ICALP-v1-2013-MoruzN #algorithm #bound #random

Improved Space Bounds for Strongly Competitive Randomized Paging Algorithms (GM, AN), pp. 757–768.

ICALP-v2-2013-BachrachP #big data #performance #pseudo #recommendation #sketching #using

Sketching for Big Data Recommender Systems Using Fast Pseudo-random Fingerprints (YB, EP), pp. 459–471.

ICALP-v2-2013-SpirakisNR #graph #random

A Guided Tour in Random Intersection Graphs (PGS, SEN, CR), pp. 29–35.

ICFP-2013-St-AmourT #case study #experience #random testing #testing

Experience report: applying random testing to a base type environment (VSA, NT), pp. 351–356.

CIKM-2013-AkibaIY #linear #network #random #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 #random

Fast parameterless density-based clustering via random projections (JS, MV), pp. 861–866.

CIKM-2013-WangLZ #approach #graph #metric #multi #random #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 #random #scalability

A Randomized Mirror Descent Algorithm for Large Scale Multiple Kernel Learning (AA, AG, CS, MB), pp. 374–382.

ICML-c2-2013-GolovinSMY #learning #ram #scalability

Large-Scale Learning with Less RAM via Randomization (DG, DS, HBM, MY), pp. 325–333.

ICML-c3-2013-ChenRBT #metric #normalisation #random

Dependent Normalized Random Measures (CC, VR, WLB, YWT), pp. 969–977.

ICML-c3-2013-DenilMF #consistency #online #random

Consistency of Online Random Forests (MD, DM, NdF), pp. 1256–1264.

ICML-c3-2013-DingRIS #random #topic

Topic Discovery through Data Dependent and Random Projections (WD, MHR, PI, VS), pp. 1202–1210.

ICML-c3-2013-DurrantK #bound #classification #fault

Sharp Generalization Error Bounds for Randomly-projected Classifiers (RJD, AK), pp. 693–701.

ICML-c3-2013-KraehenbuehlK #convergence #learning #parametricity #random

Parameter Learning and Convergent Inference for Dense Random Fields (PK, VK), pp. 513–521.

ICML-c3-2013-Meng #random #scalability

Scalable Simple Random Sampling and Stratified Sampling (XM), pp. 531–539.

ICML-c3-2013-WytockK #algorithm #energy #random #theory and practice

Sparse Gaussian Conditional Random Fields: Algorithms, Theory, and Application to Energy Forecasting (MW, JZK), pp. 1265–1273.

KDD-2013-UganderKBK #clustering #graph #multi #network

Graph cluster randomization: network exposure to multiple universes (JU, BK, LB, JMK), pp. 329–337.

KDIR-KMIS-2013-Lindner #constraints #parsing #random #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 #random

Automatic Image Annotation with Low-level Features and Conditional Random Fields (AM, AB), pp. 197–201.

MLDM-2013-DincA #classification #evaluation #image #random #using

Evaluation of Hyperspectral Image Classification Using Random Forest and Fukunaga-Koontz Transform (SD, RSA), pp. 234–245.

MLDM-2013-SouzaP #random #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 #random

DrunkardMob: billions of random walks on just a PC (AK), pp. 257–264.

SEKE-2013-Alegroth #concept #proving #random #testing #user interface #visual notation

Random Visual GUI Testing: Proof of Concept (EA), pp. 178–183.

SIGIR-2013-GaoXX #query #random #using

Query expansion using path-constrained random walks (JG, GX, JX), pp. 563–572.

SIGIR-2013-RaiberK #clustering #documentation #markov #random #ranking #using

Ranking document clusters using markov random fields (FR, OK), pp. 333–342.

SIGIR-2013-YuL #incremental #named #random

IRWR: incremental random walk with restart (WY, XL), pp. 1017–1020.

PPDP-2013-Holdermans #data type #functional #guidelines #random testing #testing

Random testing of purely functional abstract datatypes: guidelines for dealing with operation invariance (SH), pp. 275–284.

SAC-2013-AlmeidaKG #data type #random

Random rules from data streams (EA, PK, JG), pp. 813–814.

SAC-2013-FuriaMOTW #automation #random testing #testing

The search for the laws of automatic random testing (CAF, BM, MO, AT, YW), pp. 1211–1216.

SAC-2013-HuangXCL #adaptation #algorithm #analysis #detection #implementation #parallel #random testing #testing

Failure-detection capability analysis of implementing parallelism in adaptive random testing algorithms (RH, XX, JC, YL), pp. 1049–1054.

ASPLOS-2013-ParkBCLN #harmful #manycore #memory management

Regularities considered harmful: forcing randomness to memory accesses to reduce row buffer conflicts for multi-core, multi-bank systems (HP, SB, JC, DL, SHN), pp. 181–192.

HPCA-2013-KoibuchiFMC #random

Layout-conscious random topologies for HPC off-chip interconnects (MK, IF, HM, HC), pp. 484–495.

VMCAI-2013-BiondiLMW #information management #protocol #random

Quantifying Information Leakage of Randomized Protocols (FB, AL, PM, AW), pp. 68–87.

CASE-2012-KimM #modelling #on the #probability #random #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 #random

Fast randomized planner for SLAM automation (AP, PS, KMK), pp. 765–770.

DAC-2012-PaekMSSK #markov #named #random

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 #random #testing

Low-cost implementations of on-the-fly tests for random number generators (FV, VR, IV), pp. 959–964.

PODS-2012-HuangYZ #algorithm #distributed #random

Randomized algorithms for tracking distributed count, frequencies, and ranks (ZH, KY, QZ), pp. 295–306.

VLDB-2012-FujiwaraNOK #performance #random

Fast and Exact Top-k Search for Random Walk with Restart (YF, MN, MO, MK), pp. 442–453.

STOC-2012-Applebaum #generative #locality #pseudo #random

Pseudorandom generators with long stretch and low locality from random local one-way functions (BA), pp. 805–816.

STOC-2012-GiakkoupisW #bound #random

A tight RMR lower bound for randomized mutual exclusion (GG, PW), pp. 983–1002.

STOC-2012-HardtR #matrix #random

Beating randomized response on incoherent matrices (MH, AR), pp. 1255–1268.

STOC-2012-MakarychevMV #algorithm #approximate #clustering #problem

Approximation algorithms for semi-random partitioning problems (KM, YM, AV), pp. 367–384.

STOC-2012-Molloy #graph #random

The freezing threshold for k-colourings of a random graph (MM), pp. 921–930.

STOC-2012-VaziraniV #generative #quantum #random

Certifiable quantum dice: or, true random number generation secure against quantum adversaries (UVV, TV), pp. 61–76.

ICALP-v1-2012-AchlioptasM #bound #random #satisfiability

Unsatisfiability Bounds for Random CSPs from an Energetic Interpolation Method (DA, RMM), pp. 1–12.

ICALP-v1-2012-JanssonSS #memory management #named #random

CRAM: Compressed Random Access Memory (JJ, KS, WKS), pp. 510–521.

ICALP-v2-2012-GugelmannPP #clustering #graph #random #sequence

Random Hyperbolic Graphs: Degree Sequence and Clustering — (Extended Abstract) (LG, KP, UP), pp. 573–585.

ICALP-v2-2012-KrystaV #design #on the fly #online #random

Online Mechanism Design (Randomized Rounding on the Fly) (PK, BV), pp. 636–647.

ICALP-v2-2012-Vocking #multi #random

Randomized Mechanisms for Multi-unit Auctions — (Extended Abstract) (BV), pp. 27–29.

CIKM-2012-Cohen #learning #metric #random #similarity

Learning similarity measures based on random walks (WWC), p. 3.

CIKM-2012-LinDH0S #automation #image #random #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 #random

PARMA: a parallel randomized algorithm for approximate association rules mining in MapReduce (MR, JAD, RF, EU), pp. 85–94.

CIKM-2012-XueKRKP #network #random #social

Delineating social network data anonymization via random edge perturbation (MX, PK, CR, PK, HKP), pp. 475–484.

ECIR-2012-LucchesePSVV #how #random

How Random Walks Can Help Tourism (CL, RP, FS, HV, RV), pp. 195–206.

ICML-2012-AlamgirL #distance #graph #nearest neighbour #random

Shortest path distance in random k-nearest neighbor graphs (MA, UvL), p. 163.

ICML-2012-ChenDB #metric #modelling #normalisation #random #topic

Dependent Hierarchical Normalized Random Measures for Dynamic Topic Modeling (CC, ND, WLB), p. 95.

ICML-2012-HazanJ #on the #random

On the Partition Function and Random Maximum A-Posteriori Perturbations (TH, TSJ), p. 217.

ICML-2012-KimKO #metric #parametricity #process #random #topic

Dirichlet Process with Mixed Random Measures: A Nonparametric Topic Model for Labeled Data (DK, SK, AHO), p. 90.

ICML-2012-ShiSHH #question #random

Is margin preserved after random projection? (QS, CS, RH, AvdH), p. 86.

ICML-2012-VaroquauxGT #clustering #correlation #design

Small-sample brain mapping: sparse recovery on spatially correlated designs with randomization and clustering (GV, AG, BT), p. 178.

ICPR-2012-DriraADSB #3d #novel #random #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 #random #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 #random

Active Shape Model with random forest for facial features detection (WJ, YF, ZZ, YT), pp. 593–596.

ICPR-2012-LeeLCY #lightweight #random #representation #using

Lightweight Random Ferns using binary representation (SL, SWL, YNC, HSY), pp. 1342–1345.

ICPR-2012-MorinDD #approach #multi #random #segmentation

A random walk approach for multiatlas-based segmentation (JPM, CD, LD), pp. 3636–3639.

ICPR-2012-RaoYBQL #online #random #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 #random #using

A learning framework for degraded document image binarization using Markov Random Field (BS, SL, CLT), pp. 3200–3203.

ICPR-2012-VillamizarGSM #learning #online #random #using

Online human-assisted learning using Random Ferns (MV, AG, AS, FMN), pp. 2821–2824.

ICPR-2012-ZhangRZY #detection #random

Contour detection via random forest (CZ, XR, YZ, MHY), pp. 2772–2775.

KDD-2012-XiongJXC #dependence #learning #metric #random

Random forests for metric learning with implicit pairwise position dependence (CX, DMJ, RX, JJC), pp. 958–966.

KDIR-2012-ChueaphunKMC #nearest neighbour #random #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 #random

Parsing and Maintaining Bibliographic References — Semi-supervised Learning of Conditional Random Fields with Constraints (SL, WH), pp. 233–238.

MLDM-2012-OshiroPB #how #question #random

How Many Trees in a Random Forest? (TMO, PSP, JAB), pp. 154–168.

RecSys-2012-PradelUG #evaluation #metric #ranking

Ranking with non-random missing ratings: influence of popularity and positivity on evaluation metrics (BP, NU, PG), pp. 147–154.

POPL-2012-ZhuMKR #approximate #performance #program transformation #random

Randomized accuracy-aware program transformations for efficient approximate computations (ZAZ, SM, JAK, MCR), pp. 441–454.

ICSE-2012-CeccatoMMNT #debugging #effectiveness #empirical #random testing #testing

An empirical study about the effectiveness of debugging when random test cases are used (MC, AM, LM, CDN, PT), pp. 452–462.

ICSE-2012-NistorLPGM #automation #clustering #generative #named #parallel #performance #random #testing #thread

Ballerina: Automatic generation and clustering of efficient random unit tests for multithreaded code (AN, QL, MP, TRG, DM), pp. 727–737.

PPoPP-2012-LeisersonSS #generative #parallel #thread

Deterministic parallel random-number generation for dynamic-multithreading platforms (CEL, TBS, JS), pp. 193–204.

ICLP-J-2012-IslamRR #logic programming #probability #random #source code

Inference in probabilistic logic programs with continuous random variables (MAI, CRR, IVR), pp. 505–523.

ICST-2012-Oriol #evaluation #fault #random testing #testing

Random Testing: Evaluation of a Law Describing the Number of Faults Found (MO), pp. 201–210.

LICS-2012-MullerT #random

Short Propositional Refutations for Dense Random 3CNF Formulas (SM, IT), pp. 501–510.

SAT-2012-AchlioptasM #algorithm #bound #exponential #random #satisfiability

Exponential Lower Bounds for DPLL Algorithms on Satisfiable Random 3-CNF Formulas (DA, RMM), pp. 327–340.

SAT-2012-Hugel #named #random #satisfiability

SATLab: X-Raying Random k-SAT — (Tool Presentation) (TH), pp. 424–429.

TAP-2012-CreignouES #framework #random #satisfiability #specification

A Framework for the Specification of Random SAT and QSAT Formulas (NC, UE, MS), pp. 163–168.

CASE-2011-LeH #analysis #random

Marginal analysis on binary pairwise Gibbs random fields (TL, CNH), pp. 316–321.

DAC-2011-AadithyaVDR #impact analysis #named #predict #probability #random

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 #random

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 #random #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 #random

A scaled random walk solver for fast power grid analysis (BB, SSS), pp. 38–43.

ICDAR-2011-MandalRP #documentation #random #segmentation #using

Signature Segmentation from Machine Printed Documents Using Conditional Random Field (RM, PPR, UP), pp. 1170–1174.

ICDAR-2011-PengCPN #random #using #video

Text Extraction from Video Using Conditional Random Fields (XP, HC, RP, PN), pp. 1029–1033.

ICDAR-2011-VinelDA #feature model #linear #optimisation #random

Joint Optimization of Hidden Conditional Random Fields and Non Linear Feature Extraction (AV, TMTD, TA), pp. 513–517.

ICDAR-2011-ZhangLYDW #random #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 #random #using

Transcript Mapping for Handwritten Text Lines Using Conditional Random Fields (XDZ, FY, DHW, QFW, MN, CLL), pp. 58–62.

VLDB-2011-Jin0MD #database #random #web

Randomized Generalization for Aggregate Suppression Over Hidden Web Databases (XJ, NZ, AM, GD), pp. 1099–1110.

FASE-2011-SharmaGAFM #question #random #testing

Testing Container Classes: Random or Systematic? (RS, MG, AA, GF, DM), pp. 262–277.

STOC-2011-DughmiRY #combinator #optimisation #random #towards

From convex optimization to randomized mechanisms: toward optimal combinatorial auctions (SD, TR, QY), pp. 149–158.

STOC-2011-FriedmannHZ #algorithm #bound #random

Subexponential lower bounds for randomized pivoting rules for the simplex algorithm (OF, TDH, UZ), pp. 283–292.

STOC-2011-GolabHW #distributed #implementation #random

Linearizable implementations do not suffice for randomized distributed computation (WMG, LH, PW), pp. 373–382.

STOC-2011-HolensteinKT #equivalence #random #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 #random

Tight bounds for parallel randomized load balancing: extended abstract (CL, RW), pp. 11–20.

STOC-2011-MahdianY #approach #online #random

Online bipartite matching with random arrivals: an approach based on strongly factor-revealing LPs (MM, QY), pp. 597–606.

CIAA-2011-CarninoF #automaton #generative #markov #random #using

Random Generation of Deterministic Acyclic Automata Using Markov Chains (VC, SDF), pp. 65–75.

CIAA-2011-SkvortsovT #automaton #case study #random #word

Experimental Study of the Shortest Reset Word of Random Automata (ES, ET), pp. 290–298.

ICALP-v1-2011-AllenderFG #power of #random #string

Limits on the Computational Power of Random Strings (EA, LF, WIG), pp. 293–304.

ICALP-v1-2011-Coja-OghlanP #process #random #satisfiability

The Decimation Process in Random k-SAT (ACO, AYPP), pp. 305–316.

ICALP-v1-2011-MagniezNSX #bound #complexity #random #recursion

Improved Bounds for the Randomized Decision Tree Complexity of Recursive Majority (FM, AN, MS, DX), pp. 317–329.

ICALP-v2-2011-DoerrF #random

Asymptotically Optimal Randomized Rumor Spreading (BD, MF), pp. 502–513.

ICALP-v2-2011-Shaltiel

An Introduction to Randomness Extractors (RS), pp. 21–41.

ICEIS-J-2011-Moghadampour11b #algorithm #random #search-based

Outperforming Mutation Operator with Random Building Block Operator in Genetic Algorithms (GM), pp. 178–192.

ICEIS-v2-2011-Moghadampour #algorithm #random #search-based

Random Building Block Operator for Genetic Algorithms (GM), pp. 54–62.

CIKM-2011-CuiLYJJHGCD #framework #multi #random

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 #random

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 #random

Link prediction: the power of maximal entropy random walk (RHL, JXY, JL), pp. 1147–1156.

CIKM-2011-WangZLBW #classification #multi #random #using

Using random walks for multi-label classification (CW, WZ, ZL, YB, JW), pp. 2197–2200.

ECIR-2011-ZhouH #comprehension #learning #natural language #random

Learning Conditional Random Fields from Unaligned Data for Natural Language Understanding (DZ, YH), pp. 283–288.

ICML-2011-Gould #learning #linear #markov #random

Max-margin Learning for Lower Linear Envelope Potentials in Binary Markov Random Fields (SG), pp. 193–200.

ICML-2011-SaxeKCBSN #learning #on the #random

On Random Weights and Unsupervised Feature Learning (AMS, PWK, ZC, MB, BS, AYN), pp. 1089–1096.

ICML-2011-ZhouT #composition #matrix #named #random

GoDec: Randomized Lowrank & Sparse Matrix Decomposition in Noisy Case (TZ, DT), pp. 33–40.

KDD-2011-BoleyLPG #performance #random

Direct local pattern sampling by efficient two-step random procedures (MB, CL, DP, TG), pp. 582–590.

KDD-2011-WilkinsonAN #classification #named #random

CHIRP: a new classifier based on composite hypercubes on iterated random projections (LW, AA, DTN), pp. 6–14.

MLDM-2011-AlshukriCZ #bound #detection #incremental #random #using

Incremental Web-Site Boundary Detection Using Random Walks (AA, FC, MZ), pp. 414–427.

MLDM-2011-AttigP #biology #comparison #image #random #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 #random #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 #random

Learning online discussion structures by conditional random fields (HW, CW, CZ, JH), pp. 435–444.

SAC-2011-Muramatsu #algorithm #online #random #verification

Random forgery attacks against DTW-based online signature verification algorithm (DM), pp. 27–28.

SAC-2011-SimKM #adaptation #approach #embedded #fuzzing #linux #random

Fuzzing the out-of-memory killer on embedded Linux: an adaptive random approach (KYS, FCK, RGM), pp. 387–392.

ICSE-2011-ArcuriB #algorithm #random #re-engineering #statistics #testing #using

A practical guide for using statistical tests to assess randomized algorithms in software engineering (AA, LCB), pp. 1–10.

ICST-2011-HeamN #data type #generative #named #random #recursion #testing

Seed: An Easy-to-Use Random Generator of Recursive Data Structures for Testing (PCH, CN), pp. 60–69.

ICTSS-2011-Gaudel #random testing #testing

Counting for Random Testing (MCG), pp. 1–8.

ICTSS-2011-SchwarzlAW #composition #random testing #testing #using

Compositional Random Testing Using Extended Symbolic Transition Systems (CS, BKA, FW), pp. 179–194.

ISSTA-2011-ArcuriB #adaptation #effectiveness #question #random testing #testing

Adaptive random testing: an illusion of effectiveness? (AA, LCB), pp. 265–275.

LICS-2011-Goubault-LarrecqV #random

Continuous Random Variables (JGL, DV), pp. 97–106.

LICS-2011-LeC #algorithm #formal method #random

Formalizing Randomized Matching Algorithms (DTML, SAC), pp. 185–194.

SAT-2011-GableskeH #named #random #satisfiability #using

EagleUP: Solving Random 3-SAT Using SLS with Unit Propagation (OG, MH), pp. 367–368.

TAP-2011-HeamM #approach #automaton #random testing #testing #using

A Random Testing Approach Using Pushdown Automata (PCH, CM), pp. 119–133.

QoSA-2010-BabkaTB #modelling #performance #predict #random #validation

Validating Model-Driven Performance Predictions on Random Software Systems (VB, PT, LB), pp. 3–19.

ASE-2010-ZhengZLX #generative #random #recommendation #sequence #testing

Random unit-test generation with MUT-aware sequence recommendation (WZ, QZ, MRL, TX), pp. 293–296.

CASE-2010-DahaneR #integration #process

Integration of subcontracting activity in a production planning for randomly failing manufacturing system: Feasibility and profitability conditions (MD, NR), pp. 100–105.

CASE-2010-HanSL #predict #random

Modified generalized predictive power control for wireless networked systems with random delays (CH, DS, ZL), pp. 509–514.

DATE-2010-ChenLWZXZ #memory management #random #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 #random

An adaptive code rate EDAC scheme for random access memory (CYC, CWW), pp. 735–740.

DocEng-2010-SpenglerG #documentation #layout #random #web

Document structure meets page layout: loopy random fields for web news content extraction (AS, PG), pp. 151–160.

VLDB-2010-ChaytorW #privacy

Small Domain Randomization: Same Privacy, More Utility (RC, KW), pp. 608–618.

FoSSaCS-2010-AsarinCV #game studies

Fair Adversaries and Randomization in Two-Player Games (EA, RCYF, DV), pp. 64–78.

TACAS-2010-ParizekK #component #detection #fault #java #performance #random #using

Efficient Detection of Errors in Java Components Using Random Environment and Restarts (PP, TK), pp. 451–465.

STOC-2010-BayatiGT #approach #combinator #graph #random #scalability

Combinatorial approach to the interpolation method and scaling limits in sparse random graphs (MB, DG, PT), pp. 105–114.

STOC-2010-GaoW #random

Load balancing and orientability thresholds for random hypergraphs (PG, NCW), pp. 97–104.

STOC-2010-GuruswamiHK #linear #on the #random

On the list-decodability of random linear codes (VG, JH, SK), pp. 409–416.

STOC-2010-KasiviswanathanRSU #correlation #matrix #random

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 #random #testing

Local list-decoding and testing of random linear codes from high error (SK, SS), pp. 417–426.

ICALP-v1-2010-FountoulakisP #multi #power of #random

Orientability of Random Hypergraphs and the Power of Multiple Choices (NF, KP), pp. 348–359.

ICALP-v2-2010-BerenbrinkCEG #performance #random

Efficient Information Exchange in the Random Phone-Call Model (PB, JC, RE, LG), pp. 127–138.

ICALP-v2-2010-EvenM #algorithm #online #random

An O(logn)-Competitive Online Centralized Randomized Packet-Routing Algorithm for Lines (GE, MM), pp. 139–150.

ICALP-v2-2010-Zetzsche #on the #random

On Erasing Productions in Random Context Grammars (GZ), pp. 175–186.

LATA-2010-PolicritiTV #random

A Randomized Numerical Aligner (rNA) (AP, AIT, FV), pp. 512–523.

IFM-2010-Baier #distributed #model checking #on the #random

On Model Checking Techniques for Randomized Distributed Systems (CB), pp. 1–11.

CIKM-2010-LangMWL #concept #markov #random #using

Improved latent concept expansion using hierarchical markov random fields (HL, DM, BW, JTL), pp. 249–258.

ICML-2010-BradleyG #learning #random

Learning Tree Conditional Random Fields (JKB, CG), pp. 127–134.

ICML-2010-Cesa-BianchiGVZ #graph #predict #random

Random Spanning Trees and the Prediction of Weighted Graphs (NCB, CG, FV, GZ), pp. 175–182.

ICML-2010-DeselaersF #learning #multi #random

A Conditional Random Field for Multiple-Instance Learning (TD, VF), pp. 287–294.

ICML-2010-LizotteBM #analysis #learning #multi #performance #random

Efficient Reinforcement Learning with Multiple Reward Functions for Randomized Controlled Trial Analysis (DJL, MHB, SAM), pp. 695–702.

ICML-2010-ZhuX #random #topic

Conditional Topic Random Fields (JZ, EPX), pp. 1239–1246.

ICPR-2010-AbdalaWJ #clustering #random

Ensemble Clustering via Random Walker Consensus Strategy (DDA, PW, XJ), pp. 1433–1436.

ICPR-2010-ArmanoH #prototype #random

Random Prototype-based Oracle for Selection-fusion Ensembles (GA, NH), pp. 77–80.

ICPR-2010-AslanAFACX #3d #image #random #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 #random #set

Cross Entropy Optimization of the Random Set Framework for Multiple Instance Learning (JB, PDG), pp. 3907–3910.

ICPR-2010-CaoZL #markov #random #using

Human Body Parts Tracking Using Sequential Markov Random Fields (XQC, JZ, ZQL), pp. 1759–1762.

ICPR-2010-CiompiPR #approach #random #using

A Meta-Learning Approach to Conditional Random Fields Using Error-Correcting Output Codes (FC, OP, PR), pp. 710–713.

ICPR-2010-DurrantK #bound #performance

A Bound on the Performance of LDA in Randomly Projected Data Spaces (RJD, AK), pp. 4044–4047.

ICPR-2010-ElmezainAM #gesture #random #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

Random Subspace Method in Text Categorization (MJG, MSK, RPWD), pp. 2049–2052.

ICPR-2010-GodecLSB #naive bayes #online #random

On-Line Random Naive Bayes for Tracking (MG, CL, AS, HB), pp. 3545–3548.

ICPR-2010-HarandiAABL #random #recognition

Directed Random Subspace Method for Face Recognition (MTH, MNA, BNA, AB, BCL), pp. 2688–2691.

ICPR-2010-HassanAMHW #authentication #image #self #using

Secure Self-Recovery Image Authentication Using Randomly-Sized Blocks (AMH, AAH, BM, YMYH, MAAW), pp. 1445–1448.

ICPR-2010-HuangDF #classification #estimation #multi #random

Head Pose Estimation Based on Random Forests for Multiclass Classification (CH, XD, CF), pp. 934–937.

ICPR-2010-KimL #markov #monte carlo #optimisation #random #using

Continuous Markov Random Field Optimization Using Fusion Move Driven Markov Chain Monte Carlo Technique (WK, KML), pp. 1364–1367.

ICPR-2010-KinnunenKLLK #categorisation #random #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 #random

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 #random

Part Detection, Description and Selection Based on Hidden Conditional Random Fields (WL, SW, XD), pp. 657–660.

ICPR-2010-MaTW #analysis #random #using

Nonlinear Blind Source Separation Using Slow Feature Analysis with Random Features (KM, QT, JW), pp. 830–833.

ICPR-2010-OkumuraTA #random #recognition #segmentation

Generic Object Recognition by Tree Conditional Random Field Based on Hierarchical Segmentation (TO, TT, YA), pp. 3025–3028.

ICPR-2010-RahtuSH #random #using

Compressing Sparse Feature Vectors Using Random Ortho-Projections (ER, MS, JH), pp. 1397–1400.

ICPR-2010-SonaA #multi #random

Multivariate Brain Mapping by Random Subspaces (DS, PA), pp. 2576–2579.

ICPR-2010-SulicPKK #distributed #random #reduction #using

Dimensionality Reduction for Distributed Vision Systems Using Random Projection (VS, JP, MK, SK), pp. 380–383.

ICPR-2010-TsagkatakisS #distance #modelling #random #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 #random

Shared Random Ferns for Efficient Detection of Multiple Categories (MV, FMN, JAC, AS), pp. 388–391.

ICPR-2010-WangH #multi #random #recognition #using

Cancelable Face Recognition Using Random Multiplicative Transform (YW, DH), pp. 1261–1264.

ICPR-2010-WoloszynskiK #classification #random

A Measure of Competence Based on Randomized Reference Classifier for Dynamic Ensemble Selection (TW, MK), pp. 4194–4197.

ICPR-2010-YangL10a #random #recognition #robust

Robust Sign Language Recognition with Hierarchical Conditional Random Fields (HDY, SWL), pp. 2202–2205.

ICPR-2010-ZhangW10a #modelling #random #validation

LLN-based Model-Driven Validation of Data Points for Random Sample Consensus Methods (LZ, DW), pp. 3436–3439.

KDD-2010-DurrantK #analysis #classification #linear

Compressed fisher linear discriminant analysis: classification of randomly projected data (RJD, AK), pp. 1119–1128.

KDD-2010-LaoC #execution #modelling #performance #query #random #retrieval

Fast query execution for retrieval models based on path-constrained random walks (NL, WWC), pp. 881–888.

KDD-2010-LinC #outsourcing #privacy #random

Privacy-preserving outsourcing support vector machines with random transformation (KPL, MSC), pp. 363–372.

KDD-2010-Steck #random #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 #random

Grafting-light: fast, incremental feature selection and structure learning of Markov random fields (JZ, NL, EPX), pp. 303–312.

KDIR-2010-CamposMO #random #recognition #using

Recognition of Gene/Protein Names using Conditional Random Fields (DC, SM, JLO), pp. 275–280.

KDIR-2010-ZhangSF #random

Conditional Random Fields for Term Extraction (XZ, YS, ACF), pp. 414–417.

KEOD-2010-ChatterjeeB #documentation #network #random #summary #using

Single Document Text Summarization using Random Indexing and Neural Networks (NC, AB), pp. 171–176.

SIGIR-2010-BuscherDC #quality #random #web

The good, the bad, and the random: an eye-tracking study of ad quality in web search (GB, STD, EC), pp. 42–49.

OOPSLA-2010-KleinFF #higher-order #random testing #source code #testing

Random testing for higher-order, stateful programs (CK, MF, RBF), pp. 555–566.

QAPL-2010-BarsottiW #abstraction #automation #probability #random #verification

Automatic Probabilistic Program Verification through Random Variable Abstraction (DB, NW), pp. 34–47.

SAC-2010-BlackshearV

R-LEAP+: randomizing LEAP+ key distribution to resist replay and jamming attacks (SB, RMV), pp. 1985–1992.

SAC-2010-FernandesLR #classification #random

The impact of random samples in ensemble classifiers (PF, LL, DDAR), pp. 1002–1009.

SAC-2010-LeeKM #named #performance #random

ReSSD: a software layer for resuscitating SSDs from poor small random write performance (YL, JSK, SM), pp. 242–243.

SAC-2010-LeeKWAHP #3d #finite #random #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 #random

Canonical random correlation analysis (JZ, DZ), pp. 1111–1112.

ICSE-2010-LaiCC #detection #parallel #random #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 #random

Is operator-based mutant selection superior to random mutant selection? (LZ, SSH, JJH, TX, HM), pp. 435–444.

ASPLOS-2010-BurckhardtKMN #debugging #probability #random

A randomized scheduler with probabilistic guarantees of finding bugs (SB, PK, MM, SN), pp. 167–178.

ICTSS-2010-ArcuriIB #black box #embedded #random #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.

ISSTA-2010-ArcuriIB #analysis #effectiveness #formal method #predict #random testing #testing

Formal analysis of the effectiveness and predictability of random testing (AA, MZZI, LCB), pp. 219–230.

SAT-2010-RathiARS #bound #random #satisfiability

Bounds on Threshold of Regular Random k-SAT (VR, EA, LKR, MS), pp. 264–277.

ASE-2009-JiangZCT #adaptation #random testing #testing

Adaptive Random Test Case Prioritization (BJ, ZZ, WKC, THT), pp. 233–244.

ASE-2009-LinTCZ #adaptation #approach #java #random testing #source code #testing

A Divergence-Oriented Approach to Adaptive Random Testing of Java Programs (YL, XT, YC, JZ), pp. 221–232.

CASE-2009-ZiedSN #maintenance #probability #random

An optimal production/maintenance planning under stochastic random demand, service level and failure rate (ZH, SD, NR), pp. 292–297.

DATE-2009-SafizadehTATB #nondeterminism #using

Using randomization to cope with circuit uncertainty (HS, MT, EKA, GT, KB), pp. 815–820.

ICDAR-2009-MontreuilGHN #2d #documentation #layout #random #using

Unconstrained Handwritten Document Layout Extraction Using 2D Conditional Random Fields (FM, EG, LH, SN), pp. 853–857.

ICDAR-2009-PanHL #image #locality #random

Text Localization in Natural Scene Images Based on Conditional Random Field (YFP, XH, CLL), pp. 6–10.

ICDAR-2009-PengSGSB #documentation #identification #markov #random

Markov Random Field Based Text Identification from Annotated Machine Printed Documents (XP, SS, VG, RS, KB), pp. 431–435.

ICDAR-2009-ZhouLN #online #random #recognition #string #using

Online Handwritten Japanese Character String Recognition Using Conditional Random Fields (XDZ, CLL, MN), pp. 521–525.

VLDB-2009-ChenLFCYH #graph #mining #random #summary

Mining Graph Patterns Efficiently via Randomized Summaries (CC, CXL, MF, MC, XY, JH), pp. 742–753.

VLDB-2009-SarmaLNX #algorithm #multi #random #streaming

Randomized Multi-pass Streaming Skyline Algorithms (ADS, AL, DN, J(X), pp. 85–96.

VLDB-2009-XiaoTC #multi #privacy #random

Optimal Random Perturbation at Multiple Privacy Levels (XX, YT, MC), pp. 814–825.

PLDI-2009-JoshiPSN #detection #program analysis #random

A randomized dynamic program analysis technique for detecting real deadlocks (PJ, CSP, KS, MN), pp. 110–120.

STOC-2009-AustrinH #independence

Randomly supported independence and resistance (PA, JH), pp. 483–492.

STOC-2009-FriedrichS #random

Near-perfect load balancing by randomized rounding (TF, TS), pp. 121–130.

STOC-2009-KannanN #linear #programming #random

Random walks on polytopes and an affine interior point method for linear programming (RK, HN), pp. 561–570.

STOC-2009-KolaitisK #graph #quantifier #random

Random graphs and the parity quantifier (PGK, SK), pp. 705–714.

STOC-2009-Sellie #learning #random

Exact learning of random DNF over the uniform distribution (LS), pp. 45–54.

CIAA-2009-HeamNS #automaton #generative #random

Random Generation of Deterministic Tree (Walking) Automata (PCH, CN, SS), pp. 115–124.

ICALP-v1-2009-Coja-Oghlan #algorithm #random #satisfiability

A Better Algorithm for Random k-SAT (ACO), pp. 292–303.

ICALP-v1-2009-ElsasserS #bound #multi #random

Tight Bounds for the Cover Time of Multiple Random Walks (RE, TS), pp. 415–426.

ICALP-v1-2009-GuhaH #bound #order #random #theorem

Revisiting the Direct Sum Theorem and Space Lower Bounds in Random Order Streams (SG, ZH), pp. 513–524.

ICALP-v1-2009-HoyrupR #effectiveness #probability

Applications of Effective Probability Theory to Martin-Löf Randomness (MH, CR), pp. 549–561.

ICALP-v2-2009-CooperFR #multi #random

Multiple Random Walks and Interacting Particle Systems (CC, AMF, TR), pp. 399–410.

ICALP-v2-2009-CooperIKK #graph #random #using

Derandomizing Random Walks in Undirected Graphs Using Locally Fair Exploration Strategies (CC, DI, RK, AK), pp. 411–422.

FM-2009-HasanAATA #random #reasoning

Formal Reasoning about Expectation Properties for Continuous Random Variables (OH, NA, BA, ST, RA), pp. 435–450.

IFM-2009-BuiN #random #verification

Formal Verification Based on Guided Random Walks (THB, AN), pp. 72–87.

SEFM-2009-BuiN #heuristic #model checking

Heuristic Sensitivity in Guided Random-Walk Based Model Checking (THB, AN), pp. 125–134.

ICEIS-J-2009-SchclarR #classification #random

Random Projection Ensemble Classifiers (AS, LR), pp. 309–316.

CIKM-2009-DaM #named #optimisation #random

RS-Wrapper: random write optimization for solid state drive (DZ, XM), pp. 1457–1460.

CIKM-2009-PattanasriMM #comprehension #graph #named #random

ComprehEnRank: estimating comprehension in classroom by absorbing random walks on a cognitive graph (NP, MM, MM), pp. 1769–1772.

CIKM-2009-XinKDL #framework #multi #random #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 #random #segmentation #using

Multi-class image segmentation using conditional random fields and global classification (NP, MT, SN), pp. 817–824.

ICML-2009-QianJZHW #higher-order #random #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 #random #scalability #using

Large-scale collaborative prediction using a nonparametric random effects model (KY, JDL, SZ, YG), pp. 1185–1192.

KDD-2009-ChenCBT #learning #optimisation #random

Constrained optimization for validation-guided conditional random field learning (MC, YC, MRB, AET), pp. 189–198.

KDD-2009-FrenoTG #estimation #hybrid #pseudo #random #scalability

Scalable pseudo-likelihood estimation in hybrid random fields (AF, ET, MG), pp. 319–328.

KDD-2009-HanhijarviOVPTM #data mining #mining

Tell me something I don’t know: randomization strategies for iterative data mining (SH, MO, NV, KP, NT, HM), pp. 379–388.

KDD-2009-JamaliE #named #random #recommendation #trust

TrustWalker: a random walk model for combining trust-based and item-based recommendation (MJ, ME), pp. 397–406.

KDD-2009-LiDJEL #random #recommendation

Grocery shopping recommendations based on basket-sensitive random walk (ML, MBD, IHJ, WED, PJGL), pp. 1215–1224.

KDD-2009-Mannila #data mining #mining

Randomization methods in data mining (HM), pp. 5–6.

MLDM-2009-LiHLG #concept #detection #random #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 #random

Fast Spectral Clustering with Random Projection and Sampling (TS, AI), pp. 372–384.

RecSys-2009-MarlinZ #collaboration #predict #ranking

Collaborative prediction and ranking with non-random missing data (BMM, RSZ), pp. 5–12.

SEKE-2009-LiuKC #adaptation #case study #random testing #testing

Dynamic Test Profiles in Adaptive Random Testing: A Case Study (HL, FCK, TYC), pp. 418–421.

SIGIR-2009-KeikhaCC #random #using

Blog distillation using random walks (MK, MJC, FC), pp. 638–639.

SIGIR-2009-Lease #markov #query #random

An improved markov random field model for supporting verbose queries (ML), pp. 476–483.

SIGIR-2009-LiWA #query #random

Extracting structured information from user queries with semi-supervised conditional random fields (XL, YYW, AA), pp. 572–579.

ECMDA-FA-2009-MougenotDBS #generative #metamodelling #random

Uniform Random Generation of Huge Metamodel Instances (AM, AD, XB, MS), pp. 130–145.

SAC-2009-ChenHKMM #adaptation #random testing #testing

Enhanced lattice-based adaptive random testing (TYC, DH, FCK, RGM, JM), pp. 422–429.

ICLP-2009-Namasivayam #logic programming #random #source code

Study of Random Logic Programs (GN), pp. 555–556.

ISSTA-2009-JiangS #automation #mining #random testing #testing

Automatic mining of functionally equivalent code fragments via random testing (LJ, ZS), pp. 81–92.

MBT-2009-DadeauLH #automaton #generative #on the #random #testing

On the Use of Uniform Random Generation of Automata for Testing (FD, JL, PCH), pp. 37–51.

VMCAI-2009-KiddRDV #debugging #random #using

Finding Concurrency-Related Bugs Using Random Isolation (NK, TWR, JD, MV), pp. 198–213.

ASE-2008-AndrewsGWX #effectiveness #random testing

Random Test Run Length and Effectiveness (JHA, AG, MW, RGX), pp. 19–28.

ASE-2008-Yom-TovTUH #automation #concurrent #debugging #random #source code

Automatic Debugging of Concurrent Programs through Active Sampling of Low Dimensional Random Projections (EYT, RT, SU, SH), pp. 307–316.

CASE-2008-XuDAG #3d #random #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.

DAC-2008-LiASR #array #design #memory management #modelling #probability #random #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 #random #simulation

Spatial Correlation Extraction via Random Field Simulation and Production Chip Performance Regression (BL), pp. 527–532.

DATE-2008-PlazaMB #constraints #generative #random #using

Random Stimulus Generation using Entropy and XOR Constraints (SP, ILM, VB), pp. 664–669.

DATE-2008-ZengC #analysis #polynomial #random

Deep Submicron Interconnect Timing Model with Quadratic Random Variable Analysis (JKZ, CPC), pp. 1091–1094.

VLDB-2008-NathG #maintenance #online #random #scalability

Online maintenance of very large random samples on flash storage (SN, PBG), pp. 970–983.

FoSSaCS-2008-GimbertH #game studies #probability #random

Simple Stochastic Games with Few Random Vertices Are Easy to Solve (HG, FH), pp. 5–19.

ICSM-2008-LiH #random testing #testing #using

Using random test selection to gain confidence in modified software (WL, MJH), pp. 267–276.

PLDI-2008-Sen #concurrent #random testing #source code #testing

Race directed random testing of concurrent programs (KS), pp. 11–21.

STOC-2008-BansalBN #algorithm #random

Randomized competitive algorithms for generalized caching (NB, NB, JN), pp. 235–244.

STOC-2008-CoteMP #random

Randomized k-server on hierarchical binary trees (AC, AM, LJP), pp. 227–234.

STOC-2008-DasguptaF #random

Random projection trees and low dimensional manifolds (SD, YF), pp. 537–546.

STOC-2008-DvirSY #bound #trade-off

Hardness-randomness tradeoffs for bounded depth arithmetic circuits (ZD, AS, AY), pp. 741–748.

STOC-2008-FriezeVV #graph #random

Logconcave random graphs (AMF, SV, JV), pp. 779–788.

ICALP-A-2008-AvinKL #evolution #graph #how #random

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 #random

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 #random #self

Randomized Self-assembly for Approximate Shapes (MYK, RTS), pp. 370–384.

ICALP-A-2008-PemmarajuS #random #symmetry

The Randomized Coloring Procedure with Symmetry-Breaking (SVP, AS), pp. 306–319.

ICALP-A-2008-Pritchard #distributed #performance #random

Fast Distributed Computation of Cuts Via Random Circulations (DP), pp. 145–160.

LATA-2008-BordihnH #distributed #random

Random Context in Regulated Rewriting VersusCooperating Distributed Grammar Systems (HB, MH), pp. 125–136.

CIKM-2008-LuLH #on the #random #similarity

On low dimensional random projections and similarity search (YEL, PL, SH), pp. 749–758.

CIKM-2008-WijayaB #random #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 #random #using

Academic conference homepage understanding using constrained hierarchical conditional random fields (XX, JL, JT, QL), pp. 1301–1310.

ICML-2008-KuzelkaZ #estimation #first-order #performance

Fast estimation of first-order clause coverage through randomization and maximum likelihood (OK, FZ), pp. 504–511.

ICML-2008-LongS #classification #random

Random classification noise defeats all convex potential boosters (PML, RAS), pp. 608–615.

ICPR-2008-BelleDS #detection #random #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 #random

Change detection based on adaptive Markov Random Fields (KC, CH, JC, ZZ, HL), pp. 1–4.

ICPR-2008-GuoYZZY #embedded #markov #random #using

Face super-resolution using 8-connected Markov Random Fields with embedded prior (KG, XY, RZ, GZ, SY), pp. 1–4.

ICPR-2008-HainesW #random #using

Combining shape-from-shading and stereo using Gaussian-Markov random fields (TSFH, RCW), pp. 1–4.

ICPR-2008-KimuraPTYK #markov #modelling #probability #random #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 #random

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 #random #segmentation

Classifiability criteria for refining of random walks segmentation (SR, AF, RE, KO), pp. 1–4.

ICPR-2008-ShenCLB #random #using

Stereo matching using random walks (RS, IC, XL, AB), pp. 1–4.

ICPR-2008-SinghNGBSP #hybrid #random #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 #random

Illumination invariants based on Markov random fields (PV, MH), pp. 1–4.

ICPR-2008-WattuyaRPJ #approach #multi #random

A random walker based approach to combining multiple segmentations (PW, KR, JSP, XJ), pp. 1–4.

RecSys-2008-YildirimK #collaboration #problem #random

A random walk method for alleviating the sparsity problem in collaborative filtering (HY, MSK), pp. 131–138.

SEKE-2008-CheonCLC #constraints #performance #random testing #testing

Integrating Random Testing with Constraints for Improved Efficiency and Diversity (YC, AC, GTL, MC), pp. 861–866.

SIGIR-2008-SerdyukovRH08a #modelling #random

Modeling expert finding as an absorbing random walk (PS, HR, DH), pp. 797–798.

SAC-2008-DegesysBR #random

Synchronization of strongly pulse-coupled oscillators with refractory periods and random medium access (JD, PB, JR), pp. 1976–1980.

SAC-2008-MartinottoJCGDP #generative #network #random

Generation of continuous random networks by simulated annealing (ALM, FJ, LAC, VG, RVD, CAP), pp. 48–49.

FSE-2008-ParkS #concurrent #detection #random #source code

Randomized active atomicity violation detection in concurrent programs (CSP, KS), pp. 135–145.

ICSE-2008-CiupaLOM #adaptation #named #object-oriented #random testing #testing

ARTOO: adaptive random testing for object-oriented software (IC, AL, MO, BM), pp. 71–80.

CGO-2008-LeeZ

Branch-on-random (EL, CBZ), pp. 84–93.

CGO-2008-SalverdakZ #predict #random

Accurate critical path prediction via random trace construction (PS, CT, CBZ), pp. 64–73.

CAV-2008-KimJRSPKS #analysis #random #simulation

Application of Formal Word-Level Analysis to Constrained Random Simulation (HK, HJ, KR, PS, JP, RPK, FS), pp. 487–490.

ICST-2008-CiupaPLOM #object-oriented #on the #predict #random testing #testing

On the Predictability of Random Tests for Object-Oriented Software (IC, AP, AL, MO, BM), pp. 72–81.

ISSTA-2008-PachecoLB #dot-net #fault #random testing #testing

Finding errors in .net with feedback-directed random testing (CP, SKL, TB), pp. 87–96.

LICS-2008-ChadhaSV #complexity #finite #monitoring #on the

On the Expressiveness and Complexity of Randomization in Finite State Monitors (RC, APS, MV), pp. 18–29.

MBT-2008-GaudelDGLOP #modelling #random

Coverage-biased Random Exploration of Models (MCG, AD, SDG, RL, JO, SP), pp. 3–14.

SAT-2008-CreignouDER #quantifier #random

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

Random Instances of W[2]-Complete Problems: Thresholds, Complexity, and Algorithms (YG), pp. 91–104.

ASE-2007-AndrewsLM #generative #named #testing

Nighthawk: a two-level genetic-random unit test data generator (JHA, FCHL, TM), pp. 144–153.

ASE-2007-Sen #concurrent #effectiveness #random testing #source code #testing

Effective random testing of concurrent programs (KS), pp. 323–332.

CASE-2007-LamiriDX #random

Operating Room Planning with Random Surgery Times (ML, JD, XX), pp. 521–526.

CASE-2007-TanonkouBX #design #multi #network #random

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 #random

RIJID: Random Code Injection to Mask Power Analysis based Side Channel Attacks (JAA, RGR, SP), pp. 489–492.

DAC-2007-GuSK #modelling #random #statistics

Width-dependent Statistical Leakage Modeling for Random Dopant Induced Threshold Voltage Shift (JG, SSS, CHK), pp. 87–92.

DAC-2007-Levitan #graph #random

You Can Get There From Here: Connectivity of Random Graphs on Grids (SPL), pp. 272–273.

DATE-2007-HaastregtK #interactive #optimisation #performance #random #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

Random sampling of moment graph: a stochastic Krylov-reduction algorithm (ZZ, JRP), pp. 1502–1507.

DRR-2007-ShettySBS #documentation #random #segmentation #using

Segmentation and labeling of documents using conditional random fields (SS, HS, MJB, SNS).

ICDAR-2007-BernardAH #random #recognition #using

Using Random Forests for Handwritten Digit Recognition (SB, SA, LH), pp. 1043–1047.

ICDAR-2007-NicolasDPH #2d #documentation #image #random #segmentation #using

Document Image Segmentation Using a 2D Conditional Random Field Model (SN, JD, TP, LH), pp. 407–411.

ICDAR-2007-ShettySS #random #recognition #using #word

Handwritten Word Recognition Using Conditional Random Fields (SS, HS, SNS), pp. 1098–1102.

ICDAR-2007-ZhouLQA #classification #markov #random

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 #random

A random walk approach to sampling hidden databases (AD, GD, HM), pp. 629–640.

VLDB-2007-BatiGHS #approach #database #random testing #search-based #testing

A genetic approach for random testing of database systems (HB, LG, SH, AS), pp. 1243–1251.

VLDB-2007-XuJ #algorithm #query #random

Randomized Algorithms for Data Reconciliation in Wide Area Aggregate Query Processing (FX, CJ), pp. 639–650.

STOC-2007-AttiyaC #bound #random

Tight bounds for asynchronous randomized consensus (HA, KC), pp. 155–164.

STOC-2007-BeameJR #algorithm #bound #random

Lower bounds for randomized read/write stream algorithms (PB, TSJ, AR), pp. 689–698.

STOC-2007-BrinkmanKL #graph #random #reduction

Vertex cuts, random walks, and dimension reduction in series-parallel graphs (BB, AK, JRL), pp. 621–630.

STOC-2007-HayesVV #graph

Randomly coloring planar graphs with fewer colors than the maximum degree (TPH, JCV, EV), pp. 450–458.

STOC-2007-ShaltielU #trade-off

Low-end uniform hardness vs. randomness tradeoffs for AM (RS, CU), pp. 430–439.

STOC-2007-VuT #matrix

The condition number of a randomly perturbed matrix (VHV, TT), pp. 248–255.

CIAA-2007-BassinoDN #automaton #library

: A Library to Randomly and Exhaustively Generate Automata (FB, JD, CN), pp. 303–305.

ICALP-2007-AlonCHKRS #algorithm #graph

Quasi-randomness and Algorithmic Regularity for Graphs with General Degree Distributions (NA, ACO, HH, MK, VR, MS), pp. 789–800.

ICALP-2007-ChandranGS #random

Ring Signatures of Sub-linear Size Without Random Oracles (NC, JG, AS), pp. 423–434.

ICALP-2007-Coja-OghlanPS #graph #on the #random

On the Chromatic Number of Random Graphs (ACO, KP, AS), pp. 777–788.

ICALP-2007-GuhaM #bound #estimation #multi #streaming

Lower Bounds for Quantile Estimation in Random-Order and Multi-pass Streaming (SG, AM), pp. 704–715.

HCI-AS-2007-ZhangLL #algorithm #fault #random

A Routing Algorithm for Random Error Tolerance in Network-on-Chip (LZ, HL, XL), pp. 1210–1219.

ICEIS-J-2007-LiuCM07a #comparison #random #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 #random

Index compression is good, especially for random access (SB, CLAC), pp. 761–770.

CIKM-2007-FanizzidE #clustering #concept #induction #knowledge base #metric #random #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 #random

Automatic feature selection in the markov random field model for information retrieval (DM), pp. 253–262.

ECIR-2007-PlachourasO #documentation #modelling #multi #retrieval

Multinomial Randomness Models for Retrieval with Document Fields (VP, IO), pp. 28–39.

ICML-2007-AgarwalC #graph #learning #random #rank

Learning random walks to rank nodes in graphs (AA, SC), pp. 9–16.

ICML-2007-Azran #algorithm #learning #markov #multi #random

The rendezvous algorithm: multiclass semi-supervised learning with Markov random walks (AA), pp. 49–56.

ICML-2007-SuttonM #performance #pseudo #random

Piecewise pseudolikelihood for efficient training of conditional random fields (CAS, AM), pp. 863–870.

ICML-2007-ZhangAV #learning #multi #random

Conditional random fields for multi-agent reinforcement learning (XZ, DA, SVNV), pp. 1143–1150.

ICML-2007-ZhuNZW #markov #random #web

Dynamic hierarchical Markov random fields and their application to web data extraction (JZ, ZN, BZ, JRW), pp. 1175–1182.

KDD-2007-Li #random #reduction

Very sparse stable random projections for dimension reduction in lalpha (0 &lt;alpha<=2) norm (PL0), pp. 440–449.

MLDM-2007-TanN #data mining #mining #privacy #probability #re-engineering

Generic Probability Density Function Reconstruction for Randomization in Privacy-Preserving Data Mining (VYFT, SKN), pp. 76–90.

SEKE-2007-ChanCT #parametricity #random testing #strict #testing

Controlling Restricted Random Testing: An Examination of the Exclusion Ratio Parameter (KPC, TYC, DT), pp. 163–166.

SEKE-2007-ChenKL #adaptation #on the #random testing #testing

On Test Case Distributions of Adaptive Random Testing (TYC, FCK, HL), pp. 141–144.

SEKE-2007-KuoSSTZ #random testing #source code #testing

Enhanced Random Testing for Programs with High Dimensional Input Domains (FCK, KYS, CaS, SFT, ZZ), pp. 135–140.

SIGIR-2007-BlancoL #information retrieval #random

Random walk term weighting for information retrieval (RB, CL), pp. 829–830.

SIGIR-2007-CraswellS #graph #random

Random walks on the click graph (NC, MS), pp. 239–246.

SIGIR-2007-MetzlerC #concept #markov #random #using

Latent concept expansion using markov random fields (DM, WBC), pp. 311–318.

SAC-2007-KuoCLC #adaptation #random testing #testing

Enhancing adaptive random testing in high dimensional input domains (FCK, TYC, HL, WKC), pp. 1467–1472.

SAC-2007-LiuT #game studies #random

Eigen-distribution on assignments for game trees with random properties (CL, KT), pp. 78–79.

SAC-2007-MilsztajnG #3d #algorithm #markov #random #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 #random #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 #random #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 #random

An adaptive randomized search protocol in peer-to-peer systems (YW, TI, FO, HK, TM), pp. 533–537.

SAC-2007-ZhangZZMY #algorithm #random #streaming

A priority random sampling algorithm for time-based sliding windows over weighted streaming data (LZ, ZL, YQZ, YM, ZY), pp. 453–456.

ESEC-FSE-2007-SaulFDB #random #recommendation

Recommending random walks (ZMS, VF, PTD, CB), pp. 15–24.

ICSE-2007-DwyerEPP #parallel #random

Parallel Randomized State-Space Search (MBD, SGE, SP, RP), pp. 3–12.

ICSE-2007-GroceHJ #difference #random #testing #verification

Randomized Differential Testing as a Prelude to Formal Verification (AG, GJH, RJ), pp. 621–631.

ICSE-2007-PachecoLEB #generative #random testing #testing

Feedback-Directed Random Test Generation (CP, SKL, MDE, TB), pp. 75–84.

CAV-2007-MatsliahS #approximate #encryption #model checking #random

Underapproximation for Model-Checking Based on Random Cryptographic Constructions (AM, OS), pp. 339–351.

ISSTA-2007-CiupaLOM #assessment #object-oriented #random testing #testing

Experimental assessment of random testing for object-oriented software (IC, AL, MO, BM), pp. 84–94.

RTA-2007-Oostrom #random

Random Descent (VvO), pp. 314–328.

CASE-2006-TanonkouBX #design #network #random

Distribution network design with random demand and unreliable suppliers (GAT, LB, XX), pp. 15–20.

DATE-2006-KruppM #classification #functional #random testing #testing

Classification trees for random tests and functional coverage (AK, WM), pp. 1031–1032.

PODS-2006-GroheHS #bound #random #scalability #set

Randomized computations on large data sets: tight lower bounds (MG, AH, NS), pp. 243–252.

PODS-2006-MotwaniX #evolution #graph #modelling #random #web

Evolution of page popularity under random web graph models (RM, YX), pp. 134–142.

SIGMOD-2006-RusuD #estimation #performance #random

Fast range-summable random variables for efficient aggregate estimation (FR, AD), pp. 193–204.

VLDB-2006-DrineasM #algorithm #matrix #random #set

Randomized Algorithms for Matrices and Massive Data Sets (PD, MWM), p. 1269.

ITiCSE-2006-Nau #random

A random number (RWN), p. 345.

STOC-2006-AchlioptasR #constraints #geometry #on the #problem #random

On the solution-space geometry of random constraint satisfaction problems (DA, FRT), pp. 130–139.

STOC-2006-DobzinskiNS #combinator #random

Truthful randomized mechanisms for combinatorial auctions (SD, NN, MS), pp. 644–652.

STOC-2006-DubrovI #complexity #on the #performance

On the randomness complexity of efficient sampling (BD, YI), pp. 711–720.

STOC-2006-Impagliazzo #algorithm #question #random

Can every randomized algorithm be derandomized? (RI), pp. 373–374.

STOC-2006-KelnerS #algorithm #linear #polynomial #programming #random

A randomized polynomial-time simplex algorithm for linear programming (JAK, DAS), pp. 51–60.

STOC-2006-Zhang #bound #quantum #random

New upper and lower bounds for randomized and quantum local search (SZ), pp. 634–643.

CIAA-2006-Tischler #automaton #finite #random #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 #random

An Adaptive Spectral Heuristic for Partitioning Random Graphs (ACO), pp. 691–702.

ICALP-v1-2006-Coja-OghlanL #graph #random

The Spectral Gap of Random Graphs with Given Expected Degrees (ACO, AL), pp. 15–26.

ICALP-v1-2006-Radhakrishnan #lazy evaluation #random #using

Gap Amplification in PCPs Using Lazy Random Walks (JR), pp. 96–107.

ICALP-v2-2006-DodisR #on the #quantum #using

On the Impossibility of Extracting Classical Randomness Using a Quantum Computer (YD, RR), pp. 204–215.

SEFM-2006-RaymondJR #random

Describing and Executing Random Reactive Systems (PR, EJ, YR), pp. 216–225.

AdaEurope-2006-ChenHZ #adaptation #clustering #random testing #testing

Adaptive Random Testing Through Iterative Partitioning (TYC, DH, ZZ), pp. 155–166.

ICEIS-DISI-2006-LongboZMYY #algorithm #data type #random

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 #random

Quadratic programming relaxations for metric labeling and Markov random field MAP estimation (PDR, JDL), pp. 737–744.

ICML-2006-VishwanathanSSM #probability #random

Accelerated training of conditional random fields with stochastic gradient methods (SVNV, NNS, MWS, KPM), pp. 969–976.

ICPR-v1-2006-DemonceauxV #adaptation #markov #random

Adaptative Markov Random Fields for Omnidirectional Vision (CD, PV), pp. 848–851.

ICPR-v1-2006-Fisher #distributed

Scene recovery from many randomly distributed single pixel cameras (RBF), pp. 988–991.

ICPR-v1-2006-GaoW #random #recognition

Boosting in Random Subspaces for Face Recognition (YG, YW), pp. 519–522.

ICPR-v1-2006-ZengL #markov #random #segmentation #using

Stroke Segmentation of Chinese Characters Using Markov Random Fields (JZ, ZQL), pp. 868–871.

ICPR-v1-2006-ZengL06a #fuzzy #markov #random #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 #random #segmentation #using

New MRF Parameter Estimation Technique for Texture Image Segmentation using Hierarchical GMRF Model Based on Random Spatial Interaction and Mean Field Theory (DHK, IDY, SUL), pp. 365–368.

ICPR-v2-2006-PriorW #fault #parametricity #probability #random #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 #random #using

Detecting Coarticulation in Sign Language using Conditional Random Fields (RY, SS), pp. 108–112.

ICPR-v3-2006-KongHXTG #random #video

A Conditional Random Field Model for Video Super-resolution (DK, MH, WX, HT, YG), pp. 619–622.

ICPR-v3-2006-ZhongW #detection #markov #random

Object Detection Based on Combination of Conditional Random Field and Markov Random Field (PZ, RW), pp. 160–163.

ICPR-v4-2006-KoSB #random

A New Objective Function for Ensemble Selection in Random Subspaces (AHRK, RS, AdSBJ), pp. 185–188.

KDD-2006-FanMY #framework #performance #random #summary

A general framework for accurate and fast regression by data summarization in random decision trees (WF, JM, PSY), pp. 136–146.

KDD-2006-GionisMMT #data mining #mining

Assessing data mining results via swap randomization (AG, HM, TM, PT), pp. 167–176.

KDD-2006-LiHC #random

Very sparse random projections (PL, TH, KWC), pp. 287–296.

SEKE-2006-Mayer #clustering #effectiveness #performance #random testing #testing

Efficient and Effective Random Testing based on Partitioning and Neighborhood (JM), pp. 479–484.

SIGIR-2006-HarabagiuLH #modelling #random

Answering complex questions with random walk models (SMH, VFL, AH), pp. 220–227.

SAC-2006-XuC

Improving address space randomization with a dynamic offset randomization technique (HX, SJC), pp. 384–391.

SAT-2006-Zhang #random

A Complete Random Jump Strategy with Guiding Paths (HZ), pp. 96–101.

ASE-2005-ChenM #random testing #testing

Quasi-random testing (TYC, RGM), pp. 309–312.

ASE-2005-Mayer #adaptation #random testing #testing

Lattice-based adaptive random testing (JM), pp. 333–336.

DAC-2005-BhardwajV #random

Leakage minimization of nano-scale circuits in the presence of systematic and random variations (SB, SBKV), pp. 541–546.

ICDAR-2005-NicolasKPH #documentation #markov #random #segmentation #using

Handwritten Document Segmentation Using Hidden Markov Random Fields (SN, YK, TP, LH), pp. 212–216.

ICDAR-2005-Szummer #diagrams #learning #random

Learning Diagram Parts with Hidden Random Fields (MS), pp. 1188–1193.

ICDAR-2005-ZengL #markov #random #recognition

Markov Random Fields for Handwritten Chinese Character Recognition (JZ, ZQL), pp. 101–105.

PODS-2005-GroheS #bound #memory management #random #sorting

Lower bounds for sorting with few random accesses to external memory (MG, NS), pp. 238–249.

SIGMOD-2005-HuangDC #random

Deriving Private Information from Randomized Data (ZH, WD, BC), pp. 37–48.

VLDB-2005-PandeyROCC #random #ranking

Shuffling a Stacked Deck: The Case for Partially Randomized Ranking of Search Engine Results (SP, SR, CO, JC, SC), pp. 781–792.

PLDI-2005-GodefroidKS #automation #named #random testing #testing

DART: directed automated random testing (PG, NK, KS), pp. 213–223.

STOC-2005-Alekhnovich #bound #random

Lower bounds for k-DNF resolution on random 3-CNFs (MA), pp. 251–256.

STOC-2005-HajiaghayiKLR #graph #random

Oblivious routing in directed graphs with random demands (MTH, JHK, TL, HR), pp. 193–201.

STOC-2005-Raz #random

Extractors with weak random seeds (RR), pp. 11–20.

STOC-2005-Regev #encryption #fault #learning #linear #on the #random

On lattices, learning with errors, random linear codes, and cryptography (OR), pp. 84–93.

STOC-2005-SanghviV #complexity #random

The round complexity of two-party random selection (SS, SPV), pp. 338–347.

STOC-2005-TaoV #matrix #on the #random

On random pm 1 matrices: singularity and determinant (TT, VHV), pp. 431–440.

STOC-2005-Vu #matrix #random

Spectral norm of random matrices (VHV), pp. 423–430.

ICALP-2005-AvinE #geometry #graph #on the #random

On the Cover Time of Random Geometric Graphs (CA, GE), pp. 677–689.

ICALP-2005-DiehlM #bound #polynomial #random

Time-Space Lower Bounds for the Polynomial-Time Hierarchy on Randomized Machines (SD, DvM), pp. 982–993.

ICALP-2005-EfthymiouS #graph #on the #random

On the Existence of Hamiltonian Cycles in Random Intersection Graphs (CE, PGS), pp. 690–701.

ICALP-2005-Hast #approximate #linear #named #random

Approximating — Outperforming a Random Assignment with Almost a Linear Factor (GH), pp. 956–968.

ICALP-2005-KaoSS #design #performance #random #word

Randomized Fast Design of Short DNA Words (MYK, MS, RTS), pp. 1275–1286.

ICALP-2005-Kavitha #algorithm #graph #random

An Õ(m2n) Randomized Algorithm to Compute a Minimum Cycle Basis of a Directed Graph (TK), pp. 273–284.

ICALP-2005-Mislove #random

Discrete Random Variables over Domains (MWM), pp. 1006–1017.

ICALP-2005-RadhakrishnanRS #fourier #on the #power of #problem #random

On the Power of Random Bases in Fourier Sampling: Hidden Subgroup Problem in the Heisenberg Group (JR, MR, PS), pp. 1399–1411.

ICALP-2005-Zimand #encryption #generative #pseudo

Simple Extractors via Constructions of Cryptographic Pseudo-random Generators (MZ), pp. 115–127.

CIKM-2005-Collins-ThompsonC #modelling #query #random #using

Query expansion using random walk models (KCT, JC), pp. 704–711.

ICML-2005-RothY #integer #linear #programming #random

Integer linear programming inference for conditional random fields (DR, WtY), pp. 736–743.

ICML-2005-WangWGSC #markov #modelling #random #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 #random #web

2D Conditional Random Fields for Web information extraction (JZ, ZN, JRW, BZ, WYM), pp. 1044–1051.

MLDM-2005-KotsiantisTP #estimation #random

Bagging Random Trees for Estimation of Tissue Softness (SBK, GET, PEP), pp. 674–681.

MLDM-2005-XiaWZL #data mining #mining #modelling #random

Mixture Random Effect Model Based Meta-analysis for Medical Data Mining (YX, SW, CZ, SL), pp. 630–640.

SEKE-2005-ChanCT #adaptation #random testing #reduction #testing

Adaptive Random Testing with Filtering: An Overhead Reduction Technique (KPC, TYC, DT), pp. 292–299.

SEKE-2005-ChenKZ #adaptation #effectiveness #on the #random testing #testing

On the Relationships between the Distribution of Failure-Causing Inputs and Effectiveness of Adaptive Random Testing (TYC, FCK, ZZ), pp. 306–311.

SIGIR-2005-MetzlerC #dependence #markov #random

A Markov random field model for term dependencies (DM, WBC), pp. 472–479.

POPL-2005-GulwaniN #analysis #interprocedural #precise #random #using

Precise interprocedural analysis using random interpretation (SG, GCN), pp. 324–337.

SAC-2005-WanMA #array #markov #random #similarity #using

Cleaning microarray expression data using Markov random fields based on profile similarity (RW, HM, KFA), pp. 206–207.

SAT-J-2004-Interian05 #algorithm #approximate #random

Approximation Algorithm for Random MAX- kSAT (YI), pp. 173–182.

SAT-J-2004-Sinopalnikov05 #random #satisfiability

Satisfiability Threshold of the Skewed Random k-SAT (DAS), pp. 263–275.

CAV-2005-NeculaG #algorithm #program analysis #random #verification

Randomized Algorithms for Program Analysis and Verification (GCN, SG), p. 1.

FATES-2005-Mayer #adaptation #locality #random testing #testing

Adaptive Random Testing by Bisection and Localization (JM), pp. 72–86.

LICS-2005-Atserias05a #random

Definability on a Random 3-CNF Formula (AA), pp. 458–466.

SAT-2005-HeuleM #bound #linear #programming #random #satisfiability #using

Observed Lower Bounds for Random 3-SAT Phase Transition Density Using Linear Programming (MH, HvM), pp. 122–134.

SAT-2005-Prestwich #random

Random Walk with Continuously Smoothed Variable Weights (SDP), pp. 203–215.

SAT-2005-SeitzAO #behaviour #random #satisfiability

Threshold Behaviour of WalkSAT and Focused Metropolis Search on Random 3-Satisfiability (SS, MA, PO), pp. 475–481.

ASE-2004-Andrews #case study #data type #random #testing

Case Study of Coverage-Checked Random Data Structure Testing (JHA), pp. 316–319.

DATE-v1-2004-CorsiMMBD #pseudo #sequence

Pseudo-Random Sequence Based Tuning System for Continuous-Time Filters (FC, CM, GM, AB, SD), pp. 94–101.

DATE-v1-2004-OngHCW #multi #random

Random Jitter Extraction Technique in a Multi-Gigahertz Signal (CKO, DH, KTC, LCW), pp. 286–291.

SIGMOD-2004-JermainePA #maintenance #online #random #scalability

Online Maintenance of Very Large Random Samples (CJ, AP, SA), pp. 299–310.

STOC-2004-AchlioptasN #graph #random

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 #random

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 #random

Sharp thresholds For monotone properties in random geometric graphs (AG, SR, BK), pp. 580–586.

STOC-2004-MankuNW #lookahead #network #power of #random

Know thy neighbor’s neighbor: the power of lookahead in randomized P2P networks (GSM, MN, UW), pp. 54–63.

ICALP-2004-ChrobakJST #online #scheduling

Online Scheduling of Equal-Length Jobs: Randomization and Restarts Help (MC, WJ, JS, TT), pp. 358–370.

ICALP-2004-CzumajS #approximate #clustering #random

Sublinear-Time Approximation for Clustering Via Random Sampling (AC, CS), pp. 396–407.

ICALP-2004-FeigeO #random #scalability

Easily Refutable Subformulas of Large Random 3CNF Formulas (UF, EO), pp. 519–530.

ICALP-2004-MerkleMS #effectiveness

Some Results on Effective Randomness (WM, NM, TAS), pp. 983–995.

ICALP-2004-NikoletseasRS #graph #independence #performance #random #scalability #set

The Existence and Efficient Construction of Large Independent Sets in General Random Intersection Graphs (SEN, CR, PGS), pp. 1029–1040.

ICALP-2004-Volzer #distributed #on the

On Randomization Versus Synchronization in Distributed Systems (HV), pp. 1214–1226.

SEFM-2004-BerghoferN #higher-order #random testing #testing

Random Testing in Isabelle/HOL (SB, TN), pp. 230–239.

AdaEurope-2004-ChanCT #random testing #testing

Good Random Testing (KPC, TYC, DT), pp. 200–212.

ECIR-2004-AbolhassaniF #approach #documentation #xml

Applying the Divergence from Randomness Approach for Content-Only Search in XML Documents (MA, NF), pp. 409–419.

ICML-2004-BlumLRR #learning #random #using

Semi-supervised learning using randomized mincuts (AB, JDL, MRR, RR).

ICML-2004-DietterichAB #random

Training conditional random fields via gradient tree boosting (TGD, AA, YB).

ICML-2004-LaffertyZL #clique #kernel #random #representation

Kernel conditional random fields: representation and clique selection (JDL, XZ, YL).

ICML-2004-SuttonRM #modelling #probability #random #sequence

Dynamic conditional random fields: factorized probabilistic models for labeling and segmenting sequence data (CAS, KR, AM).

ICML-2004-ToutanovaMN #dependence #learning #modelling #random #word

Learning random walk models for inducing word dependency distributions (KT, CDM, AYN).

ICPR-v1-2004-ClausiY #comparison #markov #random #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 #random #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 #random #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 #random #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 #random

A Markov Random Field Approach to Microarray Image Gridding (GA, MC), pp. 550–553.

ICPR-v3-2004-GoriMS #graph #random #using

Graph matching using Random Walks (MG, MM, LS), pp. 394–397.

ICPR-v3-2004-HuangMP #hybrid #markov #random #recognition #using

A Hybrid Face Recognition Method using Markov Random Fields (RH, DNM, VP), pp. 157–160.

ICPR-v3-2004-SprevakAW #assessment #classification

A Non-Random Data Sampling Method for Classification Model Assessment (DS, FA, HW), pp. 406–409.

KDD-2004-KolczCA #detection #robust

Improved robustness of signature-based near-replica detection via lexicon randomization (AK, AC, JA), pp. 605–610.

KDD-2004-TruongLB #dataset #learning #random #using

Learning a complex metabolomic dataset using random forests and support vector machines (YT, XL, CB), pp. 835–840.

KDD-2004-ZhuL #data mining #mining #privacy

Optimal randomization for privacy preserving data mining (MYZ, LL), pp. 761–766.

POPL-2004-GulwaniN #random #using

Global value numbering using random interpretation (SG, GCN), pp. 342–352.

SAC-2004-RaisanenWH #comparison #optimisation #random

A comparison of randomized and evolutionary approaches for optimizing base station site selection (LR, RMW, SH), pp. 1159–1165.

CSL-2004-Atserias #complexity #random #satisfiability

Notions of Average-Case Complexity for Random 3-SAT (AA), pp. 1–5.

IJCAR-2004-BartheCT #formal method #random

A Machine-Checked Formalization of the Generic Model and the Random Oracle Model (GB, JC, ST), pp. 385–399.

SAT-2004-Connamacher #constraints #problem #random

A Random Constraint Satisfaction Problem That Seems Hard for DPLL (HSC), pp. 3–11.

SAT-2004-Interian #algorithm #approximate #random

Approximation Algorithm for Random MAX-kSAT (YI), pp. 64–68.

DAC-2003-QianNS #network #random

Random walks in a supply network (HQ, SRN, SSS), pp. 93–98.

DATE-2003-PolianBR #markov #optimisation #pseudo #random

Evolutionary Optimization of Markov Sources for Pseudo Random Scan BIST (IP, BB, SMR), pp. 11184–11185.

ICDAR-2003-ZhengLD03a #documentation #identification #image #markov #random #using

Text Identification in Noisy Document Images Using Markov Random Field (YZ, HL, DSD), p. 599–?.

STOC-2003-AchlioptasP #random #satisfiability

The threshold for random k-SAT is 2k (ln 2 — O(k)) (DA, YP), pp. 223–231.

STOC-2003-BeierV #polynomial #random

Random knapsack in expected polynomial time (RB, BV), pp. 232–241.

STOC-2003-Ben-SassonSVW #testing

Randomness-efficient low degree tests and short PCPs via epsilon-biased sets (EBS, MS, SPV, AW), pp. 612–621.

STOC-2003-DietzfelbingerW #graph #random

Almost random graphs with simple hash functions (MD, PW), pp. 629–638.

STOC-2003-GalR #bound

Lower bounds on the amount of randomness in private computation (AG, AR), pp. 659–666.

STOC-2003-Hayes #graph

Randomly coloring graphs of girth at least five (TPH), pp. 269–278.

STOC-2003-KimV #generative #graph #random

Generating random regular graphs (JHK, VHV), pp. 213–222.

ICALP-2003-BodirskyGK #generative #graph #random

Generating Labeled Planar Graphs Uniformly at Random (MB, CG, MK), pp. 1095–1107.

ICALP-2003-Coja-OghlanMS #approximate #graph #random

MAX k-CUT and Approximating the Chromatic Number of Random Graphs (ACO, CM, VS), pp. 200–211.

ICALP-2003-IkedaKOY #finite #graph #random

Impact of Local Topological Information on Random Walks on Finite Graphs (SI, IK, NO, MY), pp. 1054–1067.

AdaEurope-2003-ChanCT #normalisation #random testing #strict #testing

Normalized Restricted Random Testing (KPC, TYC, DT), pp. 368–381.

ICML-2003-FernB03a #approach #clustering #random

Random Projection for High Dimensional Data Clustering: A Cluster Ensemble Approach (XZF, CEB), pp. 186–193.

KDD-2003-BayS #linear #mining

Mining distance-based outliers in near linear time with randomization and a simple pruning rule (SDB, MS), pp. 29–38.

KDD-2003-DuZ #data mining #mining #privacy #random #using

Using randomized response techniques for privacy-preserving data mining (WD, JZZ), pp. 505–510.

KDD-2003-FradkinM #machine learning #random

Experiments with random projections for machine learning (DF, DM), pp. 517–522.

MLDM-2003-ImiyaTOH #bound #detection #random #set

Detecting the Boundary Curve of Planar Random Point Set (AI, KT, HO, VH), pp. 413–424.

SIGIR-2003-LavrenkoP #modelling #music #random

Music modeling with random fields (VL, JP), pp. 389–390.

SIGIR-2003-PintoMWC #random #using

Table extraction using conditional random fields (DP, AM, XW, WBC), pp. 235–242.

POPL-2003-GulwaniN #random #using

Discovering affine equalities using random interpretation (SG, GCN), pp. 74–84.

SAC-2003-KatzerKS #array #markov #random

A Markov Random Field Model of Microarray Gridding (MK, FK, GS), pp. 72–77.

CADE-2003-GulwaniN #random

A Randomized Satisfability Procedure for Arithmetic and Uninterpreted Function Symbols (SG, GCN), pp. 167–181.

CSL-2003-HitchcockLT #complexity

The Arithmetical Complexity of Dimension and Randomness (JMH, JHL, ST), pp. 241–254.

ICLP-2003-ZhaoL #case study #programming #set #source code

Answer Set Programming Phase Transition: A Study on Randomly Generated Programs (YZ, FL), pp. 239–253.

LICS-2003-Lynch #convergence #graph #random #sequence

Convergence Law for Random Graphs with Specified Degree Sequence (JFL), p. 301–?.

SAT-2003-BraunsteinZ #bibliography #random #satisfiability

Survey and Belief Propagation on Random K-SAT (AB, RZ), pp. 519–528.

SAT-2003-DequenD #named #performance #random #satisfiability

kcnfs: An Efficient Solver for Random k-SAT Formulae (GD, OD), pp. 486–501.

SAT-2003-Parisi #approach #on the #probability #problem #random #satisfiability

On the Probabilistic Approach to the Random Satisfiability Problem (GP), pp. 203–213.

SAT-2003-SemerjianM #case study #physics #problem #random #satisfiability

A Study of Pure Random Walk on Random Satisfiability Problems with “Physical” Methods (GS, RM), pp. 120–134.

DAC-2002-BartleyGB #comparison #pseudo #random testing #testing #verification

A comparison of three verification techniques: directed testing, pseudo-random testing and property checking (MB, DG, TB), pp. 819–823.

STOC-2002-Albers #on the #online #random #scheduling

On randomized online scheduling (SA), pp. 134–143.

STOC-2002-AlonVKK #approximate #problem #random

Random sampling and approximation of MAX-CSP problems (NA, WFdlV, RK, MK), pp. 232–239.

STOC-2002-BertsimasV #random #source code

Solving convex programs by random walks (DB, SV), pp. 109–115.

STOC-2002-CapalboRVW

Randomness conductors and constant-degree lossless expanders (MRC, OR, SPV, AW), pp. 659–668.

STOC-2002-Gacs #random #scheduling

Clairvoyant scheduling of random walks (PG), pp. 99–108.

STOC-2002-GoldbergKP #complexity #random

The complexity of choosing an H-colouring (nearly) uniformly at random (LAG, SK, MP), pp. 53–62.

STOC-2002-HastadV #on the #random

On the advantage over a random assignment (JH, SV), pp. 43–52.

STOC-2002-KargerL #graph #random

Random sampling in residual graphs (DRK, MSL), pp. 63–66.

STOC-2002-Molloy02a #constraints #modelling #problem #random

Models and thresholds for random constraint satisfaction problems (MM), pp. 209–217.

STOC-2002-Umans #generative #pseudo

Pseudo-random generators for all hardnesses (CU), pp. 627–634.

ICALP-2002-AdlerRSSV #graph #random

Randomized Pursuit-Evasion in Graphs (MA, HR, NS, CS, BV), pp. 901–912.

ICALP-2002-Brattka #random #recursion #set

Random Numbers and an Incomplete Immune Recursive Set (VB), pp. 950–961.

ICALP-2002-DuchonFLS #random

Random Sampling from Boltzmann Principles (PD, PF, GL, GS), pp. 501–513.

ICALP-2002-IshaiK

Perfect Constant-Round Secure Computation via Perfect Randomizing Polynomials (YI, EK), pp. 244–256.

ICML-2002-ChisholmT #learning #random

Learning Decision Rules by Randomized Iterative Local Search (MC, PT), pp. 75–82.

ICML-2002-StracuzziU #random

Randomized Variable Elimination (DJS, PEU), pp. 594–601.

ICPR-v1-2002-Meas-YedidTO #analysis #clustering #image #markov #random #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 #random #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 #random #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 #random #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 #random #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 #random #using

Binarization of Low Quality Text Using a Markov Random Field Model (CW, DSD), pp. 160–163.

ICPR-v4-2002-ChenOB #markov #random #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 #random #synthesis #using

Face Detection and Synthesis Using Markov Random Field Models (SCD, AKJ, XL), pp. 201–204.

KDD-2002-KolczSK #classification #performance #random

Efficient handling of high-dimensional feature spaces by randomized classifier ensembles (AK, XS, JKK), pp. 307–313.

LICS-2002-Atserias #random #satisfiability

Unsatisfiable Random Formulas Are Hard to Certify (AA), pp. 325–334.

SAT-2002-CreignouD #problem #random #satisfiability

Random generalized satisfiability problems (NC, HD), p. 2.

SAT-2002-DuboisD #random #satisfiability

Renormalization as a function of clause lengths for solving random k-SAT formulae (OD, GD), p. 15.

SAT-2002-FormanS #named #parallel #random #satisfiability

NAGSAT: A randomized, complete, parallel solver for 3-SAT (SF, AMS), p. 45.

SAT-2002-Kullmann #adaptation #branch #database #encryption #normalisation #random #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 #random #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.

DAC-2001-Pomeranz #random #testing

Random Limited-Scan to Improve Random Pattern Testing of Scan Circuits (IP), pp. 145–150.

ICDAR-2001-BagdanovW #classification #documentation #fine-grained #first-order #graph #random #using

Fine-Grained Document Genre Classification Using First Order Random Graphs (ADB, MW), pp. 79–85.

ICDAR-2001-JustinoBS #random #using #verification

Off-line Signature Verification Using HMM for Random, Simple and Skilled Forgeries (EJRJ, FB, RS), pp. 1031–1034.

PODS-2001-Achlioptas #random

Database-friendly random projections (DA).

STOC-2001-KlivansS #multi #performance #testing

Randomness efficient identity testing of multivariate polynomials (AK, DAS), pp. 216–223.

CIAA-2001-Zijl #generative #random

Random Number Generation with +-NFAs (LvZ), pp. 263–273.

DLT-2001-HromkovicS #automaton #on the #power of #random

On the Power of Randomized Pushdown Automata (JH, GS), pp. 262–271.

ICALP-2001-ChakrabartiK #bound #complexity #graph #random

Improved Lower Bounds on the Randomized Complexity of Graph Properties (AC, SK), pp. 285–296.

ICALP-2001-Dodis #random

New Imperfect Random Source with Applications to Coin-Flipping (YD), pp. 297–309.

ICALP-2001-FriedmanG #random #satisfiability

Recognizing More Unsatisfiable Random 3-SAT Instances Efficiently (JF, AG), pp. 310–321.

ICML-2001-LaffertyMP #modelling #probability #random #sequence

Conditional Random Fields: Probabilistic Models for Segmenting and Labeling Sequence Data (JDL, AM, FCNP), pp. 282–289.

KDD-2001-BinghamM #image #random #reduction

Random projection in dimensionality reduction: applications to image and text data (EB, HM), pp. 245–250.

KDD-2001-HarelK #clustering #random #using

Clustering spatial data using random walks (DH, YK), pp. 281–286.

SAC-2001-DowellB #graph #mobile #monte carlo #network #random #simulation #validation

Connectivity of random graphs and mobile networks: validation of Monte Carlo simulation results (LJD, MLB), pp. 77–81.

CAV-2001-KwiatkowskaNS #automation #distributed #protocol #random #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 #random

A New System and Methodology for Generating Random Modal Formulae (PFPS, RS), pp. 464–468.

SAT-2001-CoccoM #analysis #backtracking #physics #random #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 #random #web

Approximating Aggregate Queries about Web Pages via Random Walks (ZBY, ACB, SC, JF, DW), pp. 535–544.

STOC-2000-Achlioptas #bound #random #satisfiability

Setting 2 variables at a time yields a new lower bound for random 3-SAT (extended abstract) (DA), pp. 28–37.

STOC-2000-AielloCL #graph #random

A random graph model for massive graphs (WA, FRKC, LL), pp. 171–180.

STOC-2000-CarrV #random

Randomized metarounding (extended abstract) (RDC, SV), pp. 58–62.

STOC-2000-FaginKKRRRST #random

Random walks with “back buttons” (extended abstract) (RF, ARK, JMK, PR, SR, RR, MS, AT), pp. 484–493.

STOC-2000-ImpagliazzoSW #generative #pseudo

Extractors and pseudo-random generators with optimal seed length (RI, RS, AW), pp. 1–10.

STOC-2000-NaorRR #pseudo

Pseudo-random functions and factoring (extended abstract) (MN, OR, AR), pp. 11–20.

STOC-2000-Seiden #algorithm #game studies #online #random

A guessing game and randomized online algorithms (SSS), pp. 592–601.

CIAA-2000-DvorskyS #random #word

Word Random Access Compression (JD, VS), pp. 331–332.

ICALP-2000-Merkle #power of #query

The Global Power of Additional Queries to p-Random Oracles (WM), pp. 914–925.

ICFP-2000-ClaessenH #haskell #lightweight #named #quickcheck #random testing #source code #testing

QuickCheck: a lightweight tool for random testing of Haskell programs (KC, JH), pp. 268–279.

ICPR-v1-2000-KamijoMIS #markov #random #robust

Occlusion Robust Tracking Utilizing Spatio-Temporal Markov Random Field Model (SK, YM, KI, MS), pp. 1140–1144.

ICPR-v1-2000-Pilu #invariant #optimisation #random

Optimizing Random Patterns for Invariants-based Matching (MP), pp. 1716–1719.

ICPR-v2-2000-Baram #pattern matching #pattern recognition #random #recognition

Random Embedding Machines for Low-Complexity Pattern Recognition (YB), pp. 2748–2754.

ICPR-v2-2000-KimK #estimation #graph #parametricity #random #recognition

Minimum Entropy Estimation of Hierarchical Random Graph Parameters for Character Recognition (HYK, JHK), pp. 6050–6053.

ICPR-v2-2000-WangZCF #approach #markov #random #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 #random #recognition #speech

A Markov Random Field Model for Automatic Speech Recognition (GG, MS, GC), pp. 3258–3261.

ICPR-v3-2000-OukilS #algorithm #energy #markov #random

Markovian Random Fields Energy Minimization Algorithms (AO, AS), pp. 3522–3525.

ICPR-v3-2000-PagetL #analysis #markov #parametricity #random #testing

Nonparametric Markov Random Field Model Analysis of the MeasTex Test Suite (RP, IDL), pp. 3939–3942.

ICPR-v3-2000-SmolkaW #image #random

Edge Preserving Image Smoothing Based on Self Avoiding Random Walk (BS, KWW), pp. 3668–3671.

ICPR-v3-2000-SziranyiT #random

Random Paintbrush Transformation (TS, ZT), pp. 3155–3158.

ICPR-v4-2000-HatteryCLG #embedded #migration

Optical Signatures of Small, Deeply Embedded, Tumor-Like Inclusions in Tissue-Like Turbid Media Based on a Random-Walk Theory of Photon Migration (DH, VC, MHL, AG), pp. 4348–4351.

SAC-2000-MarchioriS #algorithm #constraints #problem #random #search-based

A Genetic Local Search Algorithm for Random Binary Constraint Satisfaction Problems (EM, AGS), pp. 458–462.

LCTES-2000-BelloM #network #scheduling

Randomization-Based Approaches for Dynamic Priority Scheduling of Aperiodic Messages on a CAN Network (LLB, OM), pp. 1–18.

SIGMOD-1999-ChaudhuriMN #on the #random

On Random Sampling over Joins (SC, RM, VRN), pp. 263–274.

SIGMOD-1999-MankuRL #dataset #online #order #performance #random #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 #random #simulation

VOODB: A Generic Discrete-Event Random Simulation Model To Evaluate the Performances of OODBs (JD, MS), pp. 254–265.

STOC-1999-RazR #bound #on the

On Recycling the Randomness of States in Space Bounded Computation (RR, OR), pp. 159–168.

STOC-1999-RazRV #fault

Extracting all the Randomness and Reducing the Error in Trevisan’s Extractors (RR, OR, SPV), pp. 149–158.

STOC-1999-Schaeffer #random #scalability

Random Sampling of Large Planar Maps and Convex Polyhedra (GS), pp. 760–769.

STOC-1999-Trevisan #generative #pseudo #using

Construction of Extractors Using Pseudo-Random Generators (Extended Abstract) (LT), pp. 141–148.

ICALP-1999-AndreevBCR #bound #branch #pseudo #set #source code

Small Pseudo-Random Sets Yield Hard Functions: New Tight Explict Lower Bounds for Branching Programs (AEA, JLB, AEFC, JDPR), pp. 179–189.

ICALP-1999-SantisCP

Non-Interactive Zero-Knowledge: A Low-Randomness Characterization of NP (ADS, GDC, GP), pp. 271–280.

HCI-EI-1999-KetolaHTTV #random

Ergonomics in VDU Work: a randomized controlled trial (RK, MH, RT, EPT, EVJ), pp. 19–22.

ICEIS-1999-CordeiroD #estimation #random

Contour Estimation on Piecewise Homogeneous Random Fields (JAMC, JMBD), pp. 183–194.

ICML-1999-VovkGS #algorithm

Machine-Learning Applications of Algorithmic Randomness (VV, AG, CS), pp. 444–453.

SIGIR-1999-CormackLP #precise #random

Estimating Precision by Random Sampling (poster abstract) (GVC, OL, CRP), pp. 273–274.

SAC-1999-BakC #protocol #random

Randomized Distance-Vector Routing Protocol (SB, JAC), pp. 78–84.

SIGMOD-1998-ChaudhuriMN #how #question #random

Random Sampling for Histogram Construction: How much is enough? (SC, RM, VRN), pp. 436–447.

FoSSaCS-1998-PorrotDDV #random #sequence #transducer

Deterministic Rational Transducers and Random Sequences (SP, MD, BD, NKV), pp. 258–272.

STOC-1998-Ajtai #np-hard #problem #random #reduction

The Shortest Vector Problem in L2 is NP-hard for Randomized Reductions (Extended Abstract) (MA), pp. 10–19.

STOC-1998-BeameKPS #complexity #on the #proving #random #satisfiability

On the Complexity of Unsatisfiability Proofs for Random k-CNF Formulas (PB, RMK, TP, MES), pp. 561–571.

STOC-1998-CanettiGH #random

The Random Oracle Methodology, Revisited (Preliminary Version) (RC, OG, SH), pp. 209–218.

STOC-1998-ColeMHMRSSV #multi #network #protocol #random

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 #random

Randomized Complexity Lower Bounds (DG), pp. 219–223.

STOC-1998-PeinadoL #embedded #generative #graph #random

Random Generation of Embedded Graphs and an Extension to Dobrushin Uniqueness (Extended Abstract) (MP, TL), pp. 176–185.

ICALP-1998-HertlingW

Randomness Spaces (PH, KW), pp. 796–807.

ICML-1998-PiaterCZA #performance #random

A Randomized ANOVA Procedure for Comparing Performance Curves (JHP, PRC, XZ, MA), pp. 430–438.

ICPR-1998-Gimelfarb98a #image #modelling #on the #random

On the maximum likelihood potential estimates for Gibbs random field image models (GLG), pp. 1598–1600.

ICPR-1998-GoktepeAYY #image #markov #modelling #random #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 #random

Direct triangle extraction by a randomized Hough technique (ZH, MT, HTT), pp. 717–719.

ICPR-1998-PagetL #markov #multi #parametricity #random #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 #random #using

Texture classification using wavelet decomposition with Markov random field models (LW, JL, SZL), pp. 1613–1615.

KR-1998-Jaeger #infinity #network #random #reasoning #relational

Reasoning About Infinite Random Structures with Relational Bayesian Networks (MJ), pp. 570–581.

SAC-1998-GaberT #distributed #network #random

Randomized load distribution of arbitrary trees in distributed networks (JG, BT), pp. 564–568.

SAC-1998-Li98a #algorithm #distributed #online #random

Deterministic and randomized algorithms for distributed on-line task assignment and load balancing without load status information (KL), pp. 613–622.

ISSTA-1998-Ntafos #on the #random #testing

On Random and Partition Testing (SCN), pp. 42–48.

DAC-1997-PantDC #energy #logic #network #optimisation #power management #random

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 #random

STARBIST: Scan Autocorrelated Random Pattern Generation (KHT, SH, JR, MMS), pp. 472–477.

DAC-1997-WalterLDLMKW #approach #multi #random #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

Random benchmark circuits with controlled attributes (KI, KH, HK, SS), pp. 90–97.

ICDAR-1997-GuoDR #detection #random

Local correspondence for detecting random forgeries (JKG, DSD, AR), pp. 319–323.

STOC-1997-Aspnes #bound #distributed #random

Lower Bounds for Distributed Coin-Flipping and Randomized Consensus (JA), pp. 559–568.

STOC-1997-AuerLS #approximate #learning #pseudo #set

Approximating Hyper-Rectangles: Learning and Pseudo-Random Sets (PA, PML, AS), pp. 314–323.

STOC-1997-BroderFU #approach #graph #random

Static and Dynamic Path Selection on Expander Graphs: A Random Walk Approach (Preliminary Version) (AZB, AMF, EU), pp. 531–539.

STOC-1997-ChenK

Reducing Randomness via Irrational Numbers (ZZC, MYK), pp. 200–209.

STOC-1997-ColeH #pattern matching #random #set

Tree Pattern Matching and Subset Matching in Randomized O(n log3m) Time (RC, RH), pp. 66–75.

STOC-1997-GrigorievK #bound #random

Randomized Ω(n²) Lower Bound for Knapsack (DG, MK), pp. 76–85.

STOC-1997-Karger #graph #random #using

Using Random Sampling to Find Maximum Flows in Uncapacitated Undirected Graphs (DRK), pp. 240–249.

STOC-1997-KargerLLPLL #consistency #distributed #protocol #random #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.

STOC-1997-NaorR #on the #permutation #pseudo

On the Construction of Pseudo-Random Permutations: Luby-Rackoff Revisited (Extended Abstract) (MN, OR), pp. 189–199.

ICALP-1997-Ablayev #branch #nondeterminism #order #source code

Randomization and Nondeterminism Are Comparable for Ordered Read-Once Branching Programs (FMA), pp. 195–202.

ICALP-1997-AndreevCR #trade-off #worst-case

Worst-Case Hardness Suffices for Derandomization: A New Method for Hardness-Randomness Trade-Offs (AEA, AEFC, JDPR), pp. 177–187.

ICALP-1997-SantisCP

Randomness-Efficient Non-Interactive Zero-Knowledge (Extended Abstract) (ADS, GDC, GP), pp. 716–726.

CHI-1997-HornofK #modelling #random

Cognitive Modeling Reveals Menu Search is Both Random and Systematic (AJH, DEK), pp. 107–114.

SAC-1997-KhuriSC #approach #finite #string

Randomness of finite strings: a reconstructive approach (SK, FS, TC), pp. 527–531.

DAC-1996-HuttonGRC #generative #random

Characterization and Parameterized Random Generation of Digital Circuits (MDH, JPG, JR, DGC), pp. 94–99.

SIGMOD-1996-HillyerS #online #random #scheduling

Random I/O Scheduling in Online Tertiary Storage Systems (BH, AS), pp. 195–204.

STOC-1996-GrigorievKHS #algebra #bound #random

A Lower Bound for Randomized Algebraic Decision Trees (DG, MK, FMadH, RS), pp. 612–619.

STOC-1996-Ta-Shma #on the #random

On Extracting Randomness From Weak Random Sources (Extended Abstract) (ATS), pp. 276–285.

STOC-1996-Wilson #generative #random

Generating Random Spanning Trees More Quickly than the Cover Time (DBW), pp. 296–303.

STOC-1996-Zuckerman

Randomness-Optimal Sampling, Extractors, and Constructive Leader Election (DZ), pp. 286–295.

ICALP-1996-AblayevK #branch #on the #power of #random #source code

On the Power of Randomized Branching Programs (FMA, MK), pp. 348–356.

ICALP-1996-FarachM #random

Optimal Logarithmic Time Randomized Suffix Tree Construction (MF, SM), pp. 550–561.

ICALP-1996-FlajoletGP #polynomial #random

Random Polynomials and Polynomial Factorization (PF, XG, DP), pp. 232–243.

ICPR-1996-CooperHY #markov #random

A Markov random field model of subjective contour perception (PRC, SH, PY), pp. 100–104.

ICPR-1996-DelagnesB #graph #image #markov #random

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 #random

Randomized generalized Hough transform for 2-D gray scale object detection (PFF, WSL, IK), pp. 511–515.

ICPR-1996-GonzalezC #classification #functional #markov #random

The Markov random fields in functional neighbors as a texture model: applications in texture classification (AMG, DC), pp. 815–819.

ICPR-1996-KalviainenBPK #classification #random

Mixed pixel classification with the randomized Hough transform (HK, PB, MP, JK), pp. 576–580.

ICPR-1996-SmitsD #adaptation #approach #image #markov #random #segmentation #using

Information fusion in a Markov random field-based image segmentation approach using adaptive neighbourhoods (PCS, SGD), pp. 570–575.

SEKE-1996-JamoussiB #generative #monte carlo #performance #random testing #testing

Efficient Monte Carlo Method for Generating Random Test Data from Irregular Test Regions (AJ, FBB), pp. 17–24.

LICS-1996-McColm #graph #random

Zero-One Laws for Gilbert Random Graphs (GLM), pp. 360–369.

ICDAR-v1-1995-Ho #random

Random decision forests (TKH), pp. 278–282.

ICDAR-v1-1995-ParkL #markov #random #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 #random

A Markovian random field approach to information retrieval (DB, JGM), pp. 997–1002.

STOC-1995-AdlerCMR #parallel #random

Parallel randomized load balancing (Preliminary Version) (MA, SC, MM, LER), pp. 238–247.

STOC-1995-CanettiI #bound #power of #random #scheduling

Bounding the power of preemption in randomized scheduling (RC, SI), pp. 606–615.

STOC-1995-Feige #graph #random

Randomized graph products, chromatic numbers, and Lovasz theta-function (UF), pp. 635–640.

STOC-1995-FeigeK #proving #random

Impossibility results for recycling random bits in two-prover proof systems (UF, JK), pp. 457–468.

STOC-1995-FiatK #locality #multi #random

Randomized and multipointer paging with locality of reference (AF, ARK), pp. 626–634.

STOC-1995-HenzingerK #algorithm #graph #random

Randomized dynamic graph algorithms with polylogarithmic time per operation (MRH, VK), pp. 519–527.

STOC-1995-Karger #approximate #network #polynomial #problem #random #reliability

A randomized fully polynomial time approximation scheme for the all terminal network reliability problem (DRK), pp. 11–17.

STOC-1995-KavrakiLMR #query #random

Randomized query processing in robot path planning (Extended Abstract) (LEK, JCL, RM, PR), pp. 353–362.

STOC-1995-KremerNR #communication #complexity #on the #random

On randomized one-round communication complexity (IK, NN, DR), pp. 596–605.

ICALP-1995-Ben-AmramG #algebra #bound #random

Lower Bounds on Algebraic Random Access Machines (Extended Abstract) (AMBA, ZG), pp. 360–371.

ICALP-1995-BlundoSPV #on the #random

On the Number of Random Bits in Totally Private Computation (CB, ADS, GP, UV), pp. 171–182.

ICALP-1995-FreivaldsK #bound #random

Lower Time Bounds for Randomized Computation (RF, MK), pp. 183–195.

FPCA-1995-Okasaki #functional

Purely Functional Random-Access Lists (CO), pp. 86–95.

CIKM-1995-ManolopoulosNPV #generative #on the #random

On the Generation of Aggregated Random Spatial Regions (YM, EN, GP, MV), pp. 318–325.

LICS-1995-LynchT #graph #logic #random

The Infinitary Logic of Sparse Random Graphs (JFL, JT), pp. 46–53.

DAC-1994-IwamaH #generative #logic #random

Random Generation of Test Instances for Logic Optimizers (KI, KH), pp. 430–434.

EDAC-1994-Su #bound #random testing #testing

Random Testing of Interconnects in A Boundary Scan Environment (CS), pp. 226–231.

VLDB-1994-Galindo-LegariaPK #performance #question #random #why

Fast, Randomized Join-Order Selection — Why Use Transformations? (CAGL, AP, MLK), pp. 85–95.

STOC-1994-AlonK #graph #random

A spectral technique for coloring random 3-colorable graphs (preliminary version) (NA, NK), pp. 346–355.

STOC-1994-BergDS #incremental #lazy evaluation #on the #random

On lazy randomized incremental construction (MdB, KD, OS), pp. 105–114.

STOC-1994-BrewerCL #random #scalability

Scalable expanders: exploiting hierarchical random wiring (EAB, FTC, TL), pp. 144–152.

STOC-1994-GoldreichW #product line #random #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

Random sampling in cut, flow, and network design problems (DRK), pp. 648–657.

STOC-1994-KleinT #algorithm #linear #random

A randomized linear-time algorithm for finding minimum spanning trees (PNK, RET), pp. 9–15.

STOC-1994-KollerMS #algorithm #game studies #performance #random

Fast algorithms for finding randomized strategies in game trees (DK, NM, BvS), pp. 750–759.

STOC-1994-Miltersen #bound #problem #random

Lower bounds for union-split-find related problems on random access machines (PBM), pp. 625–634.

STOC-1994-Odlyzko #random

Search for the maximum of a random walk (AMO), pp. 336–345.

ICALP-1994-BlundoSV #distributed #protocol

Randomness in Distributed Protocols (CB, ADS, UV), pp. 568–579.

ICALP-1994-Feige #algorithm #graph #performance #random

A Fast Randomized LOGSPACE Algorithm for Graph Connectivity (UF), pp. 499–507.

ICALP-1994-FreivaldsK #bound #random

Lower Space Bounds for Randomized Computation (RF, MK), pp. 580–592.

ICALP-1994-NikolestseasPSY #graph #multi #network #random #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 #random

A Randomized Implementation of Multiple Functional Arrays (TRC), pp. 173–184.

ICML-1994-AhaLLM #learning #recursion #set

Learning Recursive Relations with Randomly Selected Small Training Sets (DWA, SL, CXL, SM), pp. 12–18.

ICML-1994-Skalak #algorithm #feature model #prototype #random

Prototype and Feature Selection by Sampling and Random Mutation Hill Climbing Algorithms (DBS), pp. 293–301.

CAV-1994-MihailP #on the #protocol #random #testing

On the Random Walk Method for Protocol Testing (MM, CHP), pp. 132–141.

ICDAR-1993-BrzakovicV #authentication #documentation #random #recognition

Document recognition/authentication based on medium-embedded random patterns (DB, NV), pp. 95–98.

STOC-1993-BarnesF #graph #random

Short random walks on graphs (GB, UF), pp. 728–737.

STOC-1993-ChariRS #problem

Randomness-optimal unique element isolation, with applications to perfect matching and related problems (SC, PR, AS), pp. 458–467.

STOC-1993-FreundKRRSS #automaton #finite #learning #performance #random

Efficient learning of typical finite automata from random walks (YF, MJK, DR, RR, RES, LS), pp. 315–324.

STOC-1993-KushilevitzMRZ #bound #random

Lower bounds for randomized mutual exclusion (EK, YM, MOR, DZ), pp. 154–163.

DLT-1993-Calude #algorithm

Borel Normality and Algorithmic Randomness (CC), pp. 113–129.

ICALP-1993-KarpinskiV #on the #random

On Randomized Versus Deterministic Computation (MK, RV), pp. 227–240.

ICML-1993-SuttonW #learning #online #random

Online Learning with Random Representations (RSS, SDW), pp. 314–321.

CSL-1993-GradelM #problem #random

Approximable Minimization Problems and Optimal Solutions on Random Inputs (EG, AM), pp. 139–149.

DAC-1992-ChakrabortyAB #fault #generative #logic #modelling #random #testing

Delay Fault Models and Test Generation for Random Logic Sequential Circuits (TJC, VDA, MLB), pp. 165–172.

DAC-1992-MajumdarS #fault #on the #random testing #testing

On the Distribution of Fault Coverage and Test length in Random Testing of Combinational Circuits (AM, SS), pp. 341–346.

VLDB-1992-Antoshenkov #pseudo #random

Random Sampling from Pseudo-Ranked B+ Trees (GA), pp. 375–382.

STOC-1992-AzarBKLP #random

Biased Random Walks (YA, AZB, ARK, NL, SP), pp. 1–9.

STOC-1992-BeameL #communication #complexity #nondeterminism #random

Randomized versus Nondeterministic Communication Complexity (PB, JL), pp. 188–199.

STOC-1992-BrightwellOW #random

Target Shooting with Programmed Random Variables (GB, TJO, PW), pp. 691–698.

STOC-1992-FeigeL #matrix #on the #random

On the Hardness of Computing the Permanent of Random Matrices (Extended Abstract) (UF, CL), pp. 643–654.

STOC-1992-Kalai #algorithm #random

A Subexponential Randomized Simplex Algorithm (Extended Abstract) (GK), pp. 475–482.

STOC-1992-KedemPRR #parallel #performance #program transformation

Efficient Program Transformations for Resilient Parallel Computation via Randomization (Preliminary Version) (ZMK, KVP, MOR, AR), pp. 306–317.

STOC-1992-KleinS #approximate #parallel #random

A Parallel Randomized Approximation Scheme for Shortest Paths (PNK, SS), pp. 750–758.

ICALP-1992-Mansour #approximate #random

Randomized Interpolation and Approximation of Sparse Polynomials (YM), pp. 261–272.

LICS-1992-GroveHK #random

Random Worlds and Maximum Entropy (AJG, JYH, DK), pp. 22–33.

DAC-1991-PaterasR #correlation #generative #multi #random #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 #random #transitive

Local Expansion of Vertex-Transitive Graphs and Random Generation in Finite Groups (LB), pp. 164–174.

STOC-1991-DengM #game studies #infinity #online #problem

Infinite Games, Randomization, Computability, and Applications to Online Problems (Preliminary Version) (XD, SM), pp. 289–298.

STOC-1991-KarloffRR #algorithm #bound #random

Lower Bounds for Randomized k-Server and Motion Planning Algorithms (HJK, YR, YR), pp. 278–288.

ICALP-1991-CasasDM #random

Static on Random Trees (RC, JD, CM), pp. 186–203.

ICALP-1991-Hagerup #generative #parallel #performance #permutation #random

Fast Parallel Generation of Random Permutations (TH), pp. 405–416.

PLILP-1991-KeslerPR #approach #heuristic #random

A Randomized Heuristic Approach to Register Allocation (CWK, WJP, TR), pp. 195–206.

TAV-1991-Podgurski #algorithm #reliability

Reliability, Sampling, and Algorithmic Randomness (AP), pp. 11–20.

SIGMOD-1990-IoannidisK #algorithm #optimisation #query #random #scalability

Randomized Algorithms for Optimizing Large Join Queries (YEI, YCK), pp. 312–321.

SIGMOD-1990-OlkenRX #random

Random Sampling from Hash Files (FO, DR, PX), pp. 375–386.

STOC-1990-Ben-DavidBKTW #algorithm #on the #online #power of

On the Power of Randomization in Online Algorithms (Extended Abstract) (SBD, AB, RMK, GT, AW), pp. 379–386.

STOC-1990-CoppersmithDRS #algorithm #graph #online #random

Random Walks on Weighted Graphs, and Applications to On-line Algorithms (Preliminary Version) (DC, PD, PR, MS), pp. 369–378.

STOC-1990-GoddardKS #algorithm #random #sorting

Optimal Randomized Algorithms for Local Sorting and Set-Maxima (WG, VK, LJS), pp. 45–53.

STOC-1990-Hastad #generative #pseudo

Pseudo-Random Generators under Uniform Assumptions (JH), pp. 395–404.

STOC-1990-SchmidtS #analysis

The Analysis of Closed Hashing under Limited Randomness (Extended Abstract) (JPS, AS), pp. 224–234.

ICALP-1990-BookLT #pseudo #query #random

Additional Queries to Random and Pseudorandom Oracles (RVB, JHL, ST), pp. 283–293.

ICALP-1990-GuibasKS #diagrams #incremental #random

Randomized Incremental Construction of Delaunay and Voronoi Diagrams (LJG, DEK, MS), pp. 414–431.

CSL-1990-Habart

Randomness and Turing Reducibility Restraints (KH), pp. 234–247.

VLDB-1989-OlkenR #random

Random Sampling from B+ Trees (FO, DR), pp. 269–277.

STOC-1989-DyerFK #algorithm #approximate #polynomial #random

A Random Polynomial Time Algorithm for Approximating the Volume of Convex Bodies (MED, AMF, RK), pp. 375–381.

STOC-1989-FriedmanKS #graph #on the #random

On the Second Eigenvalue in Random Regular Graphs (JF, JK, ES), pp. 587–598.

STOC-1989-ImpagliazzoLL #generative #pseudo

Pseudo-random Generation from one-way functions (Extended Abstracts) (RI, LAL, ML), pp. 12–24.

STOC-1989-KurtzMR #morphism #random

The Isomorphism Conjecture Fails Relative to a Random Oracle (Extended Abstract) (SAK, SRM, JSR), pp. 157–166.

STOC-1989-ReifS #geometry #named #random

Polling: A New Randomized Sampling Technique for Computational Geometry (JHR, SS), pp. 394–404.

ICALP-1989-FeldmanINNRS #generative #modelling #on the #random

On Dice and Coins: Models of Computation for Random Generation (DF, RI, MN, NN, SR, AS), pp. 319–340.

ICALP-1989-RaghavanS #algorithm #memory management #online

Memory Versus Randomization in On-line Algorithms (Extended Abstract) (PR, MS), pp. 687–703.

NACLP-1989-Lin #backtracking #parallel #performance #random

Expected Performance of the Randomized Parallel Backtracking Method (ZL), pp. 677–696.

DAC-1988-Cirit #analysis #random #testing

Switch Level Random Pattern Testability Analysis (MAC), pp. 587–590.

STOC-1988-Broder #approximate #how #random

Errata to “How hard is to marry at random? (On the approximation of the permanent)” (AZB), p. 551.

STOC-1988-KarloffR #algorithm #pseudo #random

Randomized Algorithms and Pseudorandom Numbers (HJK, PR), pp. 310–321.

STOC-1988-KarpZ #bound #parallel #random

A Randomized Parallel Branch-and-Bound Procedure (RMK, YZ), pp. 290–300.

STOC-1988-KrizancPU #trade-off

A Time-Randomness Tradeoff for Oblivious Routing (Extended Abstract) (DK, DP, EU), pp. 93–102.

STOC-1988-VenkatesanL #graph #problem #random

Random Instances of a Graph Coloring Problem Are Hard (RV, LAL), pp. 217–222.

ICALP-1988-FlajoletGT #probability #random

Random Allocations and Probabilistic Languages (PF, DG, LT), pp. 239–253.

DAC-1987-MazumderPF #algorithm #design #parallel #random #testing

Design and Algorithms for Parallel Testing of Random Access and Content Addressable Memories (PM, JHP, WKF), pp. 689–694.

DAC-1987-Wunderlich #on the #random testing #testing

On Computing Optimized Input Probabilities for Random Tests (HJW), pp. 392–398.

STOC-1987-AdlemanH #polynomial #random

Recognizing Primes in Random Polynomial Time (LMA, MDAH), pp. 462–469.

STOC-1987-AggarwalA #algorithm #random

A Random NC Algorithm for Depth First Search (AA, RJA), pp. 325–334.

STOC-1987-Bach #algorithm #analysis #random

Realistic Analysis of Some Randomized Algorithms (EB), pp. 453–461.

STOC-1987-Furer #communication #complexity #power of

The Power of Randomness for Communication Complexity (Preliminary Version) (MF), pp. 178–181.

STOC-1987-LichtensteinLS #process #random

Imperfect Random Sources and Discrete Controlled Processes (DL, NL, MES), pp. 169–177.

STOC-1987-ShelahS #graph #random

Threshold Spectra for Random Graphs (SS, JS), pp. 421–424.

STOC-1987-Vazirani #performance #using

Efficiency Considerations in Using Semi-random Sources (Extended Abstract) (UVV), pp. 160–168.

SIGIR-1987-Losee #database #documentation #modelling #random #retrieval

The Effect of Database Size on Document Retrieval: Random and Best-First Retrieval Models (RML), pp. 164–169.

VLDB-1986-OlkenR #database #random #relational

Simple Random Sampling from Relational Databases (FO, DR), pp. 160–169.

STOC-1986-Broder #approximate #how #random

How hard is to marry at random? (On the approximation of the permanent) (AZB), pp. 50–58.

STOC-1986-Cai #polynomial #probability #random

With Probability One, A Random Oracle Separates PSPACE from the Polynomial-Time Hierarchy (JyC), pp. 21–29.

STOC-1986-Clarkson #geometry #random

Further Applications of Random Sampling to Computational Geometry (KLC), pp. 414–423.

STOC-1986-LubyR #composition #encryption #generative #permutation #pseudo

Pseudo-random Permutation Generators and Cryptographic Composition (ML, CR), pp. 356–363.

DAC-1985-Tendolkar #analysis #fault #random

Analysis of timing failures due to random AC defects in VLSI modules (NNT), pp. 709–714.

DAC-1985-TygarE #comparison #performance #using

Efficient netlist comparison using hierarchy and randomization (JDT, RE), pp. 702–708.

STOC-1985-Babai

Trading Group Theory for Randomness (LB), pp. 421–429.

STOC-1985-BollobasFF #algorithm #graph #random

An Algorithm for Finding Hamilton Cycles in a Random Graph (BB, TIF, AMF), pp. 430–439.

STOC-1985-Bracha #protocol #random

An O(lg n) Expected Rounds Randomized Byzantine Generals Protocol (GB), pp. 316–326.

STOC-1985-KarpUW #random

Constructing a Perfect Matching is in Random NC (RMK, EU, AW), pp. 22–32.

STOC-1985-Vazirani #communication #complexity #generative #sequence #towards

Towards a Strong Communication Complexity Theory or Generating Quasi-Random Sequences from Two Communicating Slightly-random Sources (Extended Abstract) (UVV), pp. 366–378.

ICALP-1985-Jerrum #combinator #generative #random

Random Generation of Combinatorial Structures from a Uniform Distribution (Extended Abstract) (MJ), pp. 290–299.

DAC-1984-Lieberherr84a #random testing #testing

Parameterized random testing (KJL), pp. 510–516.

STOC-1984-Gonnet #equivalence #polynomial #random

Determining Equivalence of Expressions in Random Polynomial Time (Extended Abstract) (GHG), pp. 334–341.

STOC-1984-Vishkin #parallel #random

Randomized Speed-Ups in Parallel Computation (UV), pp. 230–239.

VLDB-1983-Orenstein #random

A Dynamic Hash File for Random and Sequential Accessing (JAO), pp. 132–141.

STOC-1983-Bach #how #integer #random

How to Generate Random Integers with Known Factorization (EB), pp. 184–188.

STOC-1983-Myers #random

The Random Access Hierarchy (Preliminary Report) (DM), pp. 355–364.

STOC-1983-Sipser83a #approach #complexity

A Complexity Theoretic Approach to Randomness (MS), pp. 330–335.

DAC-1982-KangKL #adaptation #cpu #design #evolution #layout #logic #matrix #random

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.

VLDB-1982-Leiss #database #statistics

Randomizing, A Practical Method for Protecting Statistical Databases Against Compromise (ELL), pp. 189–196.

STOC-1982-Kurtz #on the #random

On the Random Oracle Hypothesis (SAK), pp. 224–230.

DAC-1981-McDermott #analysis #fault #random

Random fault analysis (RMM), pp. 360–364.

STOC-1981-BertoniMS #polynomial #random

A Characterization of the Class of Functions Computable in Polynomial Time on Random Access Machines (AB, GM, NS), pp. 168–176.

ICALP-1981-HeintzS #decidability #polynomial #random

Absolute Primality of Polynomials is Decidable in Random Polynomial Time in the Number of Variables (JH, MS), pp. 16–28.

ICALP-1981-Shamir #encryption #generative #on the #pseudo #sequence

On the Generation of Cryptographically Strong Pseudo-Random Sequences (AS), pp. 544–550.

ICSE-1981-DuranN #random testing #testing

A Report on Random Testing (JWD, SCN), pp. 179–183.

DAC-1980-ShirakawaOHTO #layout #logic #random

A layout system for the random logic portion of MOS LSI (IS, NO, TH, ST, HO), pp. 92–99.

STOC-1980-ReifS #random

Random Matroids (JHR, PGS), pp. 385–397.

ICALP-1979-Schonhage #on the #power of #random

On the Power of Random Access Machines (AS), pp. 520–529.

STOC-1978-FortuneW #parallel #random

Parallelism in Random Access Machines (SF, JW), pp. 114–118.

STOC-1977-AdlemanM

Reducibility, Randomness, and Intractability (Abstract) (LMA, KLM), pp. 151–163.

DAC-1976-Feller #automation #layout #low cost

Automatic layout of low-cost quick-turnaround random-logic custom LSI devices (AF), pp. 79–85.

VLDB-J-1975-BayerM76 #on the #random

On the Encipherment of Search Trees and Random Access Files (RB, JKM), pp. 37–52.

DAC-1975-SchulerUBB #concurrent #generative #logic #random testing #simulation #testing #using

Random test generation using concurrent logic simulation (DMS, EGU, TEB, SPB), pp. 261–267.

VLDB-1975-BayerM #on the #random

On the Encipherment of Search Trees and Random Access Files (RB, JKM), p. 452.

SOSP-1973-Fuller #random #scheduling

Random Arrival and the MTPT Drum Scheduling Discipline (SHF), pp. 54–57.

STOC-1972-CookR #bound #random

Time-Bounded Random Access Machines (SAC, RAR), pp. 73–80.

STOC-1972-Schnorr #complexity #effectiveness #process #random testing #testing

The Process Complexity and Effective Random Tests (CPS), pp. 168–176.

SIGFIDET-1971-Nijssen #performance #random

Efficient Batch Updating of a Random File (GMN), pp. 173–186.

SIGIR-1971-Gustafson #combinator #random

Elements of the Randomized Combinatorial File Structure (RAG), pp. 163–174.