Stem perfect$ (all stems)

95 papers:

LATA-2015-DabrowskiHP #bound #clique #graph

Bounding Clique-Width via Perfect Graphs (KKD, SH, DP), pp. 676–688.

CSCW-2015-QuattroneCM #bias #dataset

There’s No Such Thing as the Perfect Map: Quantifying Bias in Spatial Crowd-sourcing Datasets (GQ, LC, PDM), pp. 1021–1032.

CSL-2015-BrihayeBMR #reachability

Weak Subgame Perfect Equilibria and their Application to Quantitative Reachability (TB, VB, NM, JFR), pp. 504–518.

VLDB-2014-JugelJHM #performance #visual notation

Faster Visual Analytics through Pixel-Perfect Aggregation (UJ, ZJ, GH, VM), pp. 1705–1708.

FoSSaCS-2014-Chatterjee0GO #game studies #probability

Perfect-Information Stochastic Mean-Payoff Parity Games (KC, LD, HG, YO), pp. 210–225.

ICALP-v1-2014-BevernBBCFNW #graph

Star Partitions of Perfect Graphs (RvB, RB, LB, JC, VF, RN, GJW), pp. 174–185.

LATA-2014-Gysel #algorithm #problem

Minimal Triangulation Algorithms for Perfect Phylogeny Problems (RG), pp. 421–432.

CHI-2014-TrinhYE #named

PitchPerfect: integrated rehearsal environment for structured presentation preparation (HT, KY, DE), pp. 1571–1580.

CSCW-2014-PineM #logic #problem

Institutional logics of the EMR and the problem of “perfect” but inaccurate accounts (KHP, MM), pp. 283–294.

STOC-2013-CyganKN #performance

Fast hamiltonicity checking via bases of perfect matchings (MC, SK, JN), pp. 301–310.

STOC-2013-KeevashKM #polynomial

Polynomial-time perfect matchings in dense hypergraphs (PK, FK, RM), pp. 311–320.

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.

FoSSaCS-2012-BrihayeBPG #game studies #reachability

Subgame Perfection for Equilibria in Quantitative Reachability Games (TB, VB, JDP, HG), pp. 286–300.

CIKM-2012-JiaZH #network #simulation

Non-stationary bayesian networks based on perfect simulation (YJ, WZ, JH), pp. 1095–1104.

LICS-2012-Aumann #game studies #induction

Backward induction in games of perfect information (RJA), p. 1.

LICS-2012-EsparzaGM #bound #verification

A Perfect Model for Bounded Verification (JE, PG, RM), pp. 285–294.

SAT-2012-Ben-HaimIMM #constraints #encoding

Perfect Hashing and CNF Encodings of Cardinality Constraints (YBH, AI, OM, AM), pp. 397–409.

CSMR-2011-SilvaPAM #execution #on the

On the Use of Execution Trace Alignment for Driving Perfective Changes (LLS, KRP, SdA, MdAM), pp. 221–230.

ASE-2010-KessentiniVS #identification #risk management

Deviance from perfection is a better criterion than closeness to evil when identifying risky code (MK, SV, HAS), pp. 113–122.

CSMR-2010-Prakash #adaptation #maintenance

Achieving Agility in Adaptive and Perfective Software Maintenance (GP), pp. 61–62.

STOC-2010-GoelKK #graph

Perfect matchings in o(n log n) time in regular bipartite graphs (AG, MK, SK), pp. 39–46.

IJCAR-2010-BensaidCP #graph #integer

Perfect Discrimination Graphs: Indexing Terms with Integer Exponents (HB, RC, NP), pp. 369–383.

STOC-2009-FriedrichS #random

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

ICALP-v1-2009-KobayashiGNR #communication #network #quantum

General Scheme for Perfect Quantum Network Coding with Free Classical Communication (HK, FLG, HN, MR), pp. 622–633.

SIGIR-2009-MacdonaldO #documentation #on the #ranking

On perfect document rankings for expert search (CM, IO), pp. 740–741.

DATE-2008-ShahidiG #multi #testing

Multi-Vector Tests: A Path to Perfect Error-Rate Testing (SS, SG), pp. 1178–1183.

ICALP-C-2008-CanettiD

Extractable Perfectly One-Way Functions (RC, RRD), pp. 449–460.

ICALP-C-2008-CanettiEGL #how

How to Protect Yourself without Perfect Shredding (RC, DE, SG, DYL), pp. 511–523.

CIKM-2008-Coetzee #n-gram #named

TinyLex: static n-gram index pruning with perfect recall (DC), pp. 409–418.

ICALP-2007-AlonG #product line

Balanced Families of Perfect Hash Functions and Their Applications (NA, SG), pp. 435–446.

ICALP-2007-GimbertZ #game studies #probability

Perfect Information Stochastic Priority Games (HG, WZ), pp. 850–861.

CIKM-2007-BotelhoZ #scalability #set

External perfect hashing for very large key sets (FCB, NZ), pp. 653–662.

PODS-2006-MachanavajjhalaG #on the #performance #privacy

On the efficiency of checking perfect privacy (AM, JG), pp. 163–172.

TACAS-2006-GurfinkelC #abstraction #question #why

Why Waste a Perfectly Good Abstraction? (AG, MC), pp. 212–226.

DLT-2006-GlasserTW #polynomial

Perfect Correspondences Between Dot-Depth and Polynomial-Time Hierarchy (CG, SDT, KWW), pp. 408–419.

ICALP-v1-2006-BjorklundH #algorithm #satisfiability

Exact Algorithms for Exact Satisfiability and Number of Perfect Matchings (AB, TH), pp. 548–559.

ICALP-v1-2006-BlellochDHRSS #parametricity #re-engineering

Fixed Parameter Tractability of Binary Near-Perfect Phylogenetic Tree Reconstruction (GEB, KD, EH, RR, RS, SS), pp. 667–678.

ICALP-v1-2006-HoangMT #on the #problem

On the Bipartite Unique Perfect Matching Problem (TMH, MM, TT), pp. 453–464.

ICDAR-2005-YacoubSS #documentation #named

PerfectDoc: A Ground Truthing Environment for Complex Documents (SMY, VS, SNS), pp. 452–457.

ICALP-2005-CrescenzoK #communication

Asynchronous Perfectly Secure Communication over One-Time Pads (GDC, AK), pp. 216–227.

SEFM-2005-CarterMM #developer #refinement

Software Refinement with Perfect Developer (GC, RM, JMM), pp. 363–373.

ICSE-2005-KoAM #design #elicitation #ide #maintenance #requirements

Eliciting design requirements for maintenance-oriented IDEs: a detailed study of corrective and perfective maintenance tasks (AJK, HHA, BAM), pp. 126–135.

FoSSaCS-2004-Zielonka #game studies #probability

Perfect-Information Stochastic Parity Games (WZ), pp. 499–513.

FoSSaCS-2004-ZuninoD #calculus #encryption #process

A Note on the Perfect Encryption Assumption in a Process Calculus (RZ, PD), pp. 514–528.

CHI-2004-TeevanAAK #behaviour #case study

The perfect search engine is not enough: a study of orienteering behavior in directed search (JT, CA, MSA, DRK), pp. 415–422.

ICPR-v3-2004-IshiiO #3d #using

Perfect Perspective Projection using a Varifocal Mirror and Its Application to Three-Dimensional Close-Up Imaging (AI, RO), pp. 270–273.

ICALP-2002-IshaiK

Perfect Constant-Round Secure Computation via Perfect Randomizing Polynomials (YI, EK), pp. 244–256.

LCTES-SCOPES-2002-KimHK #design #object-oriented #realtime #scheduling

Perfecting preemption threshold scheduling for object-oriented real-time system design: from the perspective of real-time synchronization (SK, SH, THK), pp. 223–232.

STOC-2001-Pagh #complexity #on the

On the cell probe complexity of membership and perfect hashing (RP), pp. 425–432.

CHI-2001-GrayF

Ignoring perfect knowledge in-the-world for imperfect knowledge in-the-head (WDG, WTF), pp. 112–119.

SAC-2001-WangZZ #network

Perfect phylogenetic networks with recombination (LW, KZ, LZ), pp. 46–50.

STOC-2000-MahajanV #graph

A new NC-algorithm for finding a perfect matching in bipartite planar and small genus graphs (extended abstract) (MM, KRV), pp. 351–357.

CIKM-2000-MiuraMSW

Extensible Perfect Hashing (TM, WM, IS, YW), pp. 446–452.

CL-2000-PettorossiP #model checking

Perfect Model Checking via Unfold/Fold Transformations (AP, MP), pp. 613–628.

STOC-1999-RussellSZ #bound

Lower Bounds for Leader Election and Collective Coin-Flipping in the Perfect Information Model (AR, MES, DZ), pp. 339–347.

FM-v1-1999-KestenKPR #analysis #deduction #model checking #verification

A Perfect Verification: Combining Model Checking with Deductive Analysis to Verify Real-Life Software (YK, AK, AP, GR), pp. 173–194.

TOOLS-PACIFIC-1999-WangVS #towards

Towards Perfect Objects (HW, VV, JKS), pp. 115–126.

STOC-1998-CanettiMR #probability

Perfectly One-Way Probabilistic Hash Functions (Preliminary Version) (RC, DM, OR), pp. 131–140.

STOC-1997-Fill #algorithm #markov

An Interruptible Algorithm for Perfect Sampling via Markov Chains (JAF), pp. 688–695.

ICML-1997-SchefferGD #why

Why Experimentation can be better than “Perfect Guidance” (TS, RG, CD), pp. 331–339.

SAC-1997-GoliP #data mining #mining #multi

Application of domain vector perfect hash join for multimedia data mining (VNRG, WP), pp. 334–339.

ICALP-1996-Fernandez-BacaL #algorithm #polynomial

A Polynomial-Time Algorithm for Near-Perfect Phylogeny (DFB, JL), pp. 670–680.

SAC-1996-BhatiaS #database #image

Near perfect hash table for image databases (SKB, CLS), pp. 442–446.

STOC-1995-AielloBV #statistics

Knowledge on the average-perfect, statistical and logarithmic (WA, MB, RV), pp. 469–478.

SAC-1994-SabharwalB #database #image

A perfect hash function for image database indexing (CLS, SKB), pp. 534–538.

LICS-1994-Meyden #axiom #distributed

Axioms for Knowledge and Time in Distributed Systems with Perfect Recall (RvdM), pp. 448–457.

ICDAR-1993-HoB #metric

Perfect metrics (TKH, HSB), pp. 593–597.

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-CooperL #linear #performance #protocol

Fast perfection-information leader-election protocol with linear immunity (JC, NL), pp. 662–671.

WSA-1993-GluckK #process

Occam’s Razor in Metacompuation: the Notion of a Perfect Process Tree (RG, AVK), pp. 112–123.

ICALP-1992-BodlaenderFW

Two Strikes Against Perfect Phylogeny (HLB, MRF, TW), pp. 273–283.

ICALP-1992-BroderFSU

Near-perfect Token Distribution (AZB, AMF, ES, EU), pp. 308–317.

SIGIR-1992-FoxCH #algorithm #performance

A Faster Algorithm for Constructing Minimal Perfect Hash Functions (EAF, QFC, LSH), pp. 266–273.

JICSLP-1992-MartensS #metaprogramming #semantics

A Perfect Herbrand Semantics for Untyped Vanilla Meta-Programming (BM, DDS), pp. 511–525.

DAC-1991-CrastesSS

A Technology Mapping Method Based On Perfect And Semi-Perfect Matchings (MC, KS, GS), pp. 93–98.

STOC-1991-Maurer #encryption #independence #security

Perfect Cryptographic Security from Partially Independent Channels (UMM), pp. 561–571.

ICLP-1991-BachmairG #logic programming #semantics #similarity #source code

Perfect Model Semantics for Logic Programs with Equality (LB, HG), pp. 645–659.

ICLP-1991-MontanariR #constraints #logic programming

Perfect Relaxation in Constraint Logic Programming (UM, FR), pp. 223–237.

STOC-1990-BellareMO #constant

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

SIGIR-1990-FoxCDH #information retrieval #order

Order Preserving Minimal Perfect Hash Functions and Information Retrieval (EAF, QFC, AMD, LSH), pp. 279–311.

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.

KR-1989-RossiM #constraints #linear #network #using

Exact Solution in Linear Time of Networks of Constraints Using Perfect Relaxation (FR, UM), pp. 394–399.

ESOP-1988-AikenN #parallel #pipes and filters

Perfect Pipelining: A New Loop Parallelization Technique (AA, AN), pp. 221–235.

JICSCP-1988-AptB88 #classification #modelling #source code

Arithmetic Classification of Perfect Models of Stratified Programs (KRA, HAB), pp. 765–779.

JICSCP-1988-PrzymusinskaP88 #logic programming #semantics #source code

Weakly Perfect Model Semantics for Logic Programs (HP, TCP), pp. 1106–1120.

JICSCP-1988-Przymusinski88 #semantics

Perfect Model Semantics (TCP), pp. 1081–1096.

STOC-1987-Fortnow #complexity

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

SIGMOD-1985-LarsonR

External Perfect Hashing (PÅL, MVR), pp. 190–200.

STOC-1985-KarpUW #random

Constructing a Perfect Matching is in Random NC (RMK, EU, AW), pp. 22–32.

VLDB-1984-YangD

A Dynamic Perfect Hash Function Defined by an Extended Hash Indicator Table (WPY, MWD), pp. 245–254.

STOC-1984-BachMS

Sums of Divisors, Perfect Numbers, and Factoring (Extended Abstract) (EB, GLM, JS), pp. 183–190.

STOC-1984-SlotB #on the #performance

On Tape Versus Core; An Application of Space Efficient Perfect Hash Functions to the Invariance of Space (CFS, PvEB), pp. 391–400.

ICALP-1981-FraenkelL #exponential

Computing a Perfect Strategy for n*n Chess Requires Time Exponential in N (ASF, DL), pp. 278–293.

STOC-1980-SupowitPR #heuristic

Heuristics for Weighted Perfect Matching (KJS, DAP, EMR), pp. 398–419.

STOC-1976-Schaefer #complexity #finite #game studies #problem

Complexity of Decision Problems Based on Finite Two-Person Perfect-Information Games (TJS), pp. 41–49.