top

  Info

  • Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.

  Info

  • Utilizzare questo link per rimuovere la selezione effettuata.
Automata, languages, and programming : 39th International Colloquium, ICALP 2012, Warwick, UK, July 9-13, 2012, Proceedings. Part II / Artur Czumaj [and others] (eds.).
Automata, languages, and programming : 39th International Colloquium, ICALP 2012, Warwick, UK, July 9-13, 2012, Proceedings. Part II / Artur Czumaj [and others] (eds.).
Creatore [International Colloquium on Automata, Languages, and Programming (39th : 2012 : Warwick, England)]
Estensione 1 online resource.
Disciplina 005.1/3
Accesso persona Czumaj, Artur
Genere/Forma Electronic books
Conference papers and proceedings
Soggetto non controllato Computer science
Computer Communication Networks
Computer software
Computational complexity
Information storage and retrieval systems
Algorithm Analysis and Problem Complexity
Computation by Abstract Devices
Information Storage and Retrieval
Information Systems Applications (incl. Internet)
Discrete Mathematics in Computer Science
ISBN 9783642315855
3642315852
9783642315848
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto On Multiple Keyword Sponsored Search Auctions with Budgets / Riccardo Colini-Baldeschi, Monika Henzinger, Stefano Leonardi and Martin Starnberger -- A Theory Independent Curry-De Bruijn-Howard Correspondence / Gilles Dowek -- Standing on the Shoulders of a Giant: One Persons Experience of Turings Impact (Summary of the Alan M. Turing Lecture) / David Harel -- Session Types and Distributed Computing / Kohei Honda -- Algorithms, Graph Theory, and the Solution of Laplacian Linear Equations / Daniel A. Spielman -- Randomized Mechanisms for Multi-unit Auctions (Extended Abstract) / Berthold Vöcking -- Algebraic Synchronization Trees and Processes / Luca Aceto, Arnaud Carayol, Zoltán Ésik and Anna Ingólfsdóttir -- Streaming Tree Transducers / Rajeev Alur and Loris D'Antoni -- Causal Graph Dynamics / Pablo Arrighi and Gilles Dowek -- Degree Lower Bounds of Tower-Type for Approximating Formulas with Parity Quantifiers / Albert Atserias and Anuj Dawar -- Monadic Datalog Containment / Michael Benedikt, Pierre Bourhis and Pierre Senellart -- A Machine-Independent Characterization of Timed Languages / Mikołaj Bojańczyk and Sławomir Lasota -- Regular Languages of Infinite Trees That Are Boolean Combinations of Open Sets / Mikołaj Bojańczyk and Thomas Place -- Toward Model Theory with Data Values / Mikołaj Bojańczyk and Thomas Place -- Robust Reachability in Timed Automata: A Game-Based Approach / Patricia Bouyer, Nicolas Markey and Ocan Sankur.
Minimizing Expected Termination Time in One-Counter Markov Decision Processes / Tomáš Brázdil, Antonín Kučera, Petr Novotný and Dominik Wojtczak -- Prefix Rewriting for Nested-Words and Collapsible Pushdown Automata / Christopher Broadbent -- A Saturation Method for Collapsible Pushdown Systems / Chris Broadbent, Arnaud Carayol, Matthew Hague and Olivier Serre -- Regular Languages Are Church-Rosser Congruential / Volker Diekert, Manfred Kufleitner, Klaus Reinhardt and Tobias Walter -- Time and Parallelizability Results for Parity Games with Bounded Treewidth / John Fearnley and Sven Schewe -- Nominal Completion for Rewrite Systems with Binders / Maribel Fernández and Albert Rubio -- Discrete Generalised Polynomial Functors (Extended Abstract) / Marcelo Fiore -- Computing Game Metrics on Markov Decision Processes / Hongfei Fu -- Deciding First Order Properties of Matroids / Tomáš Gavenčiak, Daniel Král and Sang-il Oum -- Pebble Games with Algebraic Rules / Anuj Dawar and Bjarki Holm -- Exponential Lower Bounds and Separation for Query Rewriting / Stanislav Kikot, Roman Kontchakov, Vladimir Podolskii and Michael Zakharyaschev -- Lattices of Logical Fragments over Words (Extended Abstract) / Manfred Kufleitner and Alexander Lauser -- On the Expressive Power of Cost Logics over Infinite Words / Denis Kuperberg and Michael Vanden Boom -- Coalgebraic Predicate Logic / Tadeusz Litak, Dirk Pattinson, Katsuhiko Sano and Lutz Schröder.
Algorithmic Games for Full Ground References / Andrzej S. Murawski and Nikos Tzevelekos -- Two-Level Game Semantics, Intersection Types, and Recursion Schemes / C.-H. Luke Ong and Takeshi Tsukada -- An Automata-Theoretic Model of Idealized Algol (Extended Abstract) / Uday S. Reddy and Brian P. Dunphy -- Towards a Unified Theory of Operational and Axiomatic Semantics / Grigore Roşu and Andrei Ştefănescu -- Loader and Urzyczyn Are Logically Related / Sylvain Salvati, Giulio Manzonetto, Mai Gehrke and Henk Barendregt -- Languages of Profinite Words and the Limitedness Problem / Szymon Toruńczyk -- The Complexity of Mean-Payoff Automaton Expression / Yaron Velner -- On the Locality of Some NP-Complete Problems / Leonid Barenboim -- Growing Half-Balls: Minimizing Storage and Communication Costs in CDNs / Reuven Bar-Yehuda, Erez Kantor, Shay Kutten and Dror Rawitz -- Super-Fast Distributed Algorithms for Metric Facility Location / Andrew Berns, James Hegeman and Sriram V. Pemmaraju -- Preventing Unraveling in Social Networks: The Anchored k-Core Problem / Kshipra Bhawalkar, Jon Kleinberg, Kevin Lewi, Tim Roughgarden and Aneesh Sharma -- Edge Fault Tolerance on Sparse Networks / Nishanth Chandran, Juan Garay and Rafail Ostrovsky -- Incentive Ratios of Fisher Markets / Ning Chen, Xiaotie Deng, Hongyang Zhang and Jie Zhang -- Computational Complexity of Traffic Hijacking under BGP and S-BGP / Marco Chiesa, Giuseppe Di Battista, Thomas Erlebach and Maurizio Patrignani -- Efficiency-Revenue Trade-Offs in Auctions / Ilias Diakonikolas, Christos Papadimitriou, George Pierrakos and Yaron Singer.
Deterministic Network Exploration by Anonymous Silent Agents with Local Traffic Reports / Yoann Dieudonné and Andrzej Pelc -- A QPTAS for -Envy-Free Profit-Maximizing Pricing on Line Graphs / Khaled Elbassioni -- Minimizing Rosenthal Potential in Multicast Games / Fedor V. Fomin, Petr Golovach, Jesper Nederlof and Michał Pilipczuk -- Multiparty Proximity Testing with Dishonest Majority from Equality Testing / Ran Gelles, Rafail Ostrovsky and Kina Winoto -- Anonymous Card Shuffling and Its Applications to Parallel Mixnets / Michael T. Goodrich and Michael Mitzenmacher -- Byzantine Agreement with a Rational Adversary / Adam Groce, Jonathan Katz, Aishwarya Thiruvengadam and Vassilis Zikas -- Random Hyperbolic Graphs: Degree Sequence and Clustering (Extended Abstract) / Luca Gugelmann, Konstantinos Panagiotou and Ueli Peter -- Topology-Aware VM Migration in Bandwidth Oversubscribed Datacenter Networks / Navendu Jain, Ishai Menache, Joseph (Seffi) Naor and F. Bruce Shepherd -- Counting Arbitrary Subgraphs in Data Streams / Daniel M. Kane, Kurt Mehlhorn, Thomas Sauerwald and He Sun -- k-Chordal Graphs: From Cops and Robber to Compact Routing via Treewidth / Adrian Kosowski, Bi Li, Nicolas Nisse and Karol Suchan -- Contention Issues in Congestion Games / Elias Koutsoupias and Katia Papakonstantinopoulou -- Online Mechanism Design (Randomized Rounding on the Fly) / Piotr Krysta and Berthold Vöcking -- Online Packing with Gradually Improving Capacity Estimations and Applications to Network Lifetime Maximization / Marcel Ochel, Klaus Radke and Berthold Vöcking -- Distributed Algorithms for Network Diameter and Girth / David Peleg, Liam Roditty and Elad Tal.
Record Nr. NYU-004623417
[International Colloquium on Automata, Languages, and Programming (39th : 2012 : Warwick, England)]  
Materiale a stampa
Lo trovi qui: New York University
Computer science-- Theory and applications : 7th International Computer Science Symposium in Russia, CSR 2012, Nizhny Novgorod, Russia, July 3-7, 2012. Proceedings / Edward A. Hirsch [and others] (eds.).
Computer science-- Theory and applications : 7th International Computer Science Symposium in Russia, CSR 2012, Nizhny Novgorod, Russia, July 3-7, 2012. Proceedings / Edward A. Hirsch [and others] (eds.).
Creatore [International Computer Science Symposium in Russia (7th : 2012 : Nizhniĭ Novgorod, Russia)]
Estensione 1 online resource (xxiii, 325 pages) : illustrations.
Disciplina 004
Accesso persona Hirsch, Edward A.
Genere/Forma Electronic books
Conference papers and proceedings
Soggetto non controllato Computer science
Computer software
Logic design
Computational complexity
Algorithm Analysis and Problem Complexity
Mathematical Logic and Formal Languages
Discrete Mathematics in Computer Science
Computation by Abstract Devices
Mathematics of Computing
ISBN 9783642306426
364230642X
9783642306419
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Can the Theory of Algorithms Ratify the "Invisible Hand of the Market"? / Vijay V. Vazirani -- Resilient Quicksort and Selection / Maxim Babenko and Ivan Pouzyrevsky -- General Quantitative Specification Theories with Modalities / Sebastian S. Bauer, Uli Fahrenberg, Axel Legay and Claus Thrane -- The Complexity of Intersecting Finite Automata Having Few Final States / Michael Blondin and Pierre McKenzie -- News about Semiantichains and Unichain Coverings / Bartłomiej Bosek, Stefan Felsner, Kolja Knauer and Grzegorz Matecki -- Checking Tests for Read-Once Functions over Arbitrary Bases / Dmitry V. Chistikov -- Approximating Minimum Power Edge-Multi-Covers / Nachshon Cohen and Zeev Nutov -- A Lower Bound on Circuit Complexity of Vector Function in U2 / Evgeny Demenkov -- Computing All MOD-Functions Simultaneously / Evgeny Demenkov, Alexander S. Kulikov, Ivan Mihajlin and Hiroki Morizumi -- Bounded Synchronization Delay in Omega-Rational Expressions / Volker Diekert and Manfred Kufleitner -- Towards Optimal Degree-Distributions for Left-Perfect Matchings in Random Bipartite Graphs / Martin Dietzfelbinger and Michael Rink -- Robust Sensor Range for Constructing Strongly Connected Spanning Digraphs in UDGs / Stefan Dobrev, Evangelos Kranakis, Oscar Morales Ponce and Milan Plžík -- Worst-Case Optimal Priority Queues via Extended Regular Counters / Amr Elmasry and Jyrki Katajainen -- The Complexity of Minor-Ancestral Graph Properties with Forbidden Pairs / Eli Fox-Epstein and Danny Krizanc -- Satisfiability Thresholds beyond k-XORSAT / Andreas Goerdt and Lutz Falke -- Finding Vertex-Surjective Graph Homomorphisms / Petr A. Golovach, Bernard Lidický, Barnaby Martin and Daniël Paulusma -- Broadcast Domination on Block Graphs in Linear Time / Pinar Heggernes and Sigve H. Sæther -- Characterizing Certain Topological Specifications / Bernhard Heinemann -- Descriptional Complexity of Operations on Alternating and Boolean Automata / Galina Jirásková -- Consistency of Multidimensional Combinatorial Substitutions / Timo Jolivet and Jarkko Kari -- Two-Way Automata Characterizations of L/poly versus NL / Christos A. Kapoutsis and Giovanni Pighizzini -- Cutting through Regular Post Embedding Problems / Prateek Karandikar and Philippe Schnoebelen -- On the Advice Complexity of the Set Cover Problem / Dennis Komm, Richard Královič and Tobias Mömke -- Constraint Satisfaction with Counting Quantifiers / Florent Madelaine, Barnaby Martin and Juraj Stacho -- Space-Bounded Kolmogorov Extractors / Daniil Musatov -- Some Results on more Flexible Versions of Graph Motif / Romeo Rizzi and Florian Sikora -- A Characterization of Cellular Automata Generated by Idempotents on the Full Shift / Ville Salo -- Constructing Polynomials for Functions over Residue Rings Modulo a Composite Number in Linear Time / Svetlana N. Selezneva -- Boolean Composition of Visual Secret Sharing Schemes / Hans Ulrich Simon.
Record Nr. NYU-004624138
[International Computer Science Symposium in Russia (7th : 2012 : Nizhniĭ Novgorod, Russia)]  
Materiale a stampa
Lo trovi qui: New York University
Computing and Combinatorics : 18th Annual International Conference, COCOON 2012, Sydney, Australia, August 20-22, 2012. Proceedings / Joachim Gudmundsson, Julián Mestre, Taso Viglas (eds.).
Computing and Combinatorics : 18th Annual International Conference, COCOON 2012, Sydney, Australia, August 20-22, 2012. Proceedings / Joachim Gudmundsson, Julián Mestre, Taso Viglas (eds.).
Creatore [COCOON 2012 (2012 : Sydney, N.S.W.)]
Estensione 1 online resource.
Disciplina 511/.6
Accesso persona Gudmundsson, Joachim
Mestre, Julián
Viglas, Taso
Genere/Forma Electronic books
Conference papers and proceedings
Soggetto non controllato Computer science
Computer Communication Networks
Computer software
Computational complexity
Artificial intelligence
Computer graphics
Algorithm Analysis and Problem Complexity
Discrete Mathematics in Computer Science
Computation by Abstract Devices
ISBN 9783642322419
3642322417
9783642322402
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto A Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree / Binay Bhattacharya and Tsunehiko Kameda -- A Simple D2-Sampling Based PTAS for k-Means and other Clustering Problems / Ragesh Jaiswal, Amit Kumar and Sandeep Sen -- Speed Scaling for Maximum Lateness / Evripidis Bampis, Dimitrios Letsios, Ioannis Milis and Georgios Zois -- Induced Subgraph Isomorphism: Are Some Patterns Substantially Easier Than Others? / Peter Floderus, Mirosław Kowaluk, Andrzej Lingas and Eva-Marta Lundell -- Contiguous Minimum Single-Source-Multi-Sink Cuts in Weighted Planar Graphs / Ivona Bezáková and Zachary Langley -- Online Knapsack Problem with Removal Cost / Xin Han, Yasushi Kawase and Kazuhisa Makino -- An Improved Exact Algorithm for TSP in Degree-4 Graphs / Mingyu Xiao and Hiroshi Nagamochi -- Dynamic Programming for H-minor-free Graphs / Juanjo Rué, Ignasi Sau and Dimitrios M. Thilikos -- Restricted Max-Min Fair Allocations with Inclusion-Free Intervals / Monaldo Mastrolilli and Georgios Stamoulis -- An Improved Algorithm for Packing T-Paths in Inner Eulerian Networks / Maxim A. Babenko, Kamil Salikhov and Stepan Artamonov -- Towards Optimal and Expressive Kernelization for d-Hitting Set / René van Bevern.
Maximum Number of Minimal Feedback Vertex Sets in Chordal Graphs and Cographs / Jean-François Couturier, Pinar Heggernes, Pim van 't Hof and Yngve Villanger -- A Local Algorithm for Finding Dense Bipartite-Like Subgraphs / Pan Peng -- Algorithms for the Strong Chromatic Index of Halin Graphs, Distance-Hereditary Graphs and Maximal Outerplanar Graphs / Ton Kloks, Sheung-Hung Poon, Chin-Ting Ung and Yue-Li Wang -- On the Minimum Degree Hypergraph Problem with Subset Size Two and the Red-Blue Set Cover Problem with the Consecutive Ones Property / Biing-Feng Wang and Chih-Hsuan Li -- Rainbow Colouring of Split and Threshold Graphs / L. Sunil Chandran and Deepak Rajendraprasad -- Approximating the Rainbow -- Better Lower and Upper Bounds / Alexandru Popa -- Ramsey Numbers for Line Graphs and Perfect Graphs / Rémy Belmonte, Pinar Heggernes, Pim van 't Hof and Reza Saei -- Geodesic Order Types / Oswin Aichholzer, Matias Korman, Alexander Pilz and Birgit Vogtenhuber -- Computing Partitions of Rectilinear Polygons with Minimum Stabbing Number / Stephane Durocher and Saeed Mehrabi -- Monotone Paths in Planar Convex Subdivisions / Adrian Dumitrescu, Günter Rote and Csaba D. Tóth -- The Cost of Bounded Curvature / Hyo-Sil Kim and Otfried Cheong.
Optimally Solving a Transportation Problem Using Voronoi Diagrams / Darius Geiß, Rolf Klein and Rainer Penninger -- Unexplored Steiner Ratios in Geometric Networks / Paz Carmi and Lilach Chaitman-Yerushalmi -- Geometric RAC Simultaneous Drawings of Graphs / Evmorfia Argyriou, Michael Bekos, Michael Kaufmann and Antonios Symvonis -- Simultaneous Embeddings with Vertices Mapping to Pre-specified Points / Taylor Gordon -- Multilevel Drawings of Clustered Graphs / Fabrizio Frati -- Outerplanar Graph Drawings with Few Slopes / Kolja Knauer, Piotr Micek and Bartosz Walczak -- Fáry's Theorem for 1-Planar Graphs / Seok-Hee Hong, Peter Eades, Giuseppe Liotta and Sheung-Hung Poon -- Constant Time Enumeration of Bounded-Size Subtrees in Trees and Its Application / Kunihiro Wasa, Yusaku Kaneta, Takeaki Uno and Hiroki Arimura -- External Memory Soft Heap, and Hard Heap, a Meldable Priority Queue / Alka Bhushan and Sajith Gopalan -- Partially Specified Nearest Neighbor Search / Tomas Hruz and Marcel Schöngens -- Multi-pattern Matching with Bidirectional Indexes / Simon Gog, Kalle Karhu, Juha Kärkkäinen, Veli Mäkinen and Niko Välimäki -- Succinct Representations of Binary Trees for Range Minimum Queries / Pooya Davoodi, Rajeev Raman and Srinivasa Rao Satti.
Lower Bounds against Weakly Uniform Circuits / Ruiwen Chen and Valentine Kabanets -- On TC0 Lower Bounds for the Permanent / Jeff Kinne -- Formula Complexity of Ternary Majorities / Kenya Ueno -- On the Kernelization Complexity of Problems on Graphs without Long Odd Cycles / Fahad Panolan and Ashutosh Rai -- The Complexity of Unary Subset Sum / Nutan Limaye, Meena Mahajan and Karteek Sreenivasaiah -- On the Advice Complexity of Tournaments / Sebastian Ben Daniel -- A Remark on One-Wayness versus Pseudorandomness / Periklis A. Papakonstantinou and Guang Yang -- Integral Mixed Unit Interval Graphs / Van Bang Le and Dieter Rautenbach -- Complementary Vertices and Adjacency Testing in Polytopes / Benjamin A. Burton -- Online Coloring of Bipartite Graphs with and without Advice / Maria Paola Bianchi, Hans-Joachim Böckenhauer, Juraj Hromkovič and Lucia Keller -- Deep Coalescence Reconciliation with Unrooted Gene Trees: Linear Time Algorithms / Paweł Górecki and Oliver Eulenstein -- On the 2-Central Path Problem / Yongding Zhu and Jinhui Xu -- Making Profit in a Prediction Market / Jen-Hou Chou, Chi-Jen Lu and Mu-En Wu -- Computing Shapley Value in Supermodular Coalitional Games / David Liben-Nowell, Alexa Sharp, Tom Wexler and Kevin Woods -- Equilibria of GSP for Range Auction / H.F. Ting and Xiangzhong Xiang -- Stretch in Bottleneck Games / Costas Busch and Rajgopal Kannan.
Record Nr. NYU-004624193
[COCOON 2012 (2012 : Sydney, N.S.W.)]  
Materiale a stampa
Lo trovi qui: New York University
Runtime verification : 4th International Conference, RV 2013, Rennes, France, September 24-27, 2013, proceedings / Axel Legay, Saddek Bensalem (eds.).
Runtime verification : 4th International Conference, RV 2013, Rennes, France, September 24-27, 2013, proceedings / Axel Legay, Saddek Bensalem (eds.).
Creatore [RV (Conference) (4th : 2013 : Rennes, France)]
Estensione 1 online resource (xvii, 426 pages).
Disciplina 005.1/4
Accesso persona Legay, Axel, editor
Bensalem, Saddek, editor
Genere/Forma Electronic books
Conference papers and proceedings
Ebook
Soggetto non controllato Computer science
Software engineering
Computer software
Algorithm Analysis and Problem Complexity
Logics and Meanings of Programs
Programming Languages, Compilers, Interpreters
Mathematical Logic and Formal Languages
ISBN 9783642407871
3642407870
3642407862
9783642407864
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Invited Paper. Executing Specifications Using Synthesis and Constraint Solving / Viktor Kuncak, Etienne Kneuss and Philippe Suter -- Regular Papers. Informative Types and Effects for Hybrid Migration Control / Ana Almeida Matos and Jan Cederquist -- Monitoring of Temporal First-Order Properties with Aggregations / David Basin [and others] -- From Propositional to First-Order Monitoring / Andreas Bauer, Jan-Christoph Küster and Gil Vegliach -- Right-Universality of Visibly Pushdown Automata / Véronique Bruyère, Marc Ducobu and Olivier Gauwin -- Distributed Finite-State Runtime Monitoring with Aggregated Events / Kevin Falzon, Eric Bodden and Rahul Purandare -- Synthesising Correct Concurrent Runtime Monitors / Adrian Francalanza and Aldrin Seychell -- Practical Interruptible Conversations / Raymond Hu [and others] -- Runtime Verification with Particle Filtering / Kenan Kalajdzic [and others] -- An Optimized Memory Monitoring for Runtime Assertion Checking of C Programs / Nikolai Kosmatov, Guillaume Petiot and Julien Signoles.
Impartiality and Anticipation for Monitoring of Visibly Context-Free Properties / Normann Decker, Martin Leucker and Daniel Thoma -- Accelerating Data Race Detection Utilizing On-Chip Data-Parallel Cores / Vineeth Mekkat, Anup Holey and Antonia Zhai -- Efficient Model to Query and Visualize the System States Extracted from Trace Data / Alexandre Montplaisir [and others] -- Repair Abstractions for More Efficient Data Structure Repair / Razieh Nokhbeh Zaeem, Muhammad Zubair Malik and Sarfraz Khurshid -- To Run What No One Has Run Before: Executing an Intermediate Verification Language / Nadia Polikarpova, Carlo A. Furia and Scott West -- Optimizing Nop-shadows Typestate Analysis by Filtering Interferential Configurations / Chengsong Wang, Zhenbang Chen and Xiaoguang Mao -- A Causality Analysis Framework for Component-Based Real-Time Systems / Shaohui Wang [and others] -- Reducing Monitoring Overhead by Integrating Event- and Time-Triggered Techniques / Chun Wah Wallace Wu [and others].
Short Papers. A Scala DSL for Rete-Based Runtime Verification / Klaus Havelund -- A Late Treatment of C Precondition in Dynamic Symbolic Execution Testing Tools / Mickaël Delahaye and Nikolai Kosmatov -- Towards a Generic Non-intrusive Fault Detection Framework / Jukka Julku and Mika Rautila -- A Witnessing Compiler: A Proof of Concept / Kedar S. Namjoshi, Giacomo Tagliabue and Lenore D. Zuck -- Runtime Monitoring of Temporal Logic Properties in a Platform Game / Simon Varvaressos [and others] -- Tool Papers. SMock -- A Test Platform for Monitoring Tools / Christian Colombo, Ruth Mizzi and Gordon J. Pace -- SPY: Local Verification of Global Protocols / Rumyana Neykova, Nobuko Yoshida and Raymond Hu -- Tutorials. Instrumenting Android and Java Applications as Easy as abc / Steven Arzt, Siegfried Rasthofer and Eric Bodden -- On Signal Temporal Logic / Alexandre Donzé -- Runtime Verification and Refutation for Biological Systems / Hillel Kugler -- A Lesson on Runtime Assertion Checking with Frama-C / Nikolai Kosmatov and Julien Signoles -- With Real-Time Performance Analysis and Monitoring to Timing Predictable Use of Multi-core Architectures / Kai Lampka -- Dynamic Analysis and Debugging of Binary Code for Security Applications / Lixin Li and Chao Wang.
Record Nr. NYU-004664238
[RV (Conference) (4th : 2013 : Rennes, France)]  
Materiale a stampa
Lo trovi qui: New York University
The nature of computation : logic, algorithms, applications : 9th Conference on Computability in Europe, CiE 2013, Milan, Italy, July 1-5, 2013. Proceedings / Paola Bonizzoni, Vasco Brattka, Benedikt Löwe (eds.).
The nature of computation : logic, algorithms, applications : 9th Conference on Computability in Europe, CiE 2013, Milan, Italy, July 1-5, 2013. Proceedings / Paola Bonizzoni, Vasco Brattka, Benedikt Löwe (eds.).
Creatore [Conference on Computability in Europe (9th : 2013 : Milan, Italy)]
Estensione 1 online resource.
Disciplina 511.3/52
Accesso persona Bonizzoni, Paola
Brattka, Vasco, 1966-
Löwe, Benedikt
Genere/Forma Electronic books
Conference papers and proceedings
Ebook
Congresses
Soggetto non controllato Computer science
Computer software
Logic design
Computational complexity
Logic, Symbolic and mathematical
Computation by Abstract Devices
Algorithm Analysis and Problem Complexity
Discrete Mathematics in Computer Science
Math Applications in Computer Science
Mathematical Logic and Foundations
ISBN 9783642390531
3642390536
3642390528
9783642390524
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Real Benefit of Promises and Advice / Klaus Ambos-Spies, Ulrike Brandt -- Computability and Computational Complexity of the Evolution of Nonlinear Dynamical Systems / Olivier Bournez, Daniel S. Graça -- An Overview of Genomic Distances Modeled with Indels / Marília D.V. Braga -- Noise versus Computational Intractability in Dynamics / Mark Braverman -- Cluster Editing / Sebastian Böcker -- Beyond Rogers' Non-constructively Computable Function / John Case, Michael Ralston -- Constructing Continuous Systems from Discrete Cellular Automata / Julien Cervelle -- Latency-Bounded Target Set Selection in Social Networks / Ferdinando Cicalese, Gennaro Cordasco -- Summary Data Structures for Massive Data / Graham Cormode -- Determinant versus Permanent: Salvation via Generalization? / Nicolas de Rugy-Altherre -- Aligning and Labeling Genomes under the Duplication-Loss Model / Riccardo Dondi, Nadia El-Mabrouk -- Irrationality Is Needed to Compute with Signal Machines with Only Three Speeds / Jérôme Durand-Lose.
Language Forbidding-Enforcing Systems Defining DNA Codewords / Daniela Genova -- Computing K-Trivial Sets by Incomplete Random Sets / Noam Greenberg -- Cardinal-Recognizing Infinite Time Turing Machines / Miha E. Habič -- 'Stored Program Concept' Considered Harmful: History and Historiography / Thomas Haigh -- The Complexity of Interior Point Methods for Solving Discounted Turn-Based Stochastic Games / Thomas Dueholm Hansen, Rasmus Ibsen-Jensen -- The Computation of Nature, Or: Does the Computer Drive Science and Technology? / Ulf Hashagen -- Negative Glues and Non-determinism in Nanocomputations by Self-assembly / Lila Kari -- Structures without Scattered-Automatic Presentation / Alexander Kartzow, Philipp Schlicht -- Some Classes of Generalised Communicating P Systems and Simple Kernel P Systems / Shankara Narayanan Krishna, Marian Gheorghe -- Closed Choice for Finite and for Convex Sets / Stéphane Le Roux, Arno Pauly -- Realizability Models Separating Various Fan Theorems / Robert S. Lubarsky, Michael Rathjen -- Towards a Theory of Homomorphic Compression / Andrew McGregor -- The Classification Problem for Compact Computable Metric Spaces / Alexander G. Melnikov, André Nies.
Processes Inspired by the Functioning of Living Cells: Natural Computing Approach / Andrzej Ehrenfeucht, Grzegorz Rozenberg -- Recent Developments in Collective Decision Making in Combinatorial Domains / Ulle Endriss -- Software Streams: Big Data Challenges in Dynamic Program Analysis / Irene Finocchi -- On λ-Definable Functions on Ordinals / Tim Fischbach, Benjamin Seyfferth -- A Personal View of the P versus NP Problem / Lance Fortnow -- An Investigation on Genomic Repeats / Giuditta Franco, Alessio Milanese -- Local Computability for Ordinals / Johanna N.Y. Franklin, Asher M. Kach -- A Note on the Sequential Version of Π12 Statements / Makoto Fujiwara, Keita Yokoyama -- On Conservative Learning of Recursively Enumerable Languages / Ziyuan Gao, Sanjay Jain, Frank Stephan -- Topology of Asymptotic Cones and Non-deterministic Polynomial Time Computations / Anthony Gasperin -- On Decidable and Computable Models of Theories / Alexander Gavruskin, Bakhadyr Khoussainov -- Discovering Hidden Repetitions in Words / Paweł Gawrychowski, Florin Manea.
Exploiting Co-evolution across Protein Families for Predicting Native Contacts and Protein-Protein Interaction Surfaces / Andrea Pagnani -- A Compositional Semantics of Reaction Systems with Restriction / Giovanni Pardini, Roberto Barbuti -- Using Random Graphs in Population Genomics / Laxmi Parida -- The Tarski-Lindenbaum Algebra of the Class of All Strongly Constructivizable Countable Saturated Models / Mikhail G. Peretyat'kin -- The Burrows-Wheeler Transform between Data Compression and Combinatorics on Words / Giovanna Rosone, Marinella Sciortino -- A Note on ω-Jump Inversion of Degree Spectra of Structures / Ivan N. Soskov -- The Turing Universe in the Context of Enumeration Reducibility / Mariya I. Soskova -- Computing Game Strategies / Darko Stefanovic, Milan N. Stojanovic -- On Processes and Structures / Alexey Stukachev -- Various Regularity Lemmas in Graphs and Hypergraphs / Endre Szemerédi -- Three Debates about Computing / Matti Tedre -- Another Jump Inversion Theorem for Structures / Stefan Vatev -- On Algorithmic Strong Sufficient Statistics / Nikolay Vereshchagin -- Analytic Root Clustering: A Complete Algorithm Using Soft Zero Tests / Chee Yap, Michael Sagraloff, Vikram Sharma.
Record Nr. NYU-004638948
[Conference on Computability in Europe (9th : 2013 : Milan, Italy)]  
Materiale a stampa
Lo trovi qui: New York University
Privacy enhancing technologies : 13th international symposium, PETS 2013, Bloomington, IN, USA, July 10-12, 2013, proceedings / Emiliano De Cristofaro, Matthew Wright (eds.).
Privacy enhancing technologies : 13th international symposium, PETS 2013, Bloomington, IN, USA, July 10-12, 2013, proceedings / Emiliano De Cristofaro, Matthew Wright (eds.).
Creatore [PETS (Symposium) (13th : 2013 : Bloomington, Ind.)]
Estensione 1 online resource (x, 264 pages) : illustrations.
Disciplina 005.8
Accesso persona De Cristofaro, Emiliano, editor
Wright, Matthew (Computer scientist), editor
Genere/Forma Electronic books
Conference papers and proceedings
Ebook
Congresses
Soggetto non controllato Computer science
Computer Communication Networks
Data protection
Data encryption (Computer science)
Computer software
Information Systems
Systems and Data Security
Management of Computing and Information Systems
Computers and Society
Algorithm Analysis and Problem Complexity
ISBN 9783642390777
3642390773
9783642390760
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Optimizing ORAM and Using It Efficiently for Secure Computation / Craig Gentry, Kenny A. Goldman, Shai Halevi -- Anonymity-Preserving Public-Key Encryption: A Constructive Approach / Markulf Kohlweiss, Ueli Maurer, Cristina Onete -- Efficient E-Cash in Practice: NFC-Based Payments for Public Transportation Systems / Gesine Hinterwälder, Christian T. Zenger -- Efficient Privacy-Preserving Stream Aggregation in Mobile Sensing with Low Aggregation Error / Qinghua Li, Guohong Cao -- Broadening the Scope of Differential Privacy Using Metrics / Konstantinos Chatzikokolakis, Miguel E. Andrés -- Turning Off GPS Is Not Enough: Cellular Location Leaks over the Internet / Hamed Soroush, Keen Sung, Erik Learned-Miller -- How Others Compromise Your Location Privacy: The Case of Shared Public IPs at Hotspots / Nevena Vratonjic, Kévin Huguenin, Vincent Bindschaedler -- The Path Less Travelled: Overcoming Tor's Bottlenecks with Traffic Splitting / Mashael AlSabah, Kevin Bauer, Tariq Elahi, Ian Goldberg -- How Low Can You Go: Balancing Performance with Anonymity in Tor / John Geddes, Rob Jansen, Nicholas Hopper -- OSS: Using Online Scanning Services for Censorship Circumvention / David Fifield, Gabi Nakibly, Dan Boneh -- The Need for Flow Fingerprints to Link Correlated Network Flows / Amir Houmansadr, Nikita Borisov -- How Much Is Too Much? Leveraging Ads Audience Estimation to Evaluate Public Profile Uniqueness / Terence Chen, Abdelberi Chaabane, Pierre Ugo Tournoux -- On the Acceptance of Privacy-Preserving Authentication Technology: The Curious Case of National Identity Cards / Marian Harbach, Sascha Fahl, Matthias Rieger.
Record Nr. NYU-004638983
[PETS (Symposium) (13th : 2013 : Bloomington, Ind.)]  
Materiale a stampa
Lo trovi qui: New York University
Theory and applications of satisfiability testing-- SAT 2012 : 15th International Conference, Trento, Italy, June 17-20, 2012. Proceedings / Alessandro Cimatti, Roberto Sebastiani (eds.).
Theory and applications of satisfiability testing-- SAT 2012 : 15th International Conference, Trento, Italy, June 17-20, 2012. Proceedings / Alessandro Cimatti, Roberto Sebastiani (eds.).
Creatore [SAT 2012 (2012 : Trento, Italy)]
Estensione 1 online resource.
Disciplina 005.1
Accesso persona Cimatti, Alessandro
Sebastiani, R. (Roberto)
Genere/Forma Electronic books
Conference papers and proceedings
Soggetto non controllato Computer science
Computer software
Logic design
Artificial intelligence
Logics and Meanings of Programs
Computation by Abstract Devices
Algorithm Analysis and Problem Complexity
Mathematical Logic and Formal Languages
Information and Communication, Circuits
ISBN 9783642316128
3642316123
3642316115
9783642316111
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Understanding IC3 / Aaron R. Bradley -- Satisfiability and The Art of Computer Programming / Donald Knuth -- Choosing Probability Distributions for Stochastic Local Search and the Role of Make versus Break / Adrian Balint and Uwe Schöning -- Off the Trail: Re-examining the CDCL Algorithm / Alexandra Goultiaeva and Fahiem Bacchus -- An Improved Separation of Regular Resolution from Pool Resolution and Clause Learning / Maria Luisa Bonet and Sam Buss -- Computing Resolution-Path Dependencies in Linear Time, / Friedrich Slivovsky and Stefan Szeider -- Strong Backdoors to Nested Satisfiability / Serge Gaspers and Stefan Szeider -- Extended Failed-Literal Preprocessing for Quantified Boolean Formulas / Allen Van Gelder, Samuel B. Wood and Florian Lonsing -- On Sequent Systems and Resolution for QBFs / Uwe Egly -- Solving QBF with Counterexample Guided Refinement / Mikoláš Janota, William Klieber, Joao Marques-Silva and Edmund Clarke -- Henkin Quantifiers and Boolean Formulae / Valeriy Balabanov, Hui-Ju Katherine Chiang and Jie-Hong Roland Jiang -- Lynx: A Programmatic SAT Solver for the RNA-Folding Problem / Vijay Ganesh, Charles W. O'Donnell, Mate Soos, Srinivas Devadas and Martin C. Rinard, et al. -- Generalized Property Directed Reachability / Kryštof Hoder and Nikolaj Bjørner -- SMT-Aided Combinatorial Materials Discovery / Stefano Ermon, Ronan Le Bras, Carla P. Gomes, Bart Selman and R. Bruce van Dover -- Faulty Interaction Identification via Constraint Solving and Optimization / Jian Zhang, Feifei Ma and Zhiqiang Zhang.
Revisiting Clause Exchange in Parallel SAT Solving / Gilles Audemard, Benoît Hoessen, Saïd Jabbour, Jean-Marie Lagniez and Cédric Piette -- Designing Scalable Parallel SAT Solvers / Antti E.J. Hyvärinen and Norbert Manthey -- Evaluating Component Solver Contributions to Portfolio-Based Algorithm Selectors / Lin Xu, Frank Hutter, Holger Hoos and Kevin Leyton-Brown -- Efficient SAT Solving under Assumptions / Alexander Nadel and Vadim Ryvchin -- Preprocessing in Incremental SAT / Alexander Nadel, Vadim Ryvchin and Ofer Strichman -- On Davis-Putnam Reductions for Minimally Unsatisfiable Clause-Sets / Oliver Kullmann and Xishun Zhao -- Improvements to Core-Guided Binary Search for MaxSAT / Antonio Morgado, Federico Heras and Joao Marques-Silva -- On Efficient Computation of Variable MUSes / Anton Belov, Alexander Ivrii, Arie Matsliah and Joao Marques-Silva -- Interpolant Strength Revisited / Georg Weissenbacher -- Exponential Lower Bounds for DPLL Algorithms on Satisfiable Random 3-CNF Formulas / Dimitris Achlioptas and Ricardo Menchaca-Mendez -- Parameterized Complexity of Weighted Satisfiability Problems / Nadia Creignou and Heribert Vollmer -- Fixed-Parameter Tractability of Satisfying beyond the Number of Variables / Robert Crowston, Gregory Gutin, Mark Jones, Venkatesh Raman and Saket Saurabh, et al. -- Finding Efficient Circuits for Ensemble Computation / Matti Järvisalo, Petteri Kaski, Mikko Koivisto and Janne H. Korhonen -- Conflict-Driven XOR-Clause Learning / Tero Laitinen, Tommi Junttila and Ilkka Niemelä.
Perfect Hashing and CNF Encodings of Cardinality Constraints / Yael Ben-Haim, Alexander Ivrii, Oded Margalit and Arie Matsliah -- The Community Structure of SAT Formulas / Carlos Ansótegui, Jesús Giráldez-Cru and Jordi Levy -- SATLab: X-Raying Random k-SAT (Tool Presentation) / Thomas Hugel -- Resolution-Based Certificate Extraction for QBF (Tool Presentation) / Aina Niemetz, Mathias Preiner, Florian Lonsing, Martina Seidl and Armin Biere -- Coprocessor 2.0 -- A Flexible CNF Simplifier (Tool Presentation) / Norbert Manthey -- SMT-RAT: An SMT-Compliant Nonlinear Real Arithmetic Toolbox (Tool Presentation) / Florian Corzilius, Ulrich Loup, Sebastian Junges and Erika Ábrahám -- CoPAn: Exploring Recurring Patterns in Conflict Analysis of CDCL SAT Solvers (Tool Presentation) / Stephan Kottler, Christian Zielke, Paul Seitz and Michael Kaufmann -- Azucar: A SAT-Based CSP Solver Using Compact Order Encoding (Tool Presentation) / Tomoya Tanjo, Naoyuki Tamura and Mutsunori Banbara -- SatX10: A Scalable Plug & Play Parallel SAT Framework (Tool Presentation) / Bard Bloom, David Grove, Benjamin Herta, Ashish Sabharwal and Horst Samulowitz, et al. -- Improved Single Pass Algorithms for Resolution Proof Reduction (Poster Presentation) / Ashutosh Gupta -- Creating Industrial-Like SAT Instances by Clustering and Reconstruction (Poster Presentation) / Sebastian Burg, Stephan Kottler and Michael Kaufmann -- Incremental QBF Preprocessing for Partial Design Verification (Poster Presentation) / Paolo Marin, Christian Miller and Bernd Becker -- Concurrent Cube-and-Conquer (Poster Presentation) / Peter van der Tak, Marijn J.H. Heule and Armin Biere.
Satisfying versus Falsifying in Local Search for Satisfiability (Poster Presentation) / Chu Min Li and Yu Li -- Exploiting Historical Relationships of Clauses and Variables in Local Search for Satisfiability (Poster Presentation) / Chu Min Li, Wanxia Wei and Yu Li -- Towards Massively Parallel Local Search for SAT (Poster Presentation) / Alejandro Arbelaez and Philippe Codognet -- Optimizing MiniSAT Variable Orderings for the Relational Model Finder Kodkod (Poster Presentation) / Markus Iser, Mana Taghdiri and Carsten Sinz -- A Cardinality Solver: More Expressive Constraints for Free (Poster Presentation) / Mark H. Liffiton and Jordyn C. Maglalang -- Single-Solver Algorithms for 2QBF (Poster Presentation) / Sam Bayless and Alan J. Hu -- An Efficient Method for Solving UNSAT 3-SAT and Similar Instances via Static Decomposition (Poster Presentation) / Emir Demirović and Haris Gavranović -- Intensification Search in Modern SAT Solvers (Poster Presentation) / Saïd Jabbour, Jerry Lonlac and Lakhdar Saïs -- Using Term Rewriting to Solve Bit-Vector Arithmetic Problems (Poster Presentation) / Iago Abal, Alcino Cunha, Joe Hurd and Jorge Sousa Pinto -- Learning Polynomials over GF(2) in a SAT Solver (Poster Presentation) / George Katsirelos and Laurent Simon -- Learning Back-Clauses in SAT (Poster Presentation) / Ashish Sabharwal, Horst Samulowitz and Meinolf Sellmann -- Augmenting Clause Learning with Implied Literals (Poster Presentation) / Arie Matsliah, Ashish Sabharwal and Horst Samulowitz.
Record Nr. NYU-004623303
[SAT 2012 (2012 : Trento, Italy)]  
Materiale a stampa
Lo trovi qui: New York University
Automata, Languages, and Programming [electronic resource] : 39th International Colloquium, ICALP 2012, Warwick, UK, July 9-13, 2012, Proceedings. Part I / Artur Czumaj...[et al.] (eds.).
Automata, Languages, and Programming [electronic resource] : 39th International Colloquium, ICALP 2012, Warwick, UK, July 9-13, 2012, Proceedings. Part I / Artur Czumaj...[et al.] (eds.).
Creatore [International Colloquium on Automata, Languages, and Programming (39th : 2012 : Warwick, England)]
Estensione 1 online resource.
Disciplina 005.1/3
Accesso persona Czumaj, Artur
Genere/Forma Electronic books
Conference papers and proceedings
Soggetto non controllato Computer science
Computer Communication Networks
Computer software
Computational complexity
Information storage and retrieval systems
Algorithm Analysis and Problem Complexity
Computation by Abstract Devices
Information Storage and Retrieval
Discrete Mathematics in Computer Science
ISBN 9783642315947 (electronic bk.)
3642315941 (electronic bk.)
9783642315930
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Unsatisfiability Bounds for Random CSPs from an Energetic Interpolation Method / Dimitris Achlioptas and Ricardo Menchaca-Mendez -- The NOF Multiparty Communication Complexity of Composed Functions / Anil Ada, Arkadev Chattopadhyay, Omar Fawzi and Phuong Nguyen -- Quantum Strategies Are Better Than Classical in Almost Any XOR Game / Andris Ambainis, Artūrs Bačkurs, Kaspars Balodis, Dmitrijs Kravčenko and Raitis Ozols, et al. -- Efficient Submodular Function Maximization under Linear Packing Constraints / Yossi Azar and Iftah Gamzu -- Polynomial-Time Isomorphism Test for Groups with No Abelian Normal Subgroups (Extended Abstract) / László Babai, Paolo Codenotti and Youming Qiao -- Clustering under Perturbation Resilience / Maria Florina Balcan and Yingyu Liang -- Secretary Problems with Convex Costs / Siddharth Barman, Seeun Umboh, Shuchi Chawla and David Malec -- Nearly Simultaneously Resettable Black-Box Zero Knowledge / Joshua Baron, Rafail Ostrovsky and Ivan Visconti -- Complexity of Complexity and Maximal Plain versus Prefix-Free Kolmogorov Complexity / Bruno Bauwens -- On Quadratic Programming with a Ratio Objective / Aditya Bhaskara, Moses Charikar, Rajsekar Manokaran and Aravindan Vijayaraghavan -- De-amortizing Binary Search Trees / Prosenjit Bose, Sébastien Collette, Rolf Fagerberg and Stefan Langerman -- Efficient Sampling Methods for Discrete Distributions / Karl Bringmann and Konstantinos Panagiotou -- Approximation Algorithms for Online Weighted Rank Function Maximization under Matroid Constraints / Niv Buchbinder, Joseph (Seffi) Naor, R. Ravi and Mohit Singh -- Improved LP-Rounding Approximation Algorithm for k-level Uncapacitated Facility Location / Jaroslaw Byrka and Bartosz Rybicki -- Testing Coverage Functions / Deeparnab Chakrabarty and Zhiyi Huang -- Sparse Fault-Tolerant Spanners for Doubling Metrics with Bounded Hop-Diameter or Degree / T. -H. Hubert Chan, Mingfei Li and Li Ning --
A Dependent LP-Rounding Approach for the k-Median Problem / Moses Charikar and Shi Li -- Node-Weighted Network Design in Planar and Minor-Closed Families of Graphs / Chandra Chekuri, Alina Ene and Ali Vakilian -- Computing the Visibility Polygon of an Island in a Polygonal Domain / Danny Z. Chen and Haitao Wang -- Directed Subset Feedback Vertex Set Is Fixed-Parameter Tractable / Rajesh Chitnis, Marek Cygan, Mohammadtaghi Hajiaghayi and Dániel Marx -- Max-Cut Parameterized above the Edwards-Erdős Bound / Robert Crowston, Mark Jones and Matthias Mnich -- Clique Cover and Graph Separation: New Incompressibility Results / Marek Cygan, Stefan Kratsch, Marcin Pilipczuk, Michał Pilipczuk and Magnus Wahlström -- The Inverse Shapley Value Problem / Anindya De, Ilias Diakonikolas and Rocco Servedio -- Zero-One Rounding of Singular Vectors / Amit Deshpande, Ravindran Kannan and Nikhil Srivastava -- Label Cover Instances with Large Girth and the Hardness of Approximating Basic k-Spanner / Michael Dinitz, Guy Kortsarz and Ran Raz -- Space-Constrained Interval Selection / Yuval Emek, Magnús M. Halldórsson and Adi Rosén -- Polynomial Time Algorithms for Branching Markov Decision Processes and Probabilistic Min(Max) Polynomial Bellman Equations / Kousha Etessami, Alistair Stewart and Mihalis Yannakakis -- Succinct Indices for Range Queries with Applications to Orthogonal Range Maxima / Arash Farzan, J. Ian Munro and Rajeev Raman -- Universal Factor Graphs / Uriel Feige and Shlomo Jozeph -- Parameterized Approximation via Fidelity Preserving Transformations / Michael R. Fellows, Ariel Kulik, Frances Rosamond and Hadas Shachnai -- Backdoors to Acyclic SAT / Serge Gaspers and Stefan Szeider -- Dominators, Directed Bipolar Orders, and Independent Spanning Trees / Loukas Georgiadis and Robert E. Tarjan -- Hardness of Approximation for Quantum Problems / Sevag Gharibian and Julia Kempe --
The Complexity of Computing the Sign of the Tutte Polynomial (and Consequent #P-hardness of Approximation) / Leslie Ann Goldberg and Mark Jerrum -- Stochastic Vehicle Routing with Recourse / Inge Li Gørtz, Viswanath Nagarajan and Rishi Saket -- The Online Metric Matching Problem for Doubling Metrics / Anupam Gupta and Kevin Lewi -- Approximating Sparse Covering Integer Programs Online / Anupam Gupta and Viswanath Nagarajan -- Streaming and Communication Complexity of Clique Approximation / Magnús M. Halldórsson, Xiaoming Sun, Mario Szegedy and Chengu Wang -- Distributed Private Heavy Hitters / Justin Hsu, Sanjeev Khanna and Aaron Roth -- A Thirty Year Old Conjecture about Promise Problems / Andrew Hughes, A. Pavan, Nathan Russell and Alan Selman -- Minimum Latency Submodular Cover / Sungjin Im, Viswanath Nagarajan and Ruben van der Zwaan -- Constant-Time Algorithms for Sparsity Matroids / Hiro Ito, Shin-Ichi Tanigawa and Yuichi Yoshida -- CRAM: Compressed Random Access Memory / Jesper Jansson, Kunihiko Sadakane and Wing-Kin Sung -- Improving Quantum Query Complexity of Boolean Matrix Multiplication Using Graph Collision / Stacey Jeffery, Robin Kothari and Frédéric Magniez -- Faster Fully Compressed Pattern Matching by Recompression / Artur Jeż -- NNS Lower Bounds via Metric Expansion for l∞ and EMD / Michael Kapralov and Rina Panigrahy -- Quantum Adversary (Upper) Bound / Shelby Kimmel -- Solving Planar k-Terminal Cut in O(nc Ök)O(nck) Time / Philip N. Klein and Dániel Marx -- Fixed-Parameter Tractability of Multicut in Directed Acyclic Graphs / Stefan Kratsch, Marcin Pilipczuk, Michał Pilipczuk and Magnus Wahlström -- Preserving Terminal Distances Using Minors / Robert Krauthgamer and Tamar Zondiner -- A Rounding by Sampling Approach to the Minimum Size k-Arc Connected Subgraph Problem / Bundit Laekhanukit, Shayan Oveis Gharan and Mohit Singh --
Classical and Quantum Partition Bound and Detector Inefficiency / Sophie Laplante, Virginie Lerays and Jérémie Roland -- Testing Similar Means / Reut Levi, Dana Ron and Ronitt Rubinfeld -- The Parameterized Complexity of k-Edge Induced Subgraphs / Bingkai Lin and Yijia Chen -- Converting Online Algorithms to Local Computation Algorithms / Yishay Mansour, Aviad Rubinstein, Shai Vardi and Ning Xie -- Assigning Sporadic Tasks to Unrelated Parallel Machines / Alberto Marchetti-Spaccamela, Cyriel Rutten, Suzanne van der Ster and Andreas Wiese -- A Tight Lower Bound for Planar Multiway Cut with Fixed Number of Terminals / Dániel Marx -- The Power of Recourse for Online MST and TSP / Nicole Megow, Martin Skutella, José Verschae and Andreas Wiese -- Geometry of Online Packing Linear Programs / Marco Molinaro and R. Ravi -- Self-assembly with Geometric Tiles / Bin Fu, Matthew J. Patitz, Robert T. Schweller and Robert Sheline -- Quasi-polynomial Local Search for Restricted Max-Min Fair Allocation / Lukas Polacek and Ola Svensson -- Strictly-Black-Box Zero-Knowledge and Efficient Validation of Financial Transactions / Michael O. Rabin, Yishay Mansour, S. Muthukrishnan and Moti Yung -- Parameterized Tractability of Multiway Cut with Parity Constraints / Daniel Lokshtanov and M. S. Ramanujan -- Set Cover Revisited: Hypergraph Cover with Hard Capacities / Barna Saha and Samir Khuller -- On the Limits of Sparsification / Rahul Santhanam and Srikanth Srinivasan -- Certifying 3-Connectivity in Linear Time / Jens M. Schmidt -- Epsilon-Net Method for Optimizations over Separable States / Yaoyun Shi and Xiaodi Wu -- Faster Algorithms for Privately Releasing Marginals / Justin Thaler, Jonathan Ullman and Salil Vadhan -- Stochastic Matching with Commitment / Kevin P. Costello, Prasad Tetali and Pushkar Tripathi -- Rademacher-Sketch: A Dimensionality-Reducing Embedding for Sum-Product Norms, with an Application to Earth-Mover Distance / Elad Verbin and Qin Zhang -- A Matrix Hyperbolic Cosine Algorithm and Applications / Anastasios Zouzias.
Record Nr. NYU-004623405
[International Colloquium on Automata, Languages, and Programming (39th : 2012 : Warwick, England)]  
Materiale a stampa
Lo trovi qui: New York University
Privacy enhancing technologies : 12th International Symposium, PETS 2012, Vigo, Spain, July 11-13, 2012. Proceedings / Simone Fischer-Hübner, Matthew Wright (eds.).
Privacy enhancing technologies : 12th International Symposium, PETS 2012, Vigo, Spain, July 11-13, 2012. Proceedings / Simone Fischer-Hübner, Matthew Wright (eds.).
Creatore [PETS (Symposium) (12th : 2012 : Vigo, Spain)]
Estensione 1 online resource (x, 318 pages) : illustrations.
Disciplina 005.8
Accesso persona Fischer-Hübner, Simone
Wright, Matthew (Computer scientist)
Genere/Forma Electronic books
Conference papers and proceedings
Soggetto non controllato Computer science
Computer Communication Networks
Data protection
Data encryption (Computer science)
Computer software
Information Systems
Systems and Data Security
Management of Computing and Information Systems
Computers and Society
Algorithm Analysis and Problem Complexity
ISBN 9783642316807
3642316808
3642316794
9783642316791
Classificazione 54.62
54.69
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Betrayed by Your Ads! Reconstructing User Profiles from Targeted Ads / Claude Castelluccia, Mohamed-Ali Kaafar and Minh-Dung Tran -- Private Client-Side Profiling with Random Forests and Hidden Markov Models / George Danezis, Markulf Kohlweiss, Benjamin Livshits and Alfredo Rial -- Understanding Statistical Disclosure: A Least Squares Approach / Fernando Pérez-González and Carmela Troncoso -- Website Detection Using Remote Traffic Analysis / Xun Gong, Nikita Borisov, Negar Kiyavash and Nabil Schear -- k-Indistinguishable Traffic Padding in Web Applications / Wen Ming Liu, Lingyu Wang, Kui Ren, Pengsu Cheng and Mourad Debbabi -- Spying in the Dark: TCP and Tor Traffic Analysis / Yossi Gilad and Amir Herzberg -- Secure Distributed Framework for Achieving & epsilon;-Differential Privacy / Dima Alhadidi, Noman Mohammed, Benjamin C.M. Fung and Mourad Debbabi -- Differentially Private Continual Monitoring of Heavy Hitters from Distributed Streams / T. -H. Hubert Chan, Mingfei Li, Elaine Shi and Wenchang Xu -- Adaptive Differentially Private Histogram of Low-Dimensional Data / Chengfang Fang and Ee-Chien Chang -- PRISM -- Privacy-Preserving Search in MapReduce / Erik-Oliver Blass, Roberto Di Pietro, Refik Molva and Melek Önen -- Practical Privacy Preserving Cloud Resource-Payment for Constrained Clients / Martin Pirker, Daniel Slamanig and Johannes Winter -- Fault-Tolerant Privacy-Preserving Statistics / Marek Jawurek and Florian Kerschbaum -- Evading Censorship with Browser-Based Proxies / David Fifield, Nate Hardison, Jonathan Ellithorpe, Emily Stark and Dan Boneh, et al. -- Exploring the Ecosystem of Referrer-Anonymizing Services / Nick Nikiforakis, Steven Van Acker, Frank Piessens and Wouter Joosen -- Risk Communication Design: Video vs. Text / Vaibhav Garg, L. Jean Camp, Katherine Connelly and Lesa Lorenzen-Huber -- Use Fewer Instances of the Letter "i": Toward Writing Style Anonymization / Andrew W.E. McDonald, Sadia Afroz, Aylin Caliskan, Ariel Stolerman and Rachel Greenstadt.
Record Nr. NYU-004623487
[PETS (Symposium) (12th : 2012 : Vigo, Spain)]  
Materiale a stampa
Lo trovi qui: New York University
Pattern recognition : 4th Mexican Conference, MCPR 2012, Huatulco, Mexico, June 27-30, 2012. Proceedings / edited by Jesús Ariel Carrasco-Ochoa [and others]
Pattern recognition : 4th Mexican Conference, MCPR 2012, Huatulco, Mexico, June 27-30, 2012. Proceedings / edited by Jesús Ariel Carrasco-Ochoa [and others]
Creatore [Mexican Conference on Pattern Recognition (4th : 2012 : Santa María Huatulco, Mexico)]
Estensione 1 online resource (xiv, 346 pages) : illustrations.
Disciplina 006.3
Accesso persona Carrasco Ochoa, Jesús Ariel
Genere/Forma Electronic books
Conference papers and proceedings
Soggetto non controllato Computer science
Computer software
Data mining
Artificial intelligence
Computer vision
Optical pattern recognition
Pattern Recognition
Image Processing and Computer Vision
Information Systems Applications (incl. Internet)
Algorithm Analysis and Problem Complexity
ISBN 9783642311499
3642311490
9783642311482
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto From Linear Representations to Object Parts / Gabriella Sanniti di Baja, L. Serino and Carlo Arcelli -- Perceptual Grouping Using Superpixels / Sven J. Dickinson, Alex Levinshtein and Cristian Sminchisescu -- Automatic Design of Artificial Neural Networks and Associative Memories for Pattern Classification and Pattern Restoration / Humberto Sossa, Beatriz A. Garro, Juan Villegas, Carlos Avilés and Gustavo Olague -- An Automatic Image Scaling Up Algorithm / Maria Frucci, Carlo Arcelli and Gabriella Sanniti di Baja -- Sampling Techniques for Monte Carlo Matrix Multiplication with Applications to Image Processing / Humberto Madrid, Valia Guerra and Marielba Rojas -- Extended Photometric Sampling for Surface Shape Recovery / Felipe Hernández-Rodríguez and Mario Castelán -- A Segmentation Method for Tree Crown Detection and Modelling from LiDAR Measurements / José Luis Silván-Cárdenas -- Texture Analysis for Skin Probability Maps Refinement / Michal Kawulok -- Composite Correlation Filters for Detection of Geometrically Distorted Objects Using Noisy Training Images / Pablo M. Aguilar-González and Vitaly Kober -- Adaptive Spatial Concealment of Damaged Coded Images / Alejandro A. Ramírez-Acosta, Mireya S. García-Vázquez and Mariko Nakano -- Human Sign Recognition for Robot Manipulation / Leonardo Saldivar-Piñon, Mario I. Chacon-Murguia, Rafael Sandoval-Rodriguez and Javier Vega-Pineda -- Fuzzy Sets for Human Fall Pattern Recognition / Marina V. Sokolova and Antonio Fernández-Caballero -- Vision System for 3D Reconstruction with Telecentric Lens / José Guadalupe Rico Espino, José-Joel Gonzalez-Barbosa, Roberto Augusto Gómez Loenzo, Diana Margarita Córdova Esparza and Ricardo Gonzalez-Barbosa -- A Tool for Hand-Sign Recognition / David J. Rios Soria and Satu Elisa Schaeffer -- Improving the Multiple Alignments Strategy for Fingerprint Verification / Miguel Angel Medina-Pérez, Milton García-Borroto, Andres Eduardo Gutierrez-Rodríguez and Leopoldo Altamirano-Robles -- Breaking reCAPTCHAs with Unpredictable Collapse: Heuristic Character Segmentation and Recognition / Claudia Cruz-Perez, Oleg Starostenko, Fernando Uceda-Ponga, Vicente Alarcon-Aquino and Leobardo Reyes-Cabrera -- Using Short-Range Interactions and Simulated Genetic Strategy to Improve the Protein Contact Map Prediction / Cosme E. Santiesteban Toca, Milton García-Borroto and Jesus S. Aguilar Ruiz -- Associative Model for Solving the Wall-Following Problem / Rodolfo Navarro, Elena Acevedo, Antonio Acevedo and Fabiola Martínez -- The List of Clusters Revisited / Eric Sadit Tellez and Edgar Chávez -- A Heuristically Perturbation of Dataset to Achieve a Diverse Ensemble of Classifiers / Hamid Parvin, Sajad Parvin, Zahra Rezaei and Moslem Mohamadi -- Compact and Efficient Permutations for Proximity Searching / Karina Figueroa Mora and Rodrigo Paredes -- NURBS Parameterization: A New Method of Parameterization Using the Correlation Relationship between Nodes / Sawssen Jalel, Mohamed Naouai, Atef Hamouda and Malek Jebabli -- Genetic Algorithm for Multidimensional Scaling over Mixed and Incomplete Data / P. Tecuanhuehue-Vera, Jesús Ariel Carrasco-Ochoa and José Fco. Martínez-Trinidad -- Experimental Validation of an Evolutionary Method to Identify a Mobile Robot's Position / Angel Kuri-Morales and Ignacio Lopez-Peña -- Up and Down Trend Associations in Analysis of Time Series Shape Association Patterns / Ildar Batyrshin -- Unsupervised Linkage Learner Based on Local Optimums / Hamid Parvin and Sajad Parvin -- A Modified Back-Propagation Algorithm to Deal with Severe Two-Class Imbalance Problems on Neural Networks / R. Alejo, P. Toribio, R.M. Valdovinos and J.H. Pacheco-Sanchez -- Computing #2SAT and #2UNSAT by Binary Patterns / Guillermo De Ita Luna and J. Raymundo Marcial-Romero -- A New Document Author Representation for Authorship Attribution / Adrián Pastor López-Monroy, Manuel Montes-y-Gómez, Luis Villaseñor-Pineda, Jesús Ariel Carrasco-Ochoa and José Fco. Martínez-Trinidad -- A Machine-Translation Method for Normalization of SMS / Darnes Vilariño, David Pinto, Beatriz Beltrán, Saul León and Esteban Castillo, et al. -- Reduced Universal Background Model for Speech Recognition and Identification System / Lachachi Nour-Eddine and Adla Abdelkader -- GA Approaches to HMM Optimization for Automatic Speech Recognition / Yara Pérez Maldonado, Santiago Omar Caballero Morales and Roberto Omar Cruz Ortega -- Phonetic Unification of Multiple Accents for Spanish and Arabic Languages / Saad Tanveer, Aslam Muhammad, A.M. Martinez-Enriquez and G. Escalada-Imaz -- Environmental Sound Recognition by Measuring Significant Changes in the Spectral Entropy / Jessica Beltrán-Márquez, Edgar Chávez and Jesús Favela.
Record Nr. NYU-004623496
[Mexican Conference on Pattern Recognition (4th : 2012 : Santa María Huatulco, Mexico)]  
Materiale a stampa
Lo trovi qui: New York University