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.
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 | |
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 | |
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 | |
Foundational and practical aspects of resource analysis : second International Workshop, FOPARA 2011, Madrid, Spain, May 19, 2011, Revised selected papers / Ricardo Peña, Marko van Eekelen, Olha Shkaravska (eds.).
| Foundational and practical aspects of resource analysis : second International Workshop, FOPARA 2011, Madrid, Spain, May 19, 2011, Revised selected papers / Ricardo Peña, Marko van Eekelen, Olha Shkaravska (eds.). |
| Creatore | [FOPARA (Workshop) (2nd : 2011 : Madrid, Spain)] |
| Estensione | 1 online resource (141 pages) : illustrations. |
| Disciplina | 005.1/2 |
| Accesso persona |
Peña, Ricardo, 1950-
Eekelen, M. C. J. D. van. Shkaravska, Olha |
| Genere/Forma |
Electronic books
Conference papers and proceedings |
| Soggetto non controllato |
Computer science
Computer system performance Software engineering Computer software Logic design System Performance and Evaluation Algorithm Analysis and Problem Complexity Logics and Meanings of Programs Programming Languages, Compilers, Interpreters Computation by Abstract Devices |
| ISBN |
9783642324956
3642324959 9783642324949 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | A Higher-Order Characterization of Probabilistic Polynomial Time / Ugo Dal Lago and Paolo Parisen Toldin -- Typing a Core Binary-Field Arithmetic in a Light Logic / Emanuele Cesena, Marco Pedicini and Luca Roversi -- Interpolation-Based Height Analysis for Improving a Recurrence Solver / Manuel Montenegro, Olha Shkaravska, Marko van Eekelen and Ricardo Peña -- Interval-Based Resource Usage Verification: Formalization and Prototype / Pedro Lopez-Garcia, Luthfi Darmawan, Francisco Bueno and Manuel Hermenegildo -- Certifying and Reasoning on Cost Annotations of Functional Programs / Roberto M. Amadio and Yann Régis-Gianas -- On Abstractions for Timing Analysis in the \mathbbKK Framework / Mihail Asăvoae, Irina Măriuca Asăvoae and Dorel Lucanu -- Certifying Execution Time / Vítor Rodrigues, João Pedro Pedroso, Mário Florido and Simão Melo de Sousa -- Counter Automata for Parameterised Timing Analysis of Box-Based Systems / Christoph A. Herrmann and Kevin Hammond. |
| Record Nr. | NYU-004623658 |
|
[FOPARA (Workshop) (2nd : 2011 : Madrid, Spain)]
|
|
| Materiale a stampa | |
| Lo trovi qui: New York University | |
Wireless internet : 6th International ICST Conference, WICON 2011, Xi'an, China, October 19-21, 2011, Revised selected papers / Pinyi Ren [and others] (eds.).
| Wireless internet : 6th International ICST Conference, WICON 2011, Xi'an, China, October 19-21, 2011, Revised selected papers / Pinyi Ren [and others] (eds.). |
| Creatore | [International Conference on Wireless Internet (6th : 2011 : Xi'an, China)] |
| Estensione | 1 online resource. |
| Disciplina | 004.67/8 |
| Accesso persona | Ren, Pinyi |
| Genere/Forma |
Electronic books
Conference papers and proceedings |
| Soggetto non controllato |
Computer science
Computer Communication Networks Computer software Artificial intelligence Information Systems Algorithm Analysis and Problem Complexity Information Systems Applications (incl. Internet) Computation by Abstract Devices Management of Computing and Information Systems |
| ISBN |
9783642304934
3642304931 3642304923 9783642304927 |
| Classificazione |
54.84
53.72 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
pt. 1. PHY Track. Optimal Joint Subcarrier Assignment and Power Allocation for Multi-user Video Streaming over OFDMA Downlink Systems / Fan Li, Pinyi Ren and Qinghe Du -- Throughput and Sensing Bandwidth Tradeoff in Cognitive Radio Networks / Wenshan Yin, Pinyi Ren and Shuangcheng Yan -- A Common Symbol Timing Offset Synchronization (post FFT) Method for OFDM System / Di Na, Ji longli, Yang Ming and Gao Peng -- Statistical QoS Driven Power and Rate Allocation over Rayleigh Fading Cognitive Radio Links / Yichen Wang, Pinyi Ren and Qinghe Du -- Joint Subcarrier and Power Allocation Considering Fairness in OFDM-Based Cognitive Radio Systems / Shuangcheng Yan, Pinyi Ren and Yu Hong -- Analysis and Implementation of a Precise Paging Mode in Co-LAC for 2G/3G Convergence Core Networks with Path Diversity / Yu Su and Xian Feng -- Peak-to-Average Power-Ratio Reduction Scheme Employing Fountain Codes / Juan Zhou, Ying Shen and Youxi Tang -- Antenna Location Design for Distributed Antenna Systems Based on Timing Acquisition / Tian Xia, Chaojin Qing, Shihai Shao, Mintao Zhang and Youxi Tang -- A Novel Image Transmission System Based on Joint Source-Channel Coding / Junhong Chen and Qinyu Zhang.
Uplink Interference Rejection Combining for WCDMA Using Multiple Antennas / Zhanghong Hao, Hongzhi Zhao, Taofu Mo, Youxi Tang and Huiyue Yu -- A Simplified Fair Scheduling Algorithm for Multiuser MIMO System / Zhao Shen, Daiyu Fu and Fan Jin -- A New Cooperative Spectrum Sensing Scheme for Cognitive Ad-Hoc Networks / Yang Du, Hongxiang Li, Sentang Wu, Weiyao Lin and Xudong Wang -- Iterative DS-CDMA Anti-interference Technique Based on Interference Power Cognition / Taofu Mo, Zhanghong Hao and Youxi Tang -- Outage-Based Optimal Transmit Antenna Location for Distributed Antenna Systems with Selection Transmission / Liang Han, Tian Liu, Shihai Shao, Chaojin Qing and Youxi Tang -- Signal Detection for Joint Distributed Space-Time Coding in Asynchronous Cooperative Cellular Systems / Zhuo Wu, Luodan Liu and Xin Wang -- Enhanced Algorithm for MMIB in Distributed MIMO System / Jian Sun, Shidong Zhou, Xibin Xu, Yunzhou Li and Jing Wang -- A Novel Transmission Scheme Based on Sine/Chirp Hybrid Carriers / Qiming Zhao, Qinyu Zhang and Naitong Zhang -- Dynamic Bayesian Spectrum Bargaining with Non-myopic Users / Yang Yan, Jianwei Huang, Ming Zhao and Jing Wang. Study on Frequency Synchronization in 3GPP LTE System for FDD and TDD Modes / Meilin Wang, Xin Qi, Limin Xiao, Min Huang and Ming Zhao -- Optimal Power Allocation for OFDM-Based Wire-Tap Channels with Arbitrarily Distributed Inputs / Haohao Qin, Yin Sun, Xiang Chen, Ming Zhao and Jing Wang -- MASS: Multiple ASSociation Scheme in IEEE 802.11 Wireless Mesh Networks / Haidong Zhang, Pin Lv, Yingwen Chen and Ming Xu -- A Weighted UWB Transmitted-Reference Receiver for Indoor Positioning Using MMSE Estimation / Gang Yang, Hui Jiang, Zhiqiang Bao and Jie Shan -- Multi-cell Joint Detection and Macrodiversity for TD-SCDMA Trunking System / Xiaoxiang Shen, Hui Zhi, Shixiang Shao and Meiling Ding -- New Half-Voting Cooperative Sensing Algorithms in Cognitive Radio / Haijun Wang, Yi Xu, Xin Su, Jie Zeng and Jing Wang -- Fast Blind Spectrum Sensing Method Based on Multi-stage Wiener Filter / Zhiqiang Bao, Guangyue Lu, Gang Yang and Huang Qingdong -- A Distributed Resource Admission Control Mechanism Supporting Multicast and Heterogeneous Receivers for MANETs / Wei Wu, Jianli Guo, Xuan Zhu, Huixing Peng and Lianhe Luo, et al. -- Visual Cognitive Radio / Tian Liu, Daixiong Ye, Shihai Shao, Youxi Tang and Juan Zhou. A Full-Rate Cooperative Communication Strategy in Wireless Relay Networks / Lei Zhan, Fei Yang, Sihai Zhang and Wuyang Zhou -- A Semi-distributed Network Selection Scheme in Heterogeneous Wireless Networks / Juan Fan, Sihai Zhang and Wuyang Zhou -- A Practical Performance Analysis of CRS-Aided Channel Estimation Algorithms for LTE Downlink System / Yannan Yuan, Lianfen Huang, Ruogui Xiao, Xin Qi and Min Huang -- A Joint Optimal Algorithm Based on Relay Nodes Selection and Power Allocation / Zhao Shen, Daiyu Fu and Yu Jin -- A Novel Simple User Scheduling Algorithm for MIMO Downlink System / Haitao Lin, Zhao Shen and Desheng Wang -- Frequency Saving OFDMA Resource Allocation with QoS Provision / Guanying Ru, Hongxiang Li, Yanhui Lu, Yong Cheng and Weiyao Lin -- Distributed Fast Convergent Power Allocation Algorithm in Underlay Cognitive Radio Networks / Yanan Mei, Yanhui Lu, Xiaomin Mu and Xin Liu -- An Adaptive Anti-narrowband Jamming Receiver for CI/OFDM System / Xiaohu Chen, Jun Wang, Pei Gao and ShaoQian Li -- Cooperative Coarse Timing Synchronization for OFDM-Based Distributed Antenna Systems / Chaojin Qing, Shihai Shao, Mintao Zhang and Youxi Tang -- Pilot Design Based on Distributed Transmit Antennas in V-BLAST for Full Frequency Reuse / Zhigang Li, Tian Liu, Shihai Shao and Youxi Tang. Energy-Efficient Distributed Relay Selection Based on Statistical Channel State Information / Haifang Jiang, Sihai Zhang and Wuyang Zhou -- Secondary User Selection in Cooperative Sensing Scheduling: A Spectrum Opportunity-Energy Tradeoff View / Xiangxia Sun, Tengyi Zhang and Danny H.K. Tsang -- Performance Analysis of Opportunistic Spectrum Sharing System / Wanbin Tang, Yanfeng Han, Hua Jin and ShaoQian Li -- A Cellular-Assisted Mobile UE Cluster Head Selection Algorithm for Wireless Sensor Networks / Lianhai Shan, Yuling Ouyang, Zhi Yuan, Honglin Hu and Zhenhong Li -- pt. 2. Network and Application Track. Interference Mitigation Based on Enhanced Interference PMI Notification / Jiqing Ni, Bingquan Li, Zesong Fei and Jingming Kuang -- Machine Learning Based Autonomous Network Flow Identifying Method / Hongbo Shi, Tomoki Hamagami and Haoyuan Xu -- Leasing and Pricing Strategies for Wireless Service Providers in Dynamic Spectrum Sharing / Peipei Chen, Qinyu Zhang and Yazhen Ren -- LRD Traffic Predicting Based on ARMA / Bo Gao, Qinyu Zhang and Naitong Zhang -- The Master-Slave Stochastic Knapsack Modelling for Fully Dynamic Spectrum Allocation / Sihai Zhang, Fei Yang and Wuyang Zhou. Evaluation and Enhancement of TCP with Network Coding in Wireless Multihop Networks / Yanli Xu, Xiaolin Bai, Ping Wu and Lianghui Ding -- Fine-Grained Metrics for Quantifying Admission Control Performance in Mobile Ad Hoc Networks / Jianli Guo, Wei Wu, Xiaoxia Liu, Lianhe Luo and Changjiang Yan, et al. -- WiEyeTNB: A Wireless Sensor Based Drowning Detection System for Enhanced Parental Care / Balaji Hariharan, Riji N. Das and Arjun S. -- An Effective Scheme for Detecting Articulation Points in Zone Routing Protocol / Tsung-Chuan Huang, Wei-Chung Cheng and Lung Tang -- Demand-Matching Spectrum Sharing in Cognitive Radio Networks: A Classified Game / Shaohang Cui and Jun Cai -- QoS-Based Spectrum Access Control in MIMO Cognitive Radio Networks / Mei Rong and Shihua Zhu -- pt. 3. Hardware Track. A Tunable CMOS Continuous-Time Filter Designed for a 5.8 GHz ETC Demodulator / Hang Yu, Lai Jiang, Shengyue Lin, Yan Li and Rongchen Wei, et al. -- An Offset-Free 10 MHz Limiting Amplifier Designed for a 5.8 GHz ETC Receiver / Lai Jiang, Hang Yu, Rongchen Wei, Yan Li and Shengyue Lin, et al. -- A Novel Miniature Four-Band CPW-Fed Antenna Optimized Using ISPO Algorithm / Huihui Li, Xuanqin Mou, Zhen Ji, Hang Yu and Yan Li, et al. |
| Record Nr. | NYU-004624935 |
|
[International Conference on Wireless Internet (6th : 2011 : Xi'an, China)]
|
|
| Materiale a stampa | |
| Lo trovi qui: New York University | |
Algorithmic learning theory : 23rd International Conference, ALT 2012, Lyon, France, October 29-31, 2012. Proceedings / Nader H. Bshouty [and others] (eds.).
| Algorithmic learning theory : 23rd International Conference, ALT 2012, Lyon, France, October 29-31, 2012. Proceedings / Nader H. Bshouty [and others] (eds.). |
| Creatore | [ALT 2012 (2012 : Lyon, France)] |
| Estensione | 1 online resource. |
| Disciplina | 006.3/1 |
| Accesso persona | Bshouty, Nader H. |
| Genere/Forma |
Electronic books
Conference papers and proceedings |
| Soggetto non controllato |
Computer science
Computer software Logic design Artificial intelligence Optical pattern recognition Mathematical Logic and Formal Languages Algorithm Analysis and Problem Complexity Computation by Abstract Devices |
| ISBN |
9783642341069
3642341063 3642341055 9783642341052 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Editors' Introduction / Nader H. Bshouty, Gilles Stoltz, Nicolas Vayatis and Thomas Zeugmann -- Declarative Modeling for Machine Learning and Data Mining / Luc De Raedt -- Learnability beyond Uniform Convergence / Shai Shalev-Shwartz -- Some Rates of Convergence for the Selected Lasso Estimator / Pascal Massart and Caroline Meynet -- Recent Developments in Pattern Mining / Toon Calders -- Exploring Sequential Data / Gilbert Ritschard -- Enlarging Learnable Classes / Sanjay Jain, Timo Kötzing and Frank Stephan -- Confident and Consistent Partial Learning of Recursive Functions / Ziyuan Gao and Frank Stephan -- Automatic Learning from Positive Data and Negative Counterexamples / Sanjay Jain and Efim Kinber -- Regular Inference as Vertex Coloring / Christophe Costa Florêncio and Sicco Verwer -- Sauer's Bound for a Notion of Teaching Complexity / Rahim Samei, Pavel Semukhin, Boting Yang and Sandra Zilles -- On the Learnability of Shuffle Ideals / Dana Angluin, James Aspnes and Aryeh Kontorovich -- New Analysis and Algorithm for Learning with Drifting Distributions / Mehryar Mohri and Andres Muñoz Medina -- On the Hardness of Domain Adaptation and the Utility of Unlabeled Target Samples / Shai Ben-David and Ruth Urner -- Efficient Protocols for Distributed Classification and Optimization / Hal Daumé III, Jeff M. Phillips, Avishek Saha and Suresh Venkatasubramanian.
The Safe Bayesian / Learning the Learning Rate via the Mixability Gap / Peter Grünwald -- Data Stability in Clustering: A Closer Look / Lev Reyzin -- Thompson Sampling: An Asymptotically Optimal Finite-Time Analysis / Emilie Kaufmann, Nathaniel Korda and Rémi Munos -- Regret Bounds for Restless Markov Bandits / Ronald Ortner, Daniil Ryabko, Peter Auer and Rémi Munos -- Minimax Number of Strata for Online Stratified Sampling Given Noisy Samples / Alexandra Carpentier and Rémi Munos -- Weighted Last-Step Min-Max Algorithm with Improved Sub-logarithmic Regret / Edward Moroshko and Koby Crammer -- Online Prediction under Submodular Constraints / Daiki Suehiro, Kohei Hatano, Shuji Kijima, Eiji Takimoto and Kiyohito Nagano -- Lower Bounds on Individual Sequence Regret / Eyal Gofer and Yishay Mansour -- A Closer Look at Adaptive Regret / Dmitry Adamskiy, Wouter M. Koolen, Alexey Chernov and Vladimir Vovk -- Partial Monitoring with Side Information / Gábor Bartók and Csaba Szepesvári -- PAC Bounds for Discounted MDPs / Tor Lattimore and Marcus Hutter -- Buy Low, Sell High / Wouter M. Koolen and Vladimir Vovk -- Kernelization of Matrix Updates, When and How? / Manfred K. Warmuth, Wojciech Kotłowski and Shuisheng Zhou -- Predictive Complexity and Generalized Entropy Rate of Stationary Ergodic Processes / Mrinalkanti Ghosh and Satyadev Nandakumar. |
| Record Nr. | NYU-004624990 |
|
[ALT 2012 (2012 : Lyon, France)]
|
|
| Materiale a stampa | |
| Lo trovi qui: New York University | |
Transactions on computational collective intelligence VI / Ngoc Thanh Nguyen (ed.).
| Transactions on computational collective intelligence VI / Ngoc Thanh Nguyen (ed.). |
| Estensione | 1 online resource. |
| Disciplina | 006.3 |
| Accesso persona | Nguyen, Ngoc Thanh (Computer scientist) |
| Genere/Forma | Electronic books |
| Soggetto non controllato |
Computer science
Computer Communication Networks Software engineering Information storage and retrieval systems Artificial intelligence Information Systems Applications (incl. Internet) Information Storage and Retrieval Computation by Abstract Devices |
| ISBN |
9783642293566
3642293565 9783642293559 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | On the Pattern Recognition and Classification of Stochastically Episodic Events / Colin Bellinger and B. John Oommen -- Paraconsistent Reasoning for Semantic Web Agents / Linh Anh Nguyen and Andrzej Szałas -- An Agent Model for Cognitive and Affective Empathic Understanding of Other Agents / Zulfiqar A. Memon and Jan Treur -- Multiagent Based Simulation as a Supply Chain Analysis Workbench / Jacek Jakieła, Paweł Litwin and Marcin Olech -- On the Effective Distribution and Maintenance of Knowledge Represented by Complementary Graphs / Leszek Kotulski and Adam Sędziwy -- Agent System for Managing Distributed Mobile Interactive Documents in Knowledge-Based Organizations / Magdalena Godlewska -- Agent Cooperation within Adversarial Teams in Dynamic Environment -- Key Issues and Development Trends / Bartłomiej Józef Dzieńkowski and Urszula Markowska-Kaczmar -- On Pricing Strategies of Boundedly Rational Telecommunication Operators / Bogumil Kaminski and Maciej Latek -- Reasoning about Time-Dependent Multi-agents: Foundations of Theorem Proving and Model Checking / Norihiro Kamide -- Learning Predictive Models for Financial Time Series by Using Agent Based Simulations / Filippo Neri. |
| Record Nr. | NYU-004623086 |
| Materiale a stampa | |
| Lo trovi qui: New York University | |
Software service and application engineering : essays dedicated to Bernd Krämer on the occasion of his 65th birthday / Maritta Heisel (ed.).
| Software service and application engineering : essays dedicated to Bernd Krämer on the occasion of his 65th birthday / Maritta Heisel (ed.). |
| Estensione | 1 online resource : color illustrations, color portrait. |
| Disciplina | 005.1 |
| Accesso persona | Heisel, Maritta |
| Genere/Forma | Electronic books |
| Soggetto non controllato |
Computer science
Computer Communication Networks Software engineering Logic design Logics and Meanings of Programs Computation by Abstract Devices Information Systems Applications (incl. Internet) |
| ISBN |
9783642308352
364230835X 3642308341 9783642308345 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | A Fresh Look at Petri Net Extensions / Wolfgang Reisig -- Modelling of Communication Platforms Using Algebraic High-Level Nets and Their Processes / Karsten Gabriel and Hartmut Ehrig -- Modeling Revisited / Herbert Weber -- A Conceptual Framework and Experimental Workbench for Architectures / Marco Konersmann and Michael Goedicke -- Virtual Computing: The Emperor's New Clothes? / Djamshid Tavangarian -- Linked Compute Units and Linked Experiments: Using Topology and Orchestration Technology for Flexible Support of Scientific Applications / Frank Leymann -- Pattern-Based Context Establishment for Service-Oriented Architectures / Kristian Beckers, Stephan Faßbender, Maritta Heisel and Rene Meis -- Cloud Blueprints for Integrating and Managing Cloud Federations / Michael P. Papazoglou -- Dynamic Service Composition and Deployment with OpenRichServices / Ingolf Krüger, Barry Demchak and Massimiliano Menarini -- An Architecture for Dynamic Service-Oriented Computing in Networked Embedded Systems / Kirill Mechitov and Gul Agha -- Location-Based Services for Technology Enhanced Learning and Teaching / Christoph Rensing, Stephan Tittel and Ralf Steinmetz. |
| Record Nr. | NYU-004623087 |
| Materiale a stampa | |
| Lo trovi qui: New York University | |
