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.
Internet and network economics [electronic resource] : 7th International Workshop, WINE 2011, Singapore, December 11-14, 2011, proceedings / Ning Chen, Edith Elkind, Elias Koutsoupias (eds.).
Internet and network economics [electronic resource] : 7th International Workshop, WINE 2011, Singapore, December 11-14, 2011, proceedings / Ning Chen, Edith Elkind, Elias Koutsoupias (eds.).
Creatore [WINE 2011 (2011 : Singapore)]
Estensione 1 online resource (xii, 420 p.)
Disciplina 004.678
Accesso persona Chen, Ning, 1979-
Elkind, Edith, 1976-
Koutsoupias, Elias
Genere/Forma Electronic books
Soggetto non controllato Computer science
Computer Communication Networks
Software engineering
Computer software
Computational complexity
Algorithm Analysis and Problem Complexity
Discrete Mathematics in Computer Science
Computation by Abstract Devices
ISBN 9783642255106 (electronic bk.)
3642255108 (electronic bk.)
9783642255090
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UPENN-9960089993503681
[WINE 2011 (2011 : Singapore)]  
Materiale a stampa
Lo trovi qui: University of Pennsylvania
Principles and practice of constraint programming [electronic resource] : 18th International Conference, CP 2012, Québec City, QC, Canada, October 8-12, 2012. Proceedings / Michela Milano (ed.).
Principles and practice of constraint programming [electronic resource] : 18th International Conference, CP 2012, Québec City, QC, Canada, October 8-12, 2012. Proceedings / Michela Milano (ed.).
Creatore [CP (Conference) (18th : 2012 : Québec, Québec)]
Estensione 1 online resource.
Disciplina 005.1/16
Accesso persona Milano, Michela
Genere/Forma Electronic books
Soggetto non controllato Computer science
Computer software
Logic design
Electronic data processing
Computational complexity
Mathematical Logic and Formal Languages
Numeric Computing
Algorithm Analysis and Problem Complexity
Logics and Meanings of Programs
Discrete Mathematics in Computer Science
Programming Languages, Compilers, Interpreters
ISBN 9783642335587 (electronic bk.)
3642335586 (electronic bk.)
9783642335570
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Constraint Programming and a Usability Quest / Laurent D. Michel -- Optimization Challenges in Smart Grid Operations / Miguel F. Anjos -- Where Are the Interesting Problems? / Barry O'Sullivan -- A Generic Method for Identifying and Exploiting Dominance Relations / Geoffrey Chu and Peter J. Stuckey -- Scheduling Scientific Experiments on the Rosetta/Philae Mission / Gilles Simonin, Christian Artigues, Emmanuel Hebrard and Pierre Lopez -- Max-Sur-CSP on Two Elements / Hannes Uppman -- An Optimal Arc Consistency Algorithm for a Chain of Atmost Constraints with Cardinality / Mohamed Siala, Emmanuel Hebrard and Marie-José Huguet -- Conflict Directed Lazy Decomposition / Ignasi Abío and Peter J. Stuckey -- Improving SAT-Based Weighted MaxSAT Solvers / Carlos Ansótegui, Maria Luisa Bonet, Joel Gabàs and Jordi Levy -- Distributed Tree Decomposition with Privacy / Vincent Armant, Laurent Simon and Philippe Dague -- Refining Restarts Strategies for SAT and UNSAT / Gilles Audemard and Laurent Simon -- Boosting Local Consistency Algorithms over Floating-Point Numbers / Mohammed Said Belaid, Claude Michel and Michel Rueher --
A Model Seeker: Extracting Global Constraint Models from Positive Examples / Nicolas Beldiceanu and Helmut Simonis -- On Computing Minimal Equivalent Subformulas / Anton Belov, Mikoláš Janota, Inês Lynce and Joao Marques-Silva -- Including Soft Global Constraints in DCOPs / Christian Bessiere, Patricia Gutierrez and Pedro Meseguer -- The Weighted Average Constraint / Alessio Bonfietti and Michele Lombardi -- Weibull-Based Benchmarks for Bin Packing / Ignacio Castiñeiras, Milan De Cauwer and Barry O'Sullivan -- Space-Time Tradeoffs for the Regular Constraint / Kenil C. K. Cheng, Wei Xia and Roland H. C. Yap -- Inter-instance Nogood Learning in Constraint Programming / Geoffrey Chu and Peter J. Stuckey -- Solving Temporal Problems Using SMT: Strong Controllability / Alessandro Cimatti, Andrea Micheli and Marco Roveri -- A Characterisation of the Complexity of Forbidding Subproblems in Binary Max-CSP / Martin C. Cooper, Guillaume Escamocher and Stanislav Živný -- Optimisation Modelling for Software Developers / Kathryn Francis, Sebastian Brand and Peter J. Stuckey -- Adaptive Bisection of Numerical CSPs / Laurent Granvilliers --
Resource Constrained Shortest Paths with a Super Additive Objective Function / Stefano Gualandi and Federico Malucelli -- Relating Proof Complexity Measures and Practical Hardness of SAT / Matti Järvisalo, Arie Matsliah, Jakob Nordström and Stanislav Živný -- The SeqBin Constraint Revisited / George Katsirelos, Nina Narodytska and Toby Walsh -- Eigenvector Centrality in Industrial SAT Instances / George Katsirelos and Laurent Simon -- Classifying and Propagating Parity Constraints / Tero Laitinen, Tommi Junttila and Ilkka Niemelä -- Consistencies for Ultra-Weak Solutions in Minimax Weighted CSPs Using the Duality Principle / Arnaud Lallouet, Jimmy H. M. Lee and Terrence W. K. Mak -- Propagating Soft Table Constraints / Christophe Lecoutre, Nicolas Paris, Olivier Roussel and Sébastien Tabary -- WCSP Integration of Soft Neighborhood Substitutability / Christophe Lecoutre, Olivier Roussel and Djamel E. Dehani -- Increasing Symmetry Breaking by Preserving Target Symmetries / Jimmy H. M. Lee and Jingying Li -- A Scalable Sweep Algorithm for the cumulative Constraint / Arnaud Letort, Nicolas Beldiceanu and Mats Carlsson --
A New Encoding from MinSAT into MaxSAT / Zhu Zhu, Chu-Min Li, Felip Manyà and Josep Argelich -- Solving Minimal Constraint Networks in Qualitative Spatial and Temporal Reasoning / Weiming Liu and Sanjiang Li -- Containment, Equivalence and Coreness from CSP to QCSP and Beyond / Florent Madelaine and Barnaby Martin -- An Optimal Filtering Algorithm for Table Constraints / Jean-Baptiste Mairy, Pascal Van Hentenryck and Yves Deville -- Parallel SAT Solver Selection and Scheduling / Yuri Malitsky, Ashish Sabharwal, Horst Samulowitz and Meinolf Sellmann -- Constraint Satisfaction over Bit-Vectors / Laurent D. Michel and Pascal Van Hentenryck -- Towards Solver-Independent Propagators / Jean-Noël Monette, Pierre Flener and Justin Pearson -- Interactive Algorithm for Multi-Objective Constraint Optimization / Tenda Okimoto, Yongjoon Joe, Atsushi Iwasaki, Toshihiro Matsui and Katsutoshi Hirayama, et al. -- Focus : A Constraint for Concentrating High Costs / Thierry Petit -- Refining Abstract Interpretation Based Value Analysis with Constraint Programming Techniques / Olivier Ponsini, Claude Michel and Michel Rueher -- Time-Dependent Simple Temporal Networks / Cédric Pralet and Gérard Verfaillie --
Improved Bounded Max-Sum for Distributed Constraint Optimization / Emma Rollon and Javier Larrosa -- A Hybrid MIP/CP Approach for Multi-activity Shift Scheduling / Domenico Salvagnin and Toby Walsh -- Contributions to the Theory of Practical Quantified Boolean Formula Solving / Allen Van Gelder -- Breaking Variable Symmetry in Almost Injective Problems / Philippe Vismara and Remi Coletta -- Understanding, Improving and Parallelizing MUS Finding Using Model Rotation / Siert Wieringa -- Revisiting Neighborhood Inverse Consistency on Binary CSPs / Robert J. Woodward, Shant Karakashian, Berthe Y. Choueiry and Christian Bessiere -- Syntactically Characterizing Local-to-Global Consistency in ORD-Horn / Michał Wrona -- A Hybrid Paradigm for Adaptive Parallel Search / Xi Yun and Susan L. Epstein -- A Constraint Programming Approach for the Traveling Purchaser Problem / Hadrien Cambazard and Bernard Penz -- Constraint-Based Register Allocation and Instruction Scheduling / Roberto Castañeda Lozano, Mats Carlsson, Frej Drejhammar and Christian Schulte -- Maximising the Net Present Value of Large Resource-Constrained Projects / Hanyu Gu, Peter J. Stuckey and Mark G. Wallace --
Comparing Solution Methods for the Machine Reassignment Problem / Deepak Mehta, Barry O'Sullivan and Helmut Simonis -- A Boolean Model for Enumerating Minimal Siphons and Traps in Petri Nets / Faten Nabli, François Fages, Thierry Martinez and Sylvain Soliman -- Cardinality Reasoning for Bin-Packing Constraint: Application to a Tank Allocation Problem / Pierre Schaus, Jean-Charles Régin, Rowan Van Schaeren, Wout Dullaert and Birger Raa -- The Offshore Resources Scheduling Problem: Detailing a Constraint Programming Approach / Thiago Serra, Gilberto Nishioka and Fernando J. M. Marcellino -- Computational Protein Design as a Cost Function Network Optimization Problem / David Allouche, Seydou Traoré, Isabelle André, Simon de Givry and George Katsirelos, et al. -- A Filtering Technique for Fragment Assembly- Based Proteins Loop Modeling with Constraints / Federico Campeotto, Alessandro Dal Palù, Agostino Dovier, Ferdinando Fioretto and Enrico Pontelli -- A Branch and Prune Algorithm for the Computation of Generalized Aspects of Parallel Robots / Stéphane Caro, Damien Chablat, Alexandre Goldsztejn, Daisuke Ishii and Christophe Jermann --
The Semigroups of Order 10 / Andreas Distler, Chris Jefferson, Tom Kelsey and Lars Kotthoff -- Exploring Chemistry Using SMT / Rolf Fagerberg, Christoph Flamm, Daniel Merkle and Philipp Peters -- A Pseudo-Boolean Set Covering Machine / Pascal Germain, Sébastien Giguère, Jean-Francis Roy, Brice Zirakiza and François Laviolette, et al. -- Finding a Nash Equilibrium by Asynchronous Backtracking / Alon Grubshtein and Amnon Meisels -- Reasoning over Biological Networks Using Maximum Satisfiability / João Guerra and Inês Lynce -- Properties of Energy-Price Forecasts for Scheduling / Georgiana Ifrim, Barry O'Sullivan and Helmut Simonis -- Aggregating Conditionally Lexicographic Preferences on Multi-issue Domains / Jérôme Lang, Jérôme Mengin and Lirong Xia -- Constraint Programming for Path Planning with Uncertainty / Solving the Optimal Search Path Problem / Michael Morin, Anika-Pascale Papillon, Irène Abi-Zeid, François Laviolette and Claude-Guy Quimper -- Feature Term Subsumption Using Constraint Programming with Basic Variable Symmetry / Santiago Ontañón and Pedro Meseguer.
Record Nr. UPENN-9960101343503681
[CP (Conference) (18th : 2012 : Québec, Québec)]  
Materiale a stampa
Lo trovi qui: University of Pennsylvania
Algorithms and data structures : 13th international symposium, WADS 2013, London, ON, Canada, August 12-14, 2013, proceedings / Frank Dehne, Roberto Solis-Oba, Jörg-Rüdiger Sack (eds.).
Algorithms and data structures : 13th international symposium, WADS 2013, London, ON, Canada, August 12-14, 2013, proceedings / Frank Dehne, Roberto Solis-Oba, Jörg-Rüdiger Sack (eds.).
Creatore [WADS (Symposium) (13th : 2013 : London, Ont.)]
Estensione 1 online resource (xiv, 538 pages) : illustrations (black and white).
Accesso persona Dehne, F. (Frank), 1960-editor.
Solis-Oba, Roberto, editor
Sack, J.-R. (Jörg-Rüdiger), 1954-editor.
Genere/Forma Electronic books
Conference papers and proceedings
Ebook
Congresses
Soggetto non controllato Computer science
Computer Communication Networks
Data structures (Computer science)
Computer software
Electronic data processing
Computational complexity
Algorithm Analysis and Problem Complexity
Discrete Mathematics in Computer Science
Numeric Computing
ISBN 9783642401046
364240104X
9783642401039
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Algorithms and data structures in bioinformatics -- Algorithms and data structures incombinatorics -- Algorithms and data structures in computational geometry -- Algorithms and data structures in databases -- Algorithms and data structures in graphics -- Parallel and distributed computing.
Record Nr. UCHICAGO-11079742
[WADS (Symposium) (13th : 2013 : London, Ont.)]  
Materiale a stampa
Lo trovi qui: University of Chicago
LATIN 2012: Theoretical informatics : 10th Latin American Symposium, Arequipa, Peru, April 16-20, 2012. Proceedings / David Fernández-Baca (ed.).
LATIN 2012: Theoretical informatics : 10th Latin American Symposium, Arequipa, Peru, April 16-20, 2012. Proceedings / David Fernández-Baca (ed.).
Creatore [Latin American Symposium on Theoretical Informatics (10th : 2012 : Arequipa, Peru)]
Estensione 1 online resource (xvii, 669 pages).
Accesso persona Fernández-Baca, David
Genere/Forma Electronic books
Conference papers and proceedings
Soggetto non controllato Computer science
Computer Communication Networks
Computer software
Electronic data processing
Computational complexity
Algorithm Analysis and Problem Complexity
Discrete Mathematics in Computer Science
Numeric Computing
Information Systems Applications (incl. Internet)
Computation by Abstract Devices
ISBN 9783642293443
3642293441
9783642293436
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto A Generalization of the Convex Kakeya Problem / Hee-Kap Ahn, Sang Won Bae, Otfried Cheong, Joachim Gudmundsson and Takeshi Tokuyama, et al. -- Low Complexity Scheduling Algorithm Minimizing the Energy for Tasks with Agreeable Deadlines / Eric Angel, Evripidis Bampis and Vincent Chau -- Bichromatic 2-Center of Pairs of Points / Esther M. Arkin, José Miguel Díaz-Báñez, Ferran Hurtado, Piyush Kumar and Joseph S.B. Mitchell, et al. -- Erdős-Rényi Sequences and Deterministic Construction of Expanding Cayley Graphs / Vikraman Arvind, Partha Mukhopadhyay and Prajakta Nimbhorkar -- A Better Approximation Ratio and an IP Formulation for a Sensor Cover Problem / Rafael da Ponte Barbosa and Yoshiko Wakabayashi -- On the Advice Complexity of the Knapsack Problem / Hans-Joachim Böckenhauer, Dennis Komm, Richard Královič and Peter Rossmanith -- Reoptimization of Some Maximum Weight Induced Hereditary Subgraph Problems / Nicolas Boria, Jérôme Monnot and Vangelis Th. Paschos -- On Plane Constrained Bounded-Degree Spanners / Prosenjit Bose, Rolf Fagerberg, André van Renssen and Sander Verdonschot.
Space-Efficient Approximation Scheme for Circular Earth Mover Distance / Joshua Brody, Hongyu Liang and Xiaoming Sun -- Density Classification on Infinite Lattices and Trees / Ana Bušić, Nazim Fatès, Jean Mairesse and Irène Marcovici -- Coloring Planar Homothets and Three-Dimensional Hypergraphs / Jean Cardinal and Matias Korman -- An Equivariance Theorem with Applications to Renaming / Armando Castañeda, Maurice Herlihy and Sergio Rajsbaum -- Renaming Is Weaker Than Set Agreement But for Perfect Renaming: A Map of Sub-consensus Tasks / Armando Castañeda, Damien Imbs, Sergio Rajsbaum and Michel Raynal -- Pseudorandomness of a Random Kronecker Sequence / Eda Cesaratto and Brigitte Vallée -- Revisiting the Cache Miss Analysis of Multithreaded Algorithms / Richard Cole and Vijaya Ramachandran -- Parameterized Complexity of MaxSat above Average / Robert Crowston, Gregory Gutin, Mark Jones, Venkatesh Raman and Saket Saurabh -- Solving the 2-Disjoint Connected Subgraphs Problem Faster Than 2n / Marek Cygan, Marcin Pilipczuk, Michał Pilipczuk and Jakub Onufry Wojtaszczyk.
On the Non-progressive Spread of Influence through Social Networks / MohammadAmin Fazli, Mohammad Ghodsi, Jafar Habibi, Pooya Jalaly Khalilabadi and Vahab Mirrokni, et al. -- Forbidden Patterns / Johannes Fischer, Travis Gagie, Tsvi Kopelowitz, Moshe Lewenstein and Veli Mäkinen, et al. -- Structural Complexity of Multiobjective NP Search Problems / Krzysztof Fleszar, Christian Glaßer, Fabian Lipp, Christian Reitwießner and Maximilian Witek -- k-Gap Interval Graphs / Fedor V. Fomin, Serge Gaspers, Petr Golovach, Karol Suchan and Stefan Szeider, et al. -- Decidability Classes for Mobile Agents Computing / Pierre Fraigniaud and Andrzej Pelc -- NE Is Not NP Turing Reducible to Nonexponentially Dense NP Sets / Bin Fu -- Efficient Arbitrary and Resolution Proofs of Unsatisfiability for Restricted Tree-Width / Martin Fürer -- Indexed Multi-pattern Matching / Travis Gagie, Kalle Karhu, Juha Kärkkäinen, Veli Mäkinen and Leena Salmela, et al. -- New Lower Bound on Max Cut of Hypergraphs with an Application to r-Set Splitting / Archontia C. Giannopoulou, Sudeshna Kolay and Saket Saurabh.
Cache Me If You Can: Capacitated Selfish Replication Games / Ragavendran Gopalakrishnan, Dimitrios Kanoulas, Naga Naresh Karuturi, C. Pandu Rangan and Rajmohan Rajaraman, et al. -- The Efficiency of MapReduce in Parallel External Memory / Gero Greiner and Riko Jacob -- Algorithms for Some H-Join Decompositions / Michel Habib, Antoine Mamcarz and Fabien de Montgolfier -- On the Bend-Number of Planar and Outerplanar Graphs / Daniel Heldt, Kolja Knauer and Torsten Ueckerdt -- Hiring above the m-th Best Candidate: A Generalization of Records in Permutations / Ahmed Helmi, Conrado Martínez and Alois Panholzer -- On the Performance of Smith's Rule in Single-Machine Scheduling with Nonlinear Cost / Wiebke Höhn and Tobias Jacobs -- Advantage of Overlapping Clusters for Minimizing Conductance / Rohit Khandekar, Guy Kortsarz and Vahab Mirrokni -- Independence of Tabulation-Based Hash Classes / Toryn Qwyllyn Klassen and Philipp Woelfel -- Oblivious Two-Way Finite Automata: Decidability and Complexity / Martin Kutrib, Andreas Malcher and Giovanni Pighizzini.
Clique-Colouring and Biclique-Colouring Unichord-Free Graphs / Hélio B. Macêdo Filho, Raphael C.S. Machado and Celina M.H. Figueiredo -- Random Walks and Bisections in Random Circulant Graphs / Bernard Mans and Igor E. Shparlinski -- The Feedback Arc Set Problem with Triangle Inequality Is a Vertex Cover Problem / Monaldo Mastrolilli -- Fully Analyzing an Algebraic Pólya Urn Model / Basile Morcrette -- Degree-Constrained Node-Connectivity / Zeev Nutov -- Survivable Network Activation Problems / Zeev Nutov -- On the Integrality Gap of the Subtour LP for the 1,2-TSP / Jiawei Qian, Frans Schalekamp, David P. Williamson and Anke van Zuylen -- A Theory and Algorithms for Combinatorial Reoptimization / Hadas Shachnai, Gal Tamir and Tami Tamir -- Capacity Achieving Two-Write WOM Codes / Amir Shpilka -- The Relationship between Inner Product and Counting Cycles / Xiaoming Sun, Chengu Wang and Wei Yu -- Approximating Minimum Label s-t Cut via Linear Programming / Linqing Tang and Peng Zhang.
Record Nr. UCHICAGO-11076805
[Latin American Symposium on Theoretical Informatics (10th : 2012 : Arequipa, Peru)]  
Materiale a stampa
Lo trovi qui: University of Chicago
Research in cryptology : 4th Western European Workshop, WEWoRC 2011, Weimar, Germany, July 20-22, 2011, Revised selected papers / Frederik Armknecht, Stefan Lucks (eds.).
Research in cryptology : 4th Western European Workshop, WEWoRC 2011, Weimar, Germany, July 20-22, 2011, Revised selected papers / Frederik Armknecht, Stefan Lucks (eds.).
Creatore [Western European Workshop on Research in Cryptology (4th : 2011 : Weimar, Thuringia, Germany)]
Estensione 1 online resource.
Accesso persona Armknecht, Frederik
Lucks, Stefan
Genere/Forma Electronic books
Conference papers and proceedings
Soggetto non controllato Computer science
Computer network architectures
Data protection
Data encryption (Computer science)
Computational complexity
Systems and Data Security
Discrete Mathematics in Computer Science
ISBN 9783642341595
3642341594
3642341586
9783642341588
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Broadcast Attacks against Code-Based Schemes / Robert Niebuhr and Pierre-Louis Cayrel -- On the Security of Hummingbird-2 against Side Channel Cube Attacks / Xinxin Fan and Guang Gong -- Full Lattice Basis Reduction on Graphics Cards / Timo Bartkewitz and Tim Güneysu -- Breaking DVB-CSA / Erik Tews, Julian Wälde and Michael Weiner -- On the Role of Expander Graphs in Key Predistribution Schemes for Wireless Sensor Networks / Michelle Kendall and Keith M. Martin -- [Camma]-MAC[H2P] -- A New Universal MAC Scheme / Ewan Fleischmann, Christian Forler and Stefan Lucks -- New Universal Hash Functions / Aysajan Abidin and Jan-Åke Larsson -- Cryptanalysis of TWIS Block Cipher / Onur Koçak and Neşe Öztop -- RSA Vulnerabilities with Small Prime Difference / Marián Kühnel -- Combining Multiplication Methods with Optimized Processing Sequence for Polynomial Multiplier in GF(2k) / Zoya Dyka, Peter Langendoerfer and Frank Vater.
Record Nr. UCHICAGO-11077521
[Western European Workshop on Research in Cryptology (4th : 2011 : Weimar, Thuringia, Germany)]  
Materiale a stampa
Lo trovi qui: University of Chicago
Computing and combinatorics : 19th International Conference, COCOON 2013, Hangzhou, China, June 21-23, 2013. Proceedings / Ding-Zhu Du, Guochuan Zhang (eds.).
Computing and combinatorics : 19th International Conference, COCOON 2013, Hangzhou, China, June 21-23, 2013. Proceedings / Ding-Zhu Du, Guochuan Zhang (eds.).
Creatore [COCOON (Conference) (19th : 2013 : Hangzhou, China)]
Estensione 1 online resource (xviii, 861 pages) : illustrations (black and white).
Accesso persona Du, Dingzhu, editor
Zhang, Guochuan, editor
Genere/Forma Electronic books
Conference papers and proceedings
Ebook
Congresses
Soggetto non controllato Computer science
Computer Communication Networks
Computer software
Logic design
Computational complexity
Artificial intelligence
Algorithm Analysis and Problem Complexity
Discrete Mathematics in Computer Science
Computation by Abstract Devices
ISBN 9783642387685
3642387683
9783642387678
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Keynote. Recent Results for Online Makespan Minimization / Susanne Albers -- Optimal Stopping Meets Combinatorial Optimization / Robert Kleinberg -- Game Theory. New Bounds for the Balloon Popping Problem / Davide Bilò, Vittorio Bilò -- On the Sequential Price of Anarchy of Isolation Games / Anna Angelucci [and others] -- Social Exchange Networks with Distant Bargaining / Konstantinos Georgiou [and others] -- The 1/4-Core of the Uniform Bin Packing Game Is Nonempty / Walter Kern, Xian Qiu -- Randomized Algorithms. On the Advice Complexity of the Online L(2,1)-Coloring Problem on Paths and Cycles / Maria Paola Bianchi [and others] -- On Randomized Fictitious Play for Approximating Saddle Points over Convex Sets / Khaled Elbassioni [and others] -- A Fast Algorithm for Data Collection along a Fixed Track / Otfried Cheong, Radwa El Shawi, Joachim Gudmundsson -- Random Methods for Parameterized Problems / Qilong Feng [and others].
Scheduling Algorithms. DVS Scheduling in a Line or a Star Network of Processors / Zongxu Mu, Minming Li -- Online Algorithms for Batch Machines Scheduling with Delivery Times / Peihai Liu, Xiwen Lu -- How to Schedule the Marketing of Products with Negative Externalities / Zhigang Cao, Xujin Chen, Changjun Wang -- From Preemptive to Non-preemptive Speed-Scaling Scheduling / Evripidis Bampis [and others] -- Computational Theory. Selection from Read-Only Memory with Limited Workspace / Amr Elmasry [and others] -- Deternimization of Büchi Automata as Partitioned Automata / Cong Tian, Zhenhua Duan, Mengfei Yang -- On Linear-Size Pseudorandom Generators and Hardcore Functions / Joshua Baron, Yuval Ishai, Rafail Ostrovsky -- A Fast Algorithm Finding the Shortest Reset Words / Andrzej Kisielewicz, Jakub Kowalski, Marek Szykuła.
Computational Geometry. The Discrete Voronoi Game in a Simple Polygon / Aritra Banik [and others] -- Facets for Art Gallery Problems / Sándor P. Fekete [and others] -- Hitting and Piercing Rectangles Induced by a Point Set / Ninad Rajgopal [and others] -- Realistic Roofs over a Rectilinear Polygon Revisited / Jessica Sherette, Sang Duk Yoon -- Graph Algorithms I. Parametric Power Supply Networks / Shiho Morishita, Takao Nishizeki -- Approximating the Minimum Independent Dominating Set in Perturbed Graphs / Weitian Tong, Randy Goebel, Guohui Lin -- A Linear-Time Algorithm for the Minimum Degree Hypergraph Problem with the Consecutive Ones Property / Chih-Hsuan Li, Jhih-Hong Ye, Biing-Feng Wang -- On the Conjunctive Capacity of Graphs / Miroslav Chlebík, Janka Chlebíková
Approximation Algorithms. Improved Approximation Algorithms for the Facility Location Problems with Linear/submodular Penalty / Yu Li [and others] -- An Improved Semidefinite Programming Hierarchies Rounding Approximation Algorithm for Maximum Graph Bisection Problems / Chenchen Wu, Donglei Du, Dachuan Xu -- Improved Local Search for Universal Facility Location / Eric Angel, Nguyen Kim Thang, Damien Regnault -- Improved Approximation Algorithms for Computing k Disjoint Paths Subject to Two Constraints / Longkun Guo, Hong Shen, Kewen Liao -- Graph Algorithms II. The k-Separator Problem / Walid Ben-Ameur, Mohamed-Ahmed Mohamed-Sidi, José Neto -- On the Treewidth of Dynamic Graphs / Bernard Mans, Luke Mathieson -- Square-Orthogonal Drawing with Few Bends per Edge / Yu-An Lin, Sheung-Hung Poon -- Covering Tree with Stars / Jan Baumbach, Jiong Guo, Rashid Ibragimov.
Computational Biology. A Polynomial Time Approximation Scheme for the Closest Shared Center Problem / Weidong Li, Lusheng Wang, Wenjuan Cui -- An Improved Approximation Algorithm for Scaffold Filling to Maximize the Common Adjacencies / Nan Liu [and others] -- An Efficient Algorithm for One-Sided Block Ordering Problem with Block-Interchange Distance / Kun-Tze Chen [and others] -- A Combinatorial Approach for Multiple RNA Interaction: Formulations, Approximations, and Heuristics / Syed Ali Ahmed, Saad Mneimneh, Nancy L. Greenbaum -- Graph Algorithms III. Maximum Balanced Subgraph Problem Parameterized above Lower Bound / Robert Crowston [and others] -- A Toolbox for Provably Optimal Multistage Strict Group Testing Strategies / Peter Damaschke, Azam Sheikh Muhammad -- A Linear Edge Kernel for Two-Layer Crossing Minimization / Yasuaki Kobayashi [and others] -- A Linear-Time Algorithm for Computing the Prime Decomposition of a Directed Graph with Regard to the Cartesian Product / Christophe Crespelle, Eric Thierry, Thomas Lambert.
Online Algorithms. Metrical Service Systems with Multiple Servers / Ashish Chiplunkar, Sundar Vishwanathan -- The String Guessing Problem as a Method to Prove Lower Bounds on the Advice Complexity / Hans-Joachim Böckenhauer [and others] -- Online Algorithms for 1-Space Bounded 2-Dimensional Bin Packing and Square Packing / Yong Zhang [and others] -- Improved Lower Bounds for the Online Bin Packing Problem with Cardinality Constraints / Hiroshi Fujiwara, Koji Kobayashi -- Parameterized Algorithms. Parameterized Complexity of Flood-Filling Games on Trees / Uéverton dos Santos Souza, Fábio Protti, Maise Dantas da Silva -- Parameterized Approximability of Maximizing the Spread of Influence in Networks / Cristina Bazgan [and others] -- An Effective Branching Strategy for Some Parameterized Edge Modification Problems with Multiple Forbidden Induced Subgraphs / Yunlong Liu [and others] -- Parameterized Algorithms for Maximum Agreement Forest on Multiple Trees / Feng Shi [and others].
Computational Complexity. Small H-Coloring Problems for Bounded Degree Digraphs / Pavol Hell, Aurosish Mishra -- Bounded Model Checking for Propositional Projection Temporal Logic / Zhenhua Duan, Cong Tian, Mengfei Yang, Jia He -- Packing Cubes into a Cube Is NP-Hard in the Strong Sense / Yiping Lu, Danny Z. Chen, Jianzhong Cha -- On the Complexity of Solving or Approximating Convex Recoloring Problems / Manoel B. Campêlo [and others] -- Algorithms. 2-connecting Outerplanar Graphs without Blowing Up the Pathwidth / Jasine Babu [and others] -- How to Catch L 2-Heavy-Hitters on Sliding Windows / Vladimir Braverman, Ran Gelles, Rafail Ostrovsky -- Time/Memory/Data Tradeoffs for Variants of the RSA Problem / Pierre-Alain Fouque, Damien Vergnaud, Jean-Christophe Zapalowicz -- An Improved Algorithm for Extraction of Exact Boundaries and Boundaries Inclusion Relationship / Tao Hu, Xianyi Ren, Jihong Zhang.
Workshop I. Straight-Line Monotone Grid Drawings of Series-Parallel Graphs / Md. Iqbal Hossain, Md. Saidur Rahman -- Combination of Two-Machine Flow Shop Scheduling and Shortest Path Problems / Kameng Nip, Zhenbo Wang -- The Program Download Problem: Complexity and Algorithms / Chao Peng [and others] -- Finding Theorems in NBG Set Theory by Automated Forward Deduction Based on Strong Relevant Logic / Hongbiao Gao [and others] -- Workshop II. Perturbation Analysis of Maximum-Weighted Bipartite Matchings with Low Rank Data / Xingwu Liu, Shang-Hua Teng -- Sublinear Time Approximate Sum via Uniform Random Sampling / Bin Fu, Wenfeng Li, Zhiyong Peng -- Tractable Connected Domination for Restricted Bipartite Graphs (Extended Abstract) / Zhao Lu, Tian Liu, Ke Xu -- On the Minimum Caterpillar Problem in Digraphs / Taku Okada [and others].
CSoNet I. A New Model for Product Adoption over Social Networks / Lidan Fan [and others] -- Generating Uncertain Networks Based on Historical Network Snapshots / Meng Han [and others] -- A Short-Term Prediction Model of Topic Popularity on Microblogs / Juanjuan Zhao [and others] -- Social Network Path Analysis Based on HBase / Yan Qiang [and others] -- CSoNet II. Community Expansion Model Based on Charged System Theory / Yuanjun Bi [and others] -- Centrality and Spectral Radius in Dynamic Communication Networks / Danica Vukadinović Greetham, Zhivko Stoyanov, Peter Grindrod -- Finding Network Communities Using Random Walkers with Improved Accuracy / You Li [and others] -- Homophilies and Communities Detection among a Subset of Blogfa Persian Weblogs: Computer and Internet Category / Adib Rastegarnia, Meysam Mohajer, Vahid Solouk.
CSoNet III. Neighborhood-Based Dynamic Community Detection with Graph Transform for 0-1 Observed Networks / Li Wang [and others] -- Effects of Inoculation Based on Structural Centrality on Rumor Dynamics in Social Networks / Anurag Singh, Rahul Kumar, Yatindra Nath Singh -- A Dominating Set Based Approach to Identify Effective Leader Group of Social Network / Donghyun Kim [and others] -- Using Network Sciences to Evaluate the Brazilian Airline Network / Douglas Oliveira, Marco Carvalho, Ronaldo Menezes.
Record Nr. UCHICAGO-11078629
[COCOON (Conference) (19th : 2013 : Hangzhou, China)]  
Materiale a stampa
Lo trovi qui: University of Chicago
Applications of discrete geometry and mathematical morphology : first International Workshop, WADGMM 2010, Istanbul, Turkey, August 22, 2010, Revised selected papers / Ullrich Köthe, Annick Montanvert, Pierre Soille (eds.).
Applications of discrete geometry and mathematical morphology : first International Workshop, WADGMM 2010, Istanbul, Turkey, August 22, 2010, Revised selected papers / Ullrich Köthe, Annick Montanvert, Pierre Soille (eds.).
Creatore [WADGMM (Workshop) (1st : 2010 : Istanbul, Turkey)]
Estensione 1 online resource ([v], 167 pages) : illustrations.
Accesso persona Köthe, Ullrich
Montanvert, Annick
Soille, Pierre
Genere/Forma Electronic books
Soggetto non controllato Computer science
Computer software
Computational complexity
Optical pattern recognition
Image Processing and Computer Vision
Pattern Recognition
Algorithm Analysis and Problem Complexity
Information Systems Applications (incl. Internet)
Discrete Mathematics in Computer Science
ISBN 9783642323133
3642323138
364232312X
9783642323126
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Connect the Dots: The Reconstruction of Region Boundaries from Contour Sampling Points / Peer Stelldinger -- Digital Shape Analysis with Maximal Segments / Jacques-Olivier Lachaud -- Discrete Curvature Estimation Methods for Triangulated Surfaces / Mohammed Mostefa Mesmoudi, Leila De Floriani and Paola Magillo -- On Morphological Hierarchical Representations for Image Processing and Spatial Data Clustering / Pierre Soille and Laurent Najman -- Radial Moment Invariants for Attribute Filtering in 3D / Fred N. Kiwanuka and Michael H.F. Wilkinson -- Volumetric Analysis of Digital Objects Using Distance Transformation: Performance Issues and Extensions / David Coeurjolly -- Geometric Analysis of 3D Electron Microscopy Data / Ullrich Köthe, Björn Andres, Thorben Kröger and Fred Hamprecht -- Machine Learning as a Preprocessing Phase in Discrete Tomography / Mihály Gara, Tamás Sámuel Tasi and Péter Balázs -- Fast Planarity Estimation and Region Growing on GPU / Michaël Heyvaert and Peter Veelaert -- Writing Reusable Digital Topology Algorithms in a Generic Image Processing Framework / Roland Levillain, Thierry Géraud and Laurent Najman -- A New Image-Mining Technique for Automation of Parkinson's Disease Research / Igor Gurevich, Artem Myagkov and Vera Yashina.
Record Nr. UCHICAGO-11077226
[WADGMM (Workshop) (1st : 2010 : Istanbul, Turkey)]  
Materiale a stampa
Lo trovi qui: University of Chicago
Mathematical foundations of computer science 2012 : 37th International Symposium, MFCS 2012, Bratislava, Slovakia, August 27-31, 2012. Proceedings / Branislav Rovan, Vladimiro Sassone, Peter Widmayer (eds.).
Mathematical foundations of computer science 2012 : 37th International Symposium, MFCS 2012, Bratislava, Slovakia, August 27-31, 2012. Proceedings / Branislav Rovan, Vladimiro Sassone, Peter Widmayer (eds.).
Creatore [Symposium on Mathematical Foundations of Computer Science (1972- ) (37th : 2012 : Bratislava, Slovakia)]
Estensione 1 online resource (xv, 838 pages) : illustrations.
Accesso persona Rovan, B. (Branislav)
Sassone, Vladimiro
Widmayer, Peter
Genere/Forma Electronic books
Conference papers and proceedings
Soggetto non controllato Computer science
Data structures (Computer science)
Computational complexity
Algorithm Analysis and Problem Complexity
Discrete Mathematics in Computer Science
Numeric Computing
Mathematical Logic and Formal Languages
Math Applications in Computer Science
ISBN 9783642325892
3642325890
9783642325885
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto On the Complexity of Ontological Reasoning under Disjunctive Existential Rules / Georg Gottlob, Marco Manna, Michael Morak and Andreas Pieris -- New Races in Parameterized Algorithmics / Christian Komusiewicz and Rolf Niedermeier -- Scott Is Always Simple / Antonino Salibra -- A Toolkit for Proving Limitations of the Expressive Power of Logics / Nicole Schweikardt -- How to Reconstruct a Genome / Esko Ukkonen -- Simple Models for Recursive Schemes / Igor Walukiewicz -- Transportation under Nasty Side Constraints / Gerhard J. Woeginger -- Computation of Least Fixed Points / Mihalis Yannakakis -- Unordered Constraint Satisfaction Games / Lauri Ahlroth and Pekka Orponen -- A Polynomial-Time Algorithm for Computing the Maximum Common Subgraph of Outerplanar Graphs of Bounded Degree / Tatsuya Akutsu and Takeyuki Tamura -- Reductions to the Set of Random Strings: The Resource-Bounded Case / Eric Allender, Harry Buhrman, Luke Friedman and Bruno Loff -- Approximate Graph Isomorphism / Vikraman Arvind, Johannes Köbler, Sebastian Kuhnert and Yadu Vasudev -- Near-Optimal Expanding Generator Sets for Solvable Permutation Groups / Vikraman Arvind, Partha Mukhopadhyay, Prajakta Nimbhorkar and Yadu Vasudev -- Generating Functions of Timed Languages / Eugene Asarin, Nicolas Basset, Aldric Degorre and Dominique Perrin -- The Robust Set Problem: Parameterized Complexity and Approximation / Cristina Bazgan and Morgan Chopin -- Mortality for 2 x 2 Matrices Is NP-Hard / Paul C. Bell, Mika Hirvensalo and Igor Potapov -- Solving Counter Parity Games / Dietmar Berwanger, Łukasz Kaiser and Simon Le{szlig}enich -- Drawing Planar Graphs on Points Inside a Polygon / Therese Biedl and Peter Floderus -- New Advances in Reoptimizing the Minimum Steiner Tree Problem / Davide Bilò and Anna Zych -- Smoothed Complexity Theory / Markus Bläser and Bodo Manthey -- Abelian Pattern Avoidance in Partial Words / Francine Blanchet-Sadri and Sean Simmons -- The Complexity of Rerouting Shortest Paths / Paul Bonsma -- Computing with Large Populations Using Interactions / Olivier Bournez, Pierre Fraigniaud and Xavier Koegler -- Pancake Flipping Is Hard / Laurent Bulteau, Guillaume Fertin and Irena Rusu -- In-place Heap Construction with Optimized Comparisons, Moves, and Cache Misses / Jingsen Chen, Stefan Edelkamp, Amr Elmasry and Jyrki Katajainen -- Model Checking Stochastic Branching Processes / Taolue Chen, Klaus Dräger and Stefan Kiefer.
Parameterized Study of the Test Cover Problem / Robert Crowston, Gregory Gutin, Mark Jones, Saket Saurabh and Anders Yeo -- Sitting Closer to Friends Than Enemies, Revisited / Marek Cygan, Marcin Pilipczuk, Michał Pilipczuk and Jakub Onufry Wojtaszczyk -- A Dichotomy Theorem for Homomorphism Polynomials / Nicolas de Rugy-Altherre -- Finite State Transducers for Modular Möbius Number Systems / Martin Delacourt and Petr Kůrka -- Zero-Knowledge Proofs via Polynomial Representations / Giovanni Di Crescenzo and Vadym Fedyukovych -- Cluster Vertex Deletion: A Parameterization between Vertex Cover and Clique-Width / Martin Doucha and Jan Kratochvíl -- On the Impact of Fair Best Response Dynamics / Angelo Fanelli, Luca Moscardelli and Alexander Skopalik -- Fast Balanced Partitioning Is Hard Even on Grids and Trees / Andreas Emil Feldmann -- A Characterization of Bispecial Sturmian Words / Gabriele Fici -- Online Sum-Radii Clustering / Dimitris Fotakis and Paraschos Koutris -- Observe and Remain Silent (Communication-Less Agent Location Discovery) / Tom Friedetzky, Leszek Gąsieniec, Thomas Gorry and Russell Martin -- When Trees Grow Low: Shrubs and Fast MSO1 / Robert Ganian, Petr Hliněný, Jaroslav Nešetřil, Jan Obdržálek and Patrice Ossona de Mendez, et al. -- Strategy Machines and Their Complexity / Marcus Gelderie -- Coloring Graphs Characterized by a Forbidden Subgraph / Petr A. Golovach, Daniël Paulusma and Bernard Ries -- Obtaining Planarity by Contracting Few Edges / Petr A. Golovach, Pim van 't Hof and Daniël Paulusma -- Light Spanners in Bounded Pathwidth Graphs / Michelangelo Grigni and Hao-Hsiang Hung -- Planarizing Gadgets for Perfect Matching Do Not Exist / Rohit Gurjar, Arpita Korwar, Jochen Messner, Simon Straub and Thomas Thierauf -- Kernels for Edge Dominating Set: Simpler or Smaller / Torben Hagerup -- Categories of Coalgebraic Games / Furio Honsell, Marina Lenisa and Rekha Redamalla -- Quasi-recognizable vs MSO Definable Languages of One-Dimensional Overlapping Tiles / (Extended Abstract) / David Janin -- An Improved Approximation Scheme for Variable-Sized Bin Packing / Klaus Jansen and Stefan Kraft -- Gathering an Even Number of Robots in an Odd Ring without Global Multiplicity Detection / Sayaka Kamei, Anissa Lamani, Fukuhito Ooshita and Sébastien Tixeuil -- Reversal Hierarchies for Small 2DFAs / Christos A. Kapoutsis and Giovanni Pighizzini.
Strictness of the Collapsible Pushdown Hierarchy / Alexander Kartzow and Paweł Parys -- Computational Complexity of Smooth Differential Equations / Akitoshi Kawamura, Hiroyuki Ota, Carsten Rösnick and Martin Ziegler -- The Lower Reaches of Circuit Uniformity / Christoph Behle, Andreas Krebs, Klaus-Jörn Lange and Pierre McKenzie -- The Join Levels of the Trotter-Weil Hierarchy Are Decidable / Manfred Kufleitner and Alexander Lauser -- Equations X+A=B and (X+X)+C=(X -- X)+D over Sets of Natural Numbers / Tommi Lehtinen -- Weakly-Synchronized Ground Tree Rewriting (with Applications to Verifying Multithreaded Programs) / Anthony Widjaja Lin -- Descriptional Complexity of Deterministic Regular Expressions / Katja Losemann, Wim Martens and Matthias Niewerth -- Identity Testing, Multilinearity Testing, and Monomials in Read-Once/Twice Formulas and Branching Programs / Meena Mahajan, B.V. Raghavendra Rao and Karteek Sreenivasaiah -- Fine and Wilf's Theorem and Pseudo-repetitions / Florin Manea, Robert Mercaş and Dirk Nowotka -- Taking It to the Limit: Approximate Reasoning for Markov Processes / Kim Guldstrand Larsen, Radu Mardare and Prakash Panangaden -- Asymmetric Swap-Equilibrium: A Unifying Equilibrium Concept for Network Creation Games / Matúš Mihalák and Jan Christoph Schlegel -- Between Tree Patterns and Conjunctive Queries: Is There Tractability beyond Acyclicity? / Filip Murlak, Michał Ogiński and Marcin Przybyłko -- Reducing a Target Interval to a Few Exact Queries / Jesper Nederlof, Erik Jan van Leeuwen and Ruben van der Zwaan -- Maximum Cliques in Graphs with Small Intersection Number and Random Intersection Graphs / Sotiris Nikoletseas, Christoforos Raptopoulos and Paul G. Spirakis -- A Finite Basis for 'Almost Future' Temporal Logic over the Reals / Dorit Pardo (Ordentlich) and Alexander Rabinovich -- Constructing Premaximal Ternary Square-Free Words of Any Level / Elena A. Petrova and Arseny M. Shur -- Regularity Problems for Weak Pushdown [omega]-Automata and Games / Christof Löding and Stefan Repke -- Computational Aspects of Cellular Automata on Countable Sofic Shifts / Ville Salo and Ilkka Törmä -- Computing Lempel-Ziv Factorization Online / Tatiana Starikovskaya -- On Two Stronger Versions of Dejean's Conjecture / Igor N. Tunev and Arseny M. Shur -- Probabilistic Automata and Probabilistic Logic / Thomas Weidner -- A Quadratic Vertex Kernel for Feedback Arc Set in Bipartite Tournaments / Mingyu Xiao and Jiong Guo.
Record Nr. UCHICAGO-11077231
[Symposium on Mathematical Foundations of Computer Science (1972- ) (37th : 2012 : Bratislava, Slovakia)]  
Materiale a stampa
Lo trovi qui: University of Chicago
Combinatorial pattern matching : 23rd Annual Symposium, CPM 2012, Helsinki, Finland, July 3-5, 2012. Proceedings / Juha Kärkkäinen, Jens Stoye (eds.).
Combinatorial pattern matching : 23rd Annual Symposium, CPM 2012, Helsinki, Finland, July 3-5, 2012. Proceedings / Juha Kärkkäinen, Jens Stoye (eds.).
Creatore [CPM (Symposium) (23rd : 2012 : Helsinki, Finland)]
Estensione 1 online resource.
Accesso persona Kärkkäinen, Juha
Stoye, Jens
Genere/Forma Electronic books
Conference papers and proceedings
Soggetto non controllato Computer science
Data structures (Computer science)
Computer software
Electronic data processing
Computational complexity
Optical pattern recognition
Bioinformatics
Pattern Recognition
Algorithm Analysis and Problem Complexity
Numeric Computing
Discrete Mathematics in Computer Science
Data Structures
Computational Biology/Bioinformatics
ISBN 9783642312656
3642312659
9783642312649
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Gene Regulation, Protein Networks and Disease: A Computational Perspective / Ron Shamir -- Wavelet Trees for All / Gonzalo Navarro -- The Maximum Number of Squares in a Tree / Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica and Jakub Radoszewski, et al. -- Faster and Simpler Minimal Conflicting Set Identification / (Extended Abstract) / Aïda Ouangraoua and Mathieu Raffinot -- Partitioning into Colorful Components by Minimum Edge Deletions / Sharon Bruckner, Falk Hüffner, Christian Komusiewicz, Rolf Niedermeier and Sven Thiel, et al. -- Approximation Algorithms and Hardness Results for Shortest Path Based Graph Orientations / Dima Blokh, Danny Segev and Roded Sharan -- Constant-Time Word-Size String Matching / Dany Breslauer, Leszek Gąsieniec and Roberto Grossi -- Pattern Matching in Multiple Streams / Raphaël Clifford, Markus Jalsenius, Ely Porat and Benjamin Sach -- An Efficient Linear Pseudo-minimization Algorithm for Aho-Corasick Automata / Omar AitMous, Frédérique Bassino and Cyril Nicaud -- Efficient Two-Dimensional Pattern Matching with Scaling and Rotation and Higher-Order Interpolation / Christian Hundt and Florian Wendland -- Hardness of Longest Common Subsequence for Sequences with Bounded Run-Lengths / Guillaume Blin, Laurent Bulteau, Minghui Jiang, Pedro J. Tejada and Stéphane Vialette -- Near Linear Time Construction of an Approximate Index for All Maximum Consecutive Sub-sums of a Sequence / Ferdinando Cicalese, Eduardo Laber, Oren Weimann and Raphael Yuster -- The Complexity of String Partitioning / Anne Condon, Ján Maňuch and Chris Thachuk -- Towards an Optimal Space-and-Query-Time Index for Top-k Document Retrieval / Wing-Kai Hon, Rahul Shah and Sharma V. Thankachan -- Document Listing for Queries with Excluded Pattern / Wing-Kai Hon, Rahul Shah, Sharma V. Thankachan and Jeffrey Scott Vitter -- Cross-Document Pattern Matching / Gregory Kucherov, Yakov Nekrich and Tatiana Starikovskaya -- FEMTO: Fast Search of Large Sequence Collections / Michael P. Ferguson -- Speeding Up q-Gram Mining on Grammar-Based Compressed Texts / Keisuke Goto, Hideo Bannai, Shunsuke Inenaga and Masayuki Takeda -- Simple and Efficient LZW-Compressed Multiple Pattern Matching / Paweł Gawrychowski -- Computing the Burrows-Wheeler Transform of a String and Its Reverse / Enno Ohlebusch, Timo Beller and Mohamed I. Abouelhoda -- Efficient Algorithm for Circular Burrows-Wheeler Transform / Wing-Kai Hon, Tsung-Han Ku, Chen-Hua Lu, Rahul Shah and Sharma V. Thankachan -- Least Random Suffix/Prefix Matches in Output-Sensitive Time / Niko Välimäki -- Compressed String Dictionary Look-Up with Edit Distance One / Djamal Belazzougui and Rossano Venturini -- Time-Space Trade-Offs for Longest Common Extensions / Philip Bille, Inge Li Gørtz, Benjamin Sach and Hjalte Wedel Vildhøj -- Local Exact Pattern Matching for Non-fixed RNA Structures / Mika Amit, Rolf Backofen, Steffen Heyne, Gad M. Landau and Mathias Möhl, et al. -- Impact of the Energy Model on the Complexity of RNA Folding with Pseudoknots / Saad Sheikh, Rolf Backofen and Yann Ponty -- Finding Longest Common Segments in Protein Structures in Nearly Linear Time / Yen Kaow Ng, Hirotaka Ono, Ling Ge and Shuai Cheng Li -- A Linear Kernel for the Complementary Maximal Strip Recovery Problem / Haitao Jiang and Binhai Zhu -- Efficient Exponential Time Algorithms for Edit Distance between Unordered Trees / Tatsuya Akutsu, Takeyuki Tamura, Daiji Fukagawa and Atsuhiro Takasu -- Fixed-Parameter Algorithms for Finding Agreement Supertrees / David Fernández-Baca, Sylvain Guillemot, Brad Shutters and Sudheer Vakati -- Computing the Rooted Triplet Distance between Galled Trees by Counting Triangles / Jesper Jansson and Andrzej Lingas -- Minimum Leaf Removal for Reconciliation: Complexity and Algorithms / Riccardo Dondi and Nadia El-Mabrouk -- On the Closest String via Rank Distance / Liviu P. Dinu and Alexandru Popa -- On Approximating String Selection Problems with Outliers / Christina Boucher, Gad M. Landau, Avivit Levy, David Pritchard and Oren Weimann -- The Parameterized Complexity of the Shared Center Problem / Zhi-Zhong Chen, Lusheng Wang and Wenji Ma.
Record Nr. UCHICAGO-11076949
[CPM (Symposium) (23rd : 2012 : Helsinki, Finland)]  
Materiale a stampa
Lo trovi qui: University of Chicago
Algorithms and computation : 22nd International Symposium, ISAAC 2011, Yokohama, Japan, December 5-8, 2011, proceedings / Takao Asano [and others] (eds.).
Algorithms and computation : 22nd International Symposium, ISAAC 2011, Yokohama, Japan, December 5-8, 2011, proceedings / Takao Asano [and others] (eds.).
Creatore [ISAAC (Symposium) (22nd : 2011 : Yokohama-shi, Japan)]
Estensione 1 online resource (xvii, 775 pages).
Disciplina 005.1
Accesso persona Asano, Takao, 1949-
Genere/Forma Electronic books
Conference papers and proceedings
Computer software
Soggetto non controllato Computer science
Computer Communication Networks
Data structures (Computer science)
Computer software
Electronic data processing
Computational complexity
Computer graphics
Algorithm Analysis and Problem Complexity
Discrete Mathematics in Computer Science
Data Structures
Numeric Computing
ISBN 9783642255915
3642255914
9783642255908
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Intro; Title page; Preface; Organization; Table of Contents; Invited Talk I; Algorithm Engineering for Route Planning- An Update -; References; Invited Talk II; Semidefinite Programming and Approximation Algorithms: A Survey; References; Approximation Algorithms I; The School Bus Problem on Trees; Introduction; Our Results; Related Work; Preliminaries; A 4-Approximation to the SBP on Trees; A 12.5-Approximation to the Uncapacitated SBP-R on Trees; References; Improved Approximations for Buy-at-Bulk and Shallow-Light k-Steiner Trees and (k, 2)-Subgraph; Introduction
Shallow-Light Steiner TreesAn O(logn)-Approximation for the (k, 2)-Subgraph Problem; References; Improved Approximation Algorithms for Routing Shop Scheduling; Introduction; Previous Work; Our Results and Techniques; Preliminaries; Routing Open Shop; Routing Flow Shop; References; Contraction-Based Steiner Tree Approximations in Practice; Introduction; History; Contraction Framework; Algorithm Engineering; Experiments; Conclusions and Thoughts; References; Computational Geometry I; Covering and Piercing Disks with Two Centers; Introduction; Intersecting Disks with Two Centers
Decision AlgorithmOptimization Algorithm; Covering Disks with Two Centers; The General Case; The Restricted Case; References; Generating Realistic Roofs over a Rectilinear Polygon; Introduction; Preliminaries; Properties of Realistic Roofs; Local Properties of Valleys and Ridges; Global Structure of Realistic Roofs; Enumerating Realistic Roofs and Computing Optimal Roofs; References; Computing the Visibility Polygon Using Few Variables; Introduction; Preliminaries; An O(n) Algorithm Using O(1) Variables; An O(n logr) Algorithm Using O(logr) Variables; Closing Remarks; References
Minimizing Interference in Ad-Hoc Networks with Bounded Communication RadiusIntroduction; Definitions and Results; Layered Nearest Neighbor Algorithm; Bounded Radius Network; Conclusion; References; Graph Algorithms; Hamiltonian Paths in the Square of a Tree; Introduction; Caterpillars and Horsetails; 2H-Paths in (u,v)-Horsetails; Efficient Algorithm for Horstail Queries; References; Dominating Induced Matchings for P7-free Graphs in Linear Time; Introduction and Basic Notions; Simple Properties of Graphs with Dominating Induced Matching
Structure of P7-free Graphs with Dominating Induced MatchingDistance Levels with Respect to an M-Edge in a P3; Edges in and between Ti and Tj, i =j; The Algorithm for the General P7-free Case; Conclusion; References; Finding Contractions and Induced Minors in Chordal Graphs via Disjoint Paths; Introduction; Preliminaries; Set-Restricted Disjoint Paths; Contractions and Induced Minors in Chordal Graphs; Concluding Remarks; References; Recognizing Polar Planar Graphs Using New Results for Monopolarity; Introduction; Hardness Results; A 2-SAT Approach and a Superclass of Chair-Free Graphs
Record Nr. NYU-006479019
[ISAAC (Symposium) (22nd : 2011 : Yokohama-shi, Japan)]  
Materiale a stampa
Lo trovi qui: New York University