Stem zero$ (all stems)

124 papers:

PLDI-2015-MarrSD #metaprogramming #performance #protocol

Zero-overhead metaprogramming: reflection and metaobject protocols fast and without compromises (SM, CS, SD), pp. 545–554.

ICALP-v1-2015-CohenS

Zero-Fixing Extractors for Sub-Logarithmic Entropy (GC, IS), pp. 343–354.

ICML-2015-GasseAE #classification #composition #multi #on the #set

On the Optimality of Multi-Label Classification under Subset Zero-One Loss for Distributions Satisfying the Composition Property (MG, AA, HE), pp. 2531–2539.

ICML-2015-PerolatSPP #approximate #game studies #markov #programming

Approximate Dynamic Programming for Two-Player Zero-Sum Markov Games (JP, BS, BP, OP), pp. 1321–1329.

ICML-2015-Romera-ParedesT #approach #learning

An embarrassingly simple approach to zero-shot learning (BRP, PHST), pp. 2152–2161.

KDD-2015-SatoN #online #probability

Stochastic Divergence Minimization for Online Collapsed Variational Bayes Zero Inference of Latent Dirichlet Allocation (IS, HN), pp. 1035–1044.

SIGIR-2015-LiLLDY #image #semantics

Zero-shot Image Tagging by Hierarchical Semantic Embedding (XL, SL, WL, XD, GY), pp. 879–882.

STOC-2014-GoyalOSV #black box

Black-box non-black-box zero knowledge (VG, RO, AS, IV), pp. 515–524.

ICALP-v1-2014-GafniH

Sporadic Solutions to Zero-One Exclusion Tasks (EG, MH), pp. 1–10.

ICFP-2014-BreitnerEJW #haskell #low cost

Safe zero-cost coercions for Haskell (JB, RAE, SLPJ, SW), pp. 189–202.

SCSM-2014-TurnerH #network #social #what

What Does Your Profile Picture Say About You? The Accuracy of Thin-Slice Personality Judgments from Social Networking Sites Made at Zero-Acquaintance (MT, NH), pp. 506–516.

ICPR-2014-LiuWCL #automation #category theory #image #learning

Automatic Image Attribute Selection for Zero-Shot Learning of Object Categories (LL, AW, SC, BCL), pp. 2619–2624.

ICPR-2014-TouaziMB #feature model #game studies

Feature Selection Scheme Based on Zero-Sum Two-Player Game (AT, FM, DB), pp. 1342–1347.

MLDM-2014-AbdullahiCM #approach #identification #novel #using

A Novel Approach for Identifying Banded Patterns in Zero-One Data Using Column and Row Banding Scores (FBA, FC, RM), pp. 58–72.

LICS-CSL-2014-BrazdilKKNK #automaton #multi #probability

Zero-reachability in probabilistic multi-counter automata (TB, SK, AK, PN, JPK), p. 10.

SEFM-2013-WonischSW #monitoring #runtime

Zero Overhead Runtime Monitoring (DW, AS, HW), pp. 244–258.

CASE-2012-SchmidtH #automation #data transformation #fault

Managing data for a zero defect production — the contribution of manufacturing automation to a corporate strategy (GS, TH), pp. 70–73.

DAC-2012-ChenHKYW #low cost

Age-based PCM wear leveling with nearly zero search cost (CHC, PCH, TWK, CLY, CYMW), pp. 453–458.

DATE-2012-NassarSGD #named #performance

RSM: A small and fast countermeasure for AES, secure against 1st and 2nd-order zero-offset SCAs (MN, YS, SG, JLD), pp. 1173–1178.

ICALP-v1-2012-BaronOV #black box

Nearly Simultaneously Resettable Black-Box Zero Knowledge (JB, RO, IV), pp. 88–99.

ICALP-v1-2012-DeshpandeKS

Zero-One Rounding of Singular Vectors (AD, RK, NS), pp. 278–289.

ICALP-v1-2012-RabinMMY #performance #strict #transaction #validation

Strictly-Black-Box Zero-Knowledge and Efficient Validation of Financial Transactions (MOR, YM, SM, MY), pp. 738–749.

CHI-2012-MoellerK #architecture #interactive #multi #named

ZeroTouch: an optical multi-touch and free-air interaction architecture (JM, AK), pp. 2165–2174.

SIGIR-2012-Sakai #evaluation #information retrieval #mobile #towards #what

Towards zero-click mobile IR evaluation: knowing what and knowing when (TS), pp. 1157–1158.

LICS-2012-ChenM #algebra #category theory #constraints #quantifier #theorem

An Algebraic Preservation Theorem for Aleph-Zero Categorical Quantified Constraint Satisfaction (HC, MM), pp. 215–224.

DAC-2011-PaulaNNOH #named

TAB-BackSpace: unlimited-length trace buffers with zero additional on-chip overhead (FMdP, AN, ZN, AO, AJH), pp. 411–416.

CHI-2011-ToupsKHS #coordination #learning #simulation

Zero-fidelity simulation of fire emergency response: improving team coordination learning (ZOT, AK, WAH, NS), pp. 1959–1968.

HIMI-v1-2011-Pavel11a #approach #composition #design #protocol #security

An Approach for Security Protocol Design Based on Zero-Knowledge Primitives Composition (OP), pp. 374–378.

SIGIR-2011-SinghPS #behaviour #query

User behavior in zero-recall ecommerce queries (GS, NP, NS), pp. 75–84.

OOPSLA-2011-YangBFSM #matter #why

Why nothing matters: the impact of zeroing (XY, SMB, DF, JBS, KSM), pp. 307–324.

STOC-2010-BravermanO10a

Zero-one frequency laws (VB, RO), pp. 281–290.

SAT-2010-GelderS #design #satisfiability

Zero-One Designs Produce Small Hard SAT Instances (AVG, IS), pp. 388–397.

DLT-2009-Kirsten #commutative

The Support of a Recognizable Series over a Zero-Sum Free, Commutative Semiring Is Recognizable (DK), pp. 326–333.

SEKE-2009-ZhangLSDCL #scalability #verification

Formal Verification of Scalable NonZero Indicators (SJZ, YL, JS, JSD, WC, YAL), pp. 406–411.

CASE-2008-ChenFCWL #industrial

Practical industrial robot zero offset calibration (HC, TAF, SC, JW, XL), pp. 516–521.

DAC-2008-ChangHHLWL

Type-matching clock tree for zero skew clock gating (CMC, SHH, YKH, JZL, HPW, YSL), pp. 714–719.

DAC-2008-SenNSC #adaptation #named #power management #process

Pro-VIZOR: process tunable virtually zero margin low power adaptive RF for wireless systems (SS, VN, RS, AC), pp. 492–497.

DATE-2008-WangZHZT #design #multi #reliability

Zero-Efficient Buffer Design for Reliable Network-on-Chip in Tiled Chip-Multi-Processor (JW, HZ, KH, GZ, YT), pp. 792–795.

ICALP-C-2008-HallgrenKSZ #protocol #quantum #verification

Making Classical Honest Verifier Zero Knowledge Protocols Secure against Quantum Attacks (SH, AK, PS, SZ), pp. 592–603.

ICALP-C-2008-OstrovskyPV #concurrent

Constant-Round Concurrent Non-malleable Zero Knowledge in the Bare Public-Key Model (RO, GP, IV), pp. 548–559.

RTA-2008-KoprowskiW #termination

Arctic Termination ...Below Zero (AK, JW), pp. 202–216.

STOC-2007-IshaiKOS #multi

Zero-knowledge from secure multiparty computation (YI, EK, RO, AS), pp. 21–30.

ICALP-2007-KiayiasZ #adaptation #composition #security

Trading Static for Adaptive Security in Universally Composable Zero-Knowledge (AK, HSZ), pp. 316–327.

LATA-2007-KocholKSS #matrix #reduction

Reductions of matrices associated with nowhere-zero flows (MK, NK, SS, KS), pp. 297–306.

LATA-2007-Martugin #automaton

A series of slowly synchronizable automata with a zero state over a small alphabet (PVM), pp. 391–402.

HPDC-2007-BurgerK #grid #multi #named

MOB: zero-configuration high-throughput multicasting for grid applications (MdB, TK), pp. 159–168.

STOC-2006-MicaliP

Local zero knowledge (SM, RP), pp. 306–315.

STOC-2006-NguyenV #performance #proving

Zero knowledge with efficient provers (MHN, SPV), pp. 287–295.

STOC-2006-Watrous #quantum

Zero-knowledge against quantum attacks (JW), pp. 296–305.

ICALP-v1-2006-FortnowHPVW #complexity

Extracting Kolmogorov Complexity with Applications to Dimension Zero-One Laws (LF, JMH, AP, NVV, FW), pp. 335–345.

ICALP-v2-2006-FurukawaKI #compilation #performance

An Efficient Compiler from Σ-Protocol to 2-Move Deniable Zero-Knowledge (JF, KK, HI), pp. 46–57.

ICALP-v2-2006-GennaroM #independence #set

Independent Zero-Knowledge Sets (RG, SM), pp. 34–45.

ICALP-v2-2006-Visconti #internet #performance

Efficient Zero Knowledge on the Internet (IV), pp. 22–33.

ICPR-v2-2006-LiuL #classification #image #using

Genus-Zero Shape Classification Using Spherical Normal Image (SL, JL), pp. 126–129.

KDD-2006-LoekitoB #diagrams #mining #performance #using

Fast mining of high dimensional expressive contrast patterns using zero-suppressed binary decision diagrams (EL, JB), pp. 307–316.

ICALP-2005-CrescenzoV #concurrent

Concurrent Zero Knowledge in the Public-Key Model (GDC, IV), pp. 816–827.

ICALP-2005-PersianoV #concurrent #constant

Single-Prover Concurrent Zero Knowledge in Almost Constant Rounds (GP, IV), pp. 228–240.

STOC-2004-AzarR #network

The zero-one principle for switching networks (YA, YR), pp. 64–71.

VLDB-2003-Kuhn #database #semistructured data

The Zero-Delay Data Warehouse: Mobilizing Heterogeneous Databases (EK), pp. 1035–1040.

STOC-2003-AharonovT #generative #quantum #statistics

Adiabatic quantum state generation and statistical zero knowledge (DA, ATS), pp. 20–29.

ICML-2003-ConitzerS03a #bound #framework #game studies #named

BL-WoLF: A Framework For Loss-Bounded Learnability In Zero-Sum Games (VC, TS), pp. 91–98.

HPDC-2003-KurmannS #communication #corba #distributed #middleware #performance

Zero-Copy for CORBA — Efficient Communication for Distributed Object Middleware (CK, TS), pp. 4–13.

DATE-2002-AloulMS #satisfiability #search-based #using

Search-Based SAT Using Zero-Suppressed BDDs (FAA, MNM, KAS), p. 1082.

VLDB-2002-CormodeDIM #data type #how #using

Comparing Data Streams Using Hamming Norms (How to Zero In) (GC, MD, PI, SM), pp. 335–345.

TACAS-2002-Subramani #analysis #scheduling

An Analysis of Zero-Clairvoyant Scheduling (KS), pp. 98–112.

STOC-2002-DworkS #proving

2-round zero knowledge and proof auditors (CD, LJS), pp. 322–331.

STOC-2002-Goldreich #concurrent #revisited

Concurrent zero-knowledge with timing, revisited (OG), pp. 332–340.

STOC-2001-CanettiKPR #black box #concurrent

Black-box concurrent zero-knowledge requires Ω(log n) rounds (RC, JK, EP, AR), pp. 570–579.

STOC-2001-KilianP #concurrent

Concurrent and resettable zero-knowledge in poly-loalgorithm rounds (JK, EP), pp. 560–569.

QAPL-2001-Martin

Powerdomains and Zero Finding (KM), pp. 173–184.

VLDB-2000-Ladin #enterprise #latency

The Zero Latency Enterprise (DL), pp. 674–676.

STOC-2000-CanettiGGM

Resettable zero-knowledge (extended abstract) (RC, OG, SG, SM), pp. 235–244.

STOC-2000-CrescenzoSY #on the #proving

On zero-knowledge proofs (extended abstract): “from membership to decision” (GDC, KS, MY), pp. 255–264.

ICALP-2000-SantisCP #proving

Necessary and Sufficient Assumptions for Non-iterative Zero-Knowledge Proofs of Knowledge for All NP Relations (ADS, GDC, GP), pp. 451–462.

CC-2000-UhWWJBC #effectiveness

Techniques for Effectively Exploiting a Zero Overhead Loop Buffer (GRU, YW, DBW, SJ, CB, VC), pp. 157–172.

CSL-2000-BlassG00a #polynomial

Choiceless Polynomial Time Computation and the Zero-One Law (AB, YG), pp. 18–40.

ICALP-1999-SantisCP

Non-Interactive Zero-Knowledge: A Low-Randomness Characterization of NP (ADS, GDC, GP), pp. 271–280.

LCTES-1999-UhWWJBC #effectiveness

Effective Exploitation of a Zero Overhead Loop Buffer (GRU, YW, DBW, SJ, CB, VC), pp. 10–19.

CSL-1999-Stewart #array #quantifier

Program Schemes, Arrays, Lindström Quantifiers and Zero-One Laws (IAS), pp. 374–388.

DATE-1998-HamiltonO #concurrent #fault #latency

Concurrent Error Recovery with Near-Zero Latency in Synthesized ASICs (SNH, AO), pp. 604–609.

STOC-1998-DworkNS #concurrent

Concurrent Zero-Knowledge (CD, MN, AS), pp. 409–418.

STOC-1998-GoldreichSV #statistics

Honest-Verifier Statistical Zero-Knowledge Equals General Statistical Zero-Knowledge (OG, AS, SPV), pp. 399–408.

ICALP-1998-DamgardP #interactive #performance

Sequential Iteration of Interactive Arguments and an Efficient Zero-Knowledge Argument for NP (ID, BP), pp. 772–783.

ICPR-1998-SmithL #segmentation #using

Texture segmentation using zero crossings information (GS, DL), pp. 262–264.

DAC-1997-ElfadelL #modelling #network

Zeros and Passivity of Arnoldi-Reduced-Order Models for Interconnect Networks (IME, DDL), pp. 28–33.

STOC-1997-CramerD #linear #performance #proving

Linear Zero-Knowledge — A Note on Efficient Zero-Knowledge Proofs and Arguments (RC, ID), pp. 436–445.

STOC-1997-KilianPT #proving

Probabilistically Checkable Proofs with Zero Knowledge (JK, EP, GT), pp. 496–505.

ICALP-1997-SantisCP

Randomness-Efficient Non-Interactive Zero-Knowledge (Extended Abstract) (ADS, GDC, GP), pp. 716–726.

STOC-1996-Beaver96a #adaptation

Adaptive Zero Knowledge and Computational Equivocation (Extended Abstract) (DB), pp. 629–638.

STOC-1996-Okamoto #on the #proving #statistics

On Relationships between Statistical Zero-Knowledge Proofs (TO), pp. 649–658.

ICML-1996-KahaviW #bias #composition

Bias Plus Variance Decomposition for Zero-One Loss Functions (RK, DW), pp. 275–283.

LICS-1996-HirstH #complexity #recursion

More About Recursive Structures: Descriptive Complexity and Zero-One Laws (TH, DH), pp. 334–347.

LICS-1996-McColm #graph #random

Zero-One Laws for Gilbert Random Graphs (GLM), pp. 360–369.

STOC-1995-Pan #algorithm #approximate #parallel #polynomial

Optimal (up to polylog factors) sequential and parallel algorithms for approximating complex polynomial zeros (VYP), pp. 741–750.

DAC-1994-Edahiro #algorithm #performance

An Efficient Zero-Skew Routing Algorithm (ME), pp. 375–380.

DAC-1994-Minato #algebra #set #using

Calculation of Unate Cube Set Algebra Using Zero-Suppressed BDDs (SiM), pp. 420–424.

PLDI-1994-KurlanderF #low cost

Zero-cost Range Splitting (SMK, CNF), pp. 257–265.

STOC-1994-LiptonY #complexity #game studies #scalability

Simple strategies for large zero-sum games with applications to complexity theory (RJL, NEY), pp. 734–740.

SAC-1994-GordonBW #algorithm #performance #problem #search-based

A note on the performance of genetic algorithms on zero-one knapsack problems (VSG, APWB, DW), pp. 194–195.

SAC-1994-KhuriBH #algorithm #multi #problem #search-based

The zero/one multiple knapsack problem and genetic algorithms (SK, TB, JH), pp. 188–193.

DAC-1993-Edahiro #algorithm #clustering #optimisation

A Clustering-Based Optimization Algorithm in Zero-Skew Routings (ME), pp. 612–616.

DAC-1993-Minato #combinator #problem #set

Zero-Suppressed BDDs for Set Manipulation in Combinatorial Problems (SiM), pp. 272–277.

DAC-1993-PullelaMP #optimisation #reliability #using

Reliable Non-Zero Skew Clock Trees Using Wire Width Optimization (SP, NM, LTP), pp. 165–170.

ICSE-1993-Linger #re-engineering

Cleanroom Software Engineering for Zero-Defect Software (RCL), pp. 2–13.

DAC-1992-ChaoHH

Zero Skew Clock Net Routing (THC, YCH, JMH), pp. 518–523.

DAC-1992-Jones #incremental

Zero Delay versus Positive Delay in an Incremental Switch-Level Simulator (LGJ), pp. 424–427.

STOC-1992-BellareP #performance #proving

Making Zero-Knowledge Provers Efficient (MB, EP), pp. 711–722.

STOC-1992-Kilian #performance #proving

A Note on Efficient Zero-Knowledge Proofs and Arguments (Extended Abstract) (JK), pp. 723–732.

ICALP-1992-SantisPY #bound #proving #statistics #verification

One-Message Statistical Zero-Knowledge Proofs and Space-Bounded Verifier (ADS, GP, MY), pp. 28–40.

LICS-1992-HalpernK #logic

Zero-One Laws for Modal Logic (JYH, BMK), pp. 369–380.

STOC-1990-BellareMO #constant

Perfect Zero-Knowledge in Constant Rounds (MB, SM, RO), pp. 482–493.

STOC-1990-BellareMO90a #complexity #statistics

The (True) Complexity of Statistical Zero Knowledge (MB, SM, RO), pp. 494–502.

STOC-1990-Lakshman #complexity #on the

On the Complexity of Computing a Gröbner Basis for the Radical of a Zero Dimensional Ideal (YNL), pp. 555–563.

ICALP-1990-GoldreichK #composition #on the #proving

On the Composition of Zero-Knowledge Proof Systems (OG, HK), pp. 268–282.

VLDB-1989-BhargavaG #database

Achieving Zero Information-Loss in a Classical Database Environment (GB, SKG), pp. 217–224.

STOC-1989-ChorK #privacy

A Zero-One Law for Boolean Privacy (extended abstract) (BC, EK), pp. 62–72.

ICALP-1989-BrassardC #bound

Everything in NP can be Argued in Perfect Zero-Knowledge in a Bounded Number of Rounds (GB, CC, MY), pp. 123–136.

ML-1989-Selfridge #adaptation #case study #contest #learning

Atoms of Learning II: Adaptive Strategies A Study of Two-Person Zero-Sum Competition (OGS), pp. 412–415.

RTA-1989-Baader #unification

Characterization of Unification Type Zero (FB), pp. 2–14.

STOC-1988-BlumFM

Non-Interactive Zero-Knowledge and Its Applications (Extended Abstract) (MB, PF, SM), pp. 103–112.

STOC-1988-HalpernMT #analysis #knowledge-based

A Knowledge-Based Analysis of Zero Knowledge (Preliminary Report) (JYH, YM, MRT), pp. 132–147.

STOC-1987-FeigeFS #proving

Zero Knowledge Proofs of Identity (UF, AF, AS), pp. 210–217.

STOC-1987-Fortnow #complexity

The Complexity of Perfect Zero-Knowledge (Extended Abstract) (LF), pp. 204–209.

STOC-1984-GoldbergM #on the #problem

On Finding the Exact Solution of a Zero-One Knapsack Problem (AVG, AMS), pp. 359–368.