Filters








31,153 Hits in 3.7 sec

Adaptable Processes (Extended Abstract) [chapter]

Mario Bravetti, Cinzia Di Giusto, Jorge A. Pérez, Gianluigi Zavattaro
2011 Lecture Notes in Computer Science  
Detailed definitions and proofs can be found in [5] .  ...  We now provide intuitions on the proof of Theorem 2; see [5] for details.  ... 
doi:10.1007/978-3-642-21461-5_6 fatcat:rmuiuyb5vrdlbodnkaztz3x6dm

Improved Competitive Ratios for Submodular Secretary Problems (Extended Abstract) [chapter]

Moran Feldman, Joseph Naor, Roy Schwartz
2011 Lecture Notes in Computer Science  
In addition, in some cases the proofs we provide assuming random arrival times are shorter and simpler in comparison to existing proofs.  ...  Due to space limitations, the proof of Theorem 5 is omitted from this extended abstract.  ...  Due to space limitations, the proof of Theorem 6 is omitted from this extended abstract. 3 ( 1 1 − ln 2)/2 ≈ 0.153-Competitive Algorithm for SPMS The Submodular Partition Matroid Secretary Problem (SPMS  ... 
doi:10.1007/978-3-642-22935-0_19 fatcat:eworahehbvfq5med2npcjifcay

Variable Elimination in Binary CSPs (Extended Abstract)

Martin C. Cooper, Achref El Mouelhi, Cyril Terrioux
2020 Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence  
Knowledge Representation Questions A starting point for much research in AI/CS are questions of representation and reasoning.  ...  This is envy free and Pareto efficient ex ante but is not strategy proof.  ... 
doi:10.24963/ijcai.2020/691 dblp:conf/ijcai/Walsh20 fatcat:i4h3p6o2tvcl7iu4ah33hk2nr4

Almost 2-SAT Is Fixed-Parameter Tractable (Extended Abstract) [chapter]

Igor Razgon, Barry O'Sullivan
2008 Lecture Notes in Computer Science  
abstract.  ...  several relevant references, Somnath Sikdar for his help in fixing a bug in an earlier version of the archived manuscript, and an anonymous reviewer for suggestions of improvement the presentation of the extended  ...  Proof. (Sketch) We begin by introducing a number of sets.  ... 
doi:10.1007/978-3-540-70575-8_45 fatcat:pmi7lizoojclbdixbddt6hfypu

Approximation algorithms for facility location problems (extended abstract)

David B. Shmoys, Éva Tardos, Karen Aardal
1997 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC '97  
Researchpartiallysupportedby NSF grants DMI-9157199 and DMS-9505155and ONRgrantNOO014-96-1-00500. aardal@cs . ruu. nl.  ...  Researchpartiallysupportedby NSF grants CCR-9307391and DMS-9505 155and ONRgrantNOOO14-96-1 -00500. t eva@cs. cornel 1. edu.  ...  We will show how to extend Theorem 3 to obtain a 4-approximation algorithm for this more general model.  ... 
doi:10.1145/258533.258600 dblp:conf/stoc/ShmoysTA97 fatcat:emcaoiynvvcjrki2whxnsdmymi

Parallel continuous randomized load balancing (extended abstract)

Petra Berenbrink, Tom Friedetzky, Ernst W. Mayr
1998 Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures - SPAA '98  
[BMS97] extends the above results to two directions.  ...  We are now ready to proof the Main Theorem.  ... 
doi:10.1145/277651.277685 dblp:conf/spaa/BerenbrinkFM98 fatcat:hy45cyrgaza55jo4nuktqrcbiq

Automated Construction of Bounded-Loss Imperfect-Recall Abstractions in Extensive-Form Games (Extended Abstract)

Jiří Čermák, Viliam Lisý, Branislav Bošanský
2020 Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence  
We present novel domain-independent abstraction methods for creating very coarse abstractions of EFGs that still compute strategies that are (near) optimal in the original game.  ...  Information abstraction is one of the methods for tackling large extensive-form games (EFGs).  ...  ; (unl; grab)⟫start , whereas it can be expressed in LDL f as ⟨(¬cs + (grab ∧ ¬cs); (unl; (grab ∧ ¬cs)) * ; (cs ∧ unl)); ¬cs * ⟩end .  ... 
doi:10.24963/ijcai.2020/690 dblp:conf/ijcai/GiacomoSFR20 fatcat:vko54j63brecth72cjkhpoo3xu

Curvature-constrained shortest paths in a convex polygon (extended abstract)

Pankaj K. Agarwal, Therese Biedl, Sylvain Lazard, Steve Robbins, Subhash Suri, Sue Whitesides
1998 Proceedings of the fourteenth annual symposium on Computational geometry - SCG '98  
Using ideas from control theory, Boissonnat, Cérézo and Leblond [4] gave an alternative proof for both cases, and recently Sussmann [29] was able to extend the characterization to the 3-dimensional  ...  Proof of Theorem 3.1: The proof proceeds by considering how a nonterminal C-segment may appear in .  ... 
doi:10.1145/276884.276928 dblp:conf/compgeom/AgarwalBLRSW98 fatcat:wa6cqwbz6zfavjhqxtvzxxpr7u

A typed language for distributed mobile processes (extended abstract)

James Riely, Matthew Hennessy
1998 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '98  
Proof. The proof of (a) is readily adapted from the proof of Theorem 3.2.  ...  (y)U 1 (y)]then, via local communication at , to CS 4 4 ⇐= req? (x::i) (NC 4 |CS 4 ) NC 4 ⇐= (ν m)(ν m p, g)m :: C p,g | mig x.x.i!  ... 
doi:10.1145/268946.268978 dblp:conf/popl/RielyH98 fatcat:tnlwbrvgrzdync2fm6etl775oy

Integrating information by outerjoins and full disjunctions (extended abstract)

Anand Rajaraman, Jeffrey D. Ullman
1996 Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems - PODS '96  
Acknowledgements We wish to thank Mihalis Yannakakis for suggesting the use of Bachman diagrams to simplify algorithm SOJO and the proof of its correctness.  ...  University has a CS department."  ...  Completing the Necessity Proof Now w e m ust extend Lemma 4.2 to all hypergraphs that include a -3-cycle among their hyperedges and Lemma 4.3 to all hypergraphs that include a pure cycle among their hyperedges  ... 
doi:10.1145/237661.237717 dblp:conf/pods/RajaramanU96 fatcat:rayqlkvf5vggtmx7u3ssn4kf64

Equilibrium Pricing with Positive Externalities (Extended Abstract) [chapter]

Nima Anari, Shayan Ehsani, Mohammad Ghodsi, Nima Haghpanah, Nicole Immorlica, Hamid Mahini, Vahab S. Mirrokni
2010 Lecture Notes in Computer Science  
The sketch of this more technical proof is as follows.  ...  This author's work has been partially supported by IPM School of CS (contract: CS1388-2-01) How should a company price a product in the presence of historical externalities?  ... 
doi:10.1007/978-3-642-17572-5_35 fatcat:4aolx3syyrbrdlacqetmq6gbqy

Optimal parallel dictionary matching and compression (extended abstract)

Martin Farach, S. Muthukrishnan
1995 Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures - SPAA '95  
Parallel Dictionary Matching and Compression (Extended Abstract)  ...  To implement EXTEND LEFT we make the following observation.  ...  Proof: Let SG [i] be the length of the shortest path in G from 1 to i. Claim 5.lA l<i<j~n~S~[i]~SG~] Proof: Let PI, . . .  ... 
doi:10.1145/215399.215451 dblp:conf/spaa/FarachM95 fatcat:5xlpmwfmsbay7et6iqdshogly4

Generating hard instances of lattice problems (extended abstract)

M. Ajtai
1996 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96  
Therefore, the critical part of the proof is the proof of (1.3).  ...  This concludes the proof of (1.3) of the theorem. Definitions. 1.  ...  We may conclude now the proof of (1.2).  ... 
doi:10.1145/237814.237838 dblp:conf/stoc/Ajtai96 fatcat:sccn37drvjdifekjwcinwxzx2i

Answering queries using templates with binding patterns (extended abstract)

Anand Rajaraman, Yehoshua Sagiv, Jeffrey D. Ullman
1995 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems - PODS '95  
Proof: (sketch) Again think of Fig. 3 and an ex- pansion E for solution S.  ...  We then extend our results to allow arithmetic comparisons in the given query and in the tem- plates.  ... 
doi:10.1145/212433.220199 dblp:conf/pods/RajaramanSU95 fatcat:ovg7bjnslvczrcbry3sq6wrf5m

An Efficient threshold Public Key Cryptosystem Secure Against Adaptive Chosen Ciphertext Attack (Extended Abstract) [chapter]

Ran Canetti, Shafi Goldwasser
1999 Lecture Notes in Computer Science  
The random-oracle was used both in the proof of security and to eliminate interaction.  ...  For lack of space we only sketch the definition in this extended abstract. See [12] for full details on the definition and the relations with that of [25] . Outline of our definition.  ...  If scheme cs is secure against CCA then so is scheme m-cs. 1 · (v /v) s , Proof. Correctness of m-cs (i.e., correct decryption of correctly generated ciphertexts) clearly holds.  ... 
doi:10.1007/3-540-48910-x_7 fatcat:psosdgik2ffchjhkq2b4opp7ai
« Previous Showing results 1 — 15 out of 31,153 results