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.
Conceptual structures for STEM research and education : 20th International Conference on Conceptual Structures, ICCS 2013, Mumbai, India, January 10-12, 2013. Proceedings / Heather D. Pfeiffer, Dmitry I. Ignatov, Jonas Poelmans, Nagarjuna Gadiraju (Eds.).
Conceptual structures for STEM research and education : 20th International Conference on Conceptual Structures, ICCS 2013, Mumbai, India, January 10-12, 2013. Proceedings / Heather D. Pfeiffer, Dmitry I. Ignatov, Jonas Poelmans, Nagarjuna Gadiraju (Eds.).
Creatore [International Conference on Conceptual Structures (20th : 2013 : Mumbai, India)]
Estensione 1 online resource (xi, 331 pages) : illustrations.
Disciplina 003/.54
Accesso persona Pfeiffer, Heather D., editor.
Ignatov, Dmitry I., editor.
Poelmans, Jonas, editor
Gadiraju, Nagarjuna, editor
Genere/Forma Congresses
Electronic books
Conference papers and proceedings
Soggetto non controllato Computer science
Computational complexity
Database management
Artificial intelligence
Optical pattern recognition
Discrete Mathematics in Computer Science
Information Storage and Retrieval
Pattern Recognition
ISBN 9783642357862
3642357865
3642357857
9783642357855
Classificazione 54.72
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Invited Talks -- Conceptual Structures for STEM Data / Su White -- Relating Language to Perception, Action, and Feelings / Arun K. Majumdar, John F. Sowa -- PurposeNet: A Knowledge Base Organized around Purpose / Rajeev Sangal, Soma Paul, P. Kiran Mayee -- Accepted Papers -- Classical Syllogisms in Logic Teaching / Peter Øhrstrøm, Ulrik Sandborg-Petersen, Steinar Thorvaldsen, Thomas Ploug -- A Model to Compare and Manipulate Situations Represented as Semantically Labeled Graphs / Michał K. Szczerbak, Ahmed Bouabdallah, François Toutain, Jean-Marie Bonnin -- Analyzing Clusters and Constellations from Untwisting Shortened Links on Twitter Using Conceptual Graphs / Emma L. Tonkin, Heather D. Pfeiffer, Gregory J.L. Tourte -- Taking SPARQL 1.1 Extensions into Account in the SWIP System / Fabien Amarger, Ollivier Haemmerlé, Nathalie Hernandez, Camille Pradel -- System Architecture to Implement a Conceptual Graphs Storage in an RDF Quad Store / Khalil Ben Mohamed, Benjamin Chu Min Xian, Dickson Lukose.
Medical Archetypes and Information Extraction Templates in Automatic Processing of Clinical Narratives / Ivelina Nikolova, Galia Angelova, Dimitar Tcharaktchiev, Svetla Boytcheva -- Using Conceptual Structures in the Design of Computer-Based Assessment Software / Uta Priss, Nils Jensen, Oliver Rod -- Modeling Ontological Structures with Type Classes in Coq / Richard Dapoigny, Patrick Barlatier -- Parse Thicket Representation for Multi-sentence Search / Boris A. Galitsky, Sergei O. Kuznetsov, Daniel Usikov -- FCA-Based Models and a Prototype Data Analysis System for Crowdsourcing Platforms / Dmitry I. Ignatov, Alexandra Yu. Kaminskaya, Anastasya A. Bezzubtseva -- Toward a Peircean Theory of Human Learning: Revealing the Misconception of Belief Revision / Mary Keeler, Uta Priss -- The First-Order Logical Environment / Robert E. Kent -- Designing Learning to Research the Formal Concept Analysis of Transactional Data / Martin Watmough, Simon Polovina, Simon Andrews.
Cross-Domain Inference Using Conceptual Graphs in Context of Laws of Science / Shreya Inamdar -- Summarizing Conceptual Graphs for Automatic Summarization Task / Sabino Miranda-Jiménez, Alexander Gelbukh, Grigori Sidorov -- Logical Form vs. Logical Form: How Does the Difference Matter for Semantic Computationality? / Prakash Mondal -- Model for Knowledge Representation of Multidimensional Measurements Processing Results in the Environment of Intelligent GIS / Alexander Vitol, Nataly Zhukova, Andrey Pankin -- Accepted Papers -- Transformation of SBVR Business Rules to UML Class Model / Stuti Awasthi, Ashalatha Nayak -- Representation of the Event Bush Approach in Terms of Directed Hypergraphs / Cyril A. Pshenichny, Dmity I. Mouromtsev -- Concept Lattices of a Relational Structure / Jens Kötters -- Representing Median Networks with Concept Lattices / Uta Priss -- Txt2vz: A New Tool for Generating Graph Clouds / Laurie Hirsch, David Tian.
Record Nr. NYU-004389894
[International Conference on Conceptual Structures (20th : 2013 : Mumbai, India)]  
Materiale a stampa
Lo trovi qui: New York University
Developments in language theory : 17th International Conference, DLT 2013, Marne-la-Vallée, France, June 18-21, 2013. Proceedings / Marie-Pierre Béal, Olivier Carton (eds.).
Developments in language theory : 17th International Conference, DLT 2013, Marne-la-Vallée, France, June 18-21, 2013. Proceedings / Marie-Pierre Béal, Olivier Carton (eds.).
Creatore [Conference on Developments in Language Theory (17th : 2013 : Marne-la-Vallée, France)]
Estensione 1 online resource (xiii, 460 pages) : illustrations.
Disciplina 005.13/1
Accesso persona Béal, Marie-Pierre
Carton, Olivier
Genere/Forma Congresses
Electronic books
Conference papers and proceedings
Soggetto non controllato Computer science
Computer software
Computational complexity
Computation by Abstract Devices
Mathematical Logic and Formal Languages
Algorithm Analysis and Problem Complexity
Discrete Mathematics in Computer Science
ISBN 9783642387715
3642387713
3642387705
9783642387708
Classificazione 54.10
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Invited Talks. Ultrametric Finite Automata and Turing Machines / Rūsiņš Freivalds -- Recompression: Word Equations and Beyond / Artur Jeż -- Joint Spectral Characteristics: A Tale of Three Disciplines / Raphaël M. Jungers -- Unambiguous Finite Automata / Christof Löding -- An Explicit Formula for the Intersection of Two Polynomials of Regular Languages / Jean-Éric Pin.
Regular Papers. Two Dimensional Prefix Codes of Pictures / Marcella Anselmo, Dora Giammarresi, Maria Madonia -- Adjacent Ordered Multi-Pushdown Systems / Mohamed Faouzi Atig, K. Narayan Kumar, Prakash Saivasan -- Cuts in Regular Expressions / Martin Berglund, Henrik Björklund, Frank Drewes, Brink van der Merwe, Bruce Watson -- Quantum Finite Automata and Linear Context-Free Languages: A Decidable Problem / Alberto Bertoni, Christian Choffrut, Flavio D'Alessandro -- On the Asymptotic Abelian Complexity of Morphic Words / Francine Blanchet-Sadri, Nathan Fox -- Strict Bounds for Pattern Avoidance / Francine Blanchet-Sadri, Brent Woodhouse -- A Fresh Approach to Learning Register Automata / Benedikt Bollig, Peter Habermehl, Martin Leucker, Benjamin Monmege -- Suffixes, Conjugates and Lyndon Words / Silvia Bonomo, Sabrina Mantaci, Antonio Restivo, Giovanna Rosone, Marinella Sciortino -- Extremal Words in the Shift Orbit Closure of a Morphic Sequence / James D. Currie, Narad Rampersad, Kalle Saari -- Inner Palindromic Closure / Jürgen Dassow, Florin Manea, Robert Mercaş, Mike Müller -- On the Dual Post Correspondence Problem / Joel D. Day, Daniel Reidenbach, Johannes C. Schneider.
One-Way Multi-Head Finite Automata with Pebbles But No States / Martin Kutrib, Andreas Malcher, Matthias Wendlandt -- Regular Expressions with Binding over Data Words for Querying Graph Databases / Leonid Libkin, Tony Tan, Domagoj Vrgoč -- Factorizations and Universal Automaton of Omega Languages / Vincent Carnino, Sylvain Lombardy -- Deciding Determinism of Unary Languages Is coNP-Complete / Ping Lu, Feifei Peng, Haiming Chen -- Ultimate Periodicity of b-Recognisable Sets: A Quasilinear Procedure / Victor Marsault, Jacques Sakarovitch -- 3-Abelian Cubes Are Avoidable on Binary Alphabets / Robert Mercaş, Aleksi Saarela -- Repetition Avoidance in Circular Factors / Hamoon Mousavi, Jeffrey Shallit -- Operator Precedence ω-Languages / Federica Panella, Matteo Pradella, Violetta Lonati, Dino Mandrioli -- New Results on Deterministic Sgraffito Automata / Daniel Průša, František Mráz, Friedrich Otto -- On the Number of Abelian Bordered Words / Narad Rampersad, Michel Rigo, Pavel Salimov -- Proof of a Phase Transition in Probabilistic Cellular Automata / Damien Regnault -- Languages with a Finite Antidictionary: Growth-Preserving Transformations and Available Orders of Growth / Arseny M. Shur.
Brzozowski Algorithm Is Generically Super-Polynomial for Deterministic Automata / Sven De Felice, Cyril Nicaud -- A Coloring Problem for Sturmian and Episturmian Words / Aldo de Luca, Elena V. Pribavkina, Luca Q. Zamboni -- The Chomsky-Schützenberger Theorem for Quantitative Context-Free Languages / Manfred Droste, Heiko Vogler -- Operational Characterization of Scattered MCFLs / Zoltán Ésik, Szabolcs Iván -- Abelian Repetitions in Sturmian Words / Gabriele Fici, Alessio Langiu, Thierry Lecroq, Arnaud Lefebvre, Filippo Mignosi -- Composition Closure of ε-Free Linear Extended Top-Down Tree Transducers / Zoltán Fülöp, Andreas Maletti -- Subword Complexity and k-Synchronization / Daniel Goč, Luke Schaeffer, Jeffrey Shallit -- Some Decision Questions Concerning the Time Complexity of Language Acceptors / Oscar H. Ibarra, Bala Ravikumar -- Unambiguous Conjunctive Grammars over a One-Letter Alphabet / Artur Jeż, Alexander Okhotin -- Alternative Automata Characterization of Piecewise Testable Languages / Ondřej Klíma, Libor Polák -- Finite Automata with Advice Tapes / Uğur Küçük, A.C. Cem Say, Abuzer Yakaryılmaz.
Record Nr. NYU-004402759
[Conference on Developments in Language Theory (17th : 2013 : Marne-la-Vallée, France)]  
Materiale a stampa
Lo trovi qui: New York University
Approximation and Online Algorithms : 9th International Workshop, WAOA 2011, Saarbrücken, Germany, September 8-9, 2011, Revised selected papers / Roberto Solis-Oba, Giuseppe Persiano (eds.).
Approximation and Online Algorithms : 9th International Workshop, WAOA 2011, Saarbrücken, Germany, September 8-9, 2011, Revised selected papers / Roberto Solis-Oba, Giuseppe Persiano (eds.).
Creatore [WAOA 2011 (2011 : Saarbrücken, Germany)]
Estensione 1 online resource (x, 273 pages).
Disciplina 005.1
Accesso persona Solis-Oba, Roberto
Persiano, Giuseppe
Genere/Forma Electronic books
Conference papers and proceedings
Soggetto non controllato Computer science
Computer software
Electronic data processing
Computational complexity
Algorithms
Algorithm Analysis and Problem Complexity
Discrete Mathematics in Computer Science
Numeric Computing
Information Systems Applications (incl. Internet)
ISBN 9783642291166
3642291163
3642291155
9783642291159
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Approximation Algorithms for Scheduling and Packing Problems / Klaus Jansen -- Approximating Subset k-Connectivity Problems / Zeev Nutov -- Learning in Stochastic Machine Scheduling / Sebastián Marbán, Cyriel Rutten and Tjark Vredeveld -- An Online Algorithm Optimally Self-tuning to Congestion for Power Management Problems / Wolfgang Bein, Naoki Hatta, Nelson Hernandez-Cons, Hiro Ito and Shoji Kasahara, et al. -- Single Approximation for Biobjective Max TSP / Cristina Bazgan, Laurent Gourvès, Jérôme Monnot and Fanny Pascual -- Parameterized Approximation Algorithms for Hitting Set / Ljiljana Brankovic and Henning Fernau -- Approximation Algorithms for the Maximum Leaf Spanning Tree Problem on Acyclic Digraphs / Nadine Schwartges, Joachim Spoerhase and Alexander Wolff -- Optimization over Integers with Robustness in Cost and Few Constraints / Kai-Simon Goetzmann, Sebastian Stiller and Claudio Telha -- A Lower Bound on Deterministic Online Algorithms for Scheduling on Related Machines without Preemption / Tomáš Ebenlendr and Jiří Sgall -- Scheduling Jobs on Identical and Uniform Processors Revisited / Klaus Jansen and Christina Robenek.
Approximation Algorithms for Fragmenting a Graph against a Stochastically-Located Threat / David B. Shmoys and Gwen Spencer -- Non-clairvoyant Weighted Flow Time Scheduling on Different Multi-processor Models / Jianqiao Zhu, Ho-Leung Chan and Tak-Wah Lam -- A New Perspective on List Update: Probabilistic Locality and Working Set / Reza Dorrigiv and Alejandro López-Ortiz -- OnlineMin: A Fast Strongly Competitive Randomized Paging Algorithm / Gerth Stølting Brodal, Gabriel Moruz and Andrei Negoescu -- Faster and Simpler Approximation of Stable Matchings / Katarzyna Paluch -- Simpler 3/4-Approximation Algorithms for MAX SAT / Anke van Zuylen -- On Online Algorithms with Advice for the k-Server Problem / Marc P. Renault and Adi Rosén -- Improved Lower Bound for Online Strip Packing / (Extended Abstract) / Rolf Harren and Walter Kern -- Competitive Router Scheduling with Structured Data / Yishay Mansour, Boaz Patt-Shamir and Dror Rawitz -- Approximation with a Fixed Number of Solutions of Some Biobjective Maximization Problems / Cristina Bazgan, Laurent Gourvès and Jérôme Monnot -- Generalized Maximum Flows over Time / Martin Groß and Martin Skutella -- The Price of Anarchy for Minsum Related Machine Scheduling / Ruben Hoeksma and Marc Uetz.
Record Nr. NYU-004622260
[WAOA 2011 (2011 : Saarbrücken, Germany)]  
Materiale a stampa
Lo trovi qui: New York University
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).
Disciplina 004
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.
A O(1/ε2)n-Time Sieving Algorithm for Approximate Integer Programming / Daniel Dadush -- Two-Dimensional Range Diameter Queries / Pooya Davoodi, Michiel Smid and Freek van Walderveen -- An Improved Upper Bound on the Density of Universal Random Graphs / Domingos Dellamonica, Yoshiharu Kohayakawa, Vojtěch Rödl and Andrzej Ruciński -- Logspace Computations in Graph Groups and Coxeter Groups / Volker Diekert, Jonathan Kausch and Markus Lohrey -- Approximating the Edge Length of 2-Edge Connected Planar Geometric Graphs on a Set of Points / Stefan Dobrev, Evangelos Kranakis, Danny Krizanc, Oscar Morales-Ponce and Ladislav Stacho -- On the Radon Number for P3-Convexity / Mitre C. Dourado, Dieter Rautenbach, Vinícius Fernandes dos Santos, Philipp M. Schäfer and Jayme L. Szwarcfiter, et al. -- Computing Minimum Geodetic Sets of Proper Interval Graphs / Tınaz Ekim, Aysel Erey, Pinar Heggernes, Pim van 't Hof and Daniel Meister -- Hausdorff Rank of Scattered Context-Free Linear Orders / Zoltán Ésik and Szabolcs Iván -- Opportunistic Information Dissemination in Mobile Ad-Hoc Networks: Adaptiveness vs. Obliviousness and Randomization vs. Determinism / Martín Farach-Colton, Antonio Fernández Anta, Alessia Milani, Miguel A. Mosteiro and Shmuel Zaks.
Record Nr. NYU-004622594
[Latin American Symposium on Theoretical Informatics (10th : 2012 : Arequipa, Peru)]  
Materiale a stampa
Lo trovi qui: New York University
Frontiers in algorithmics and algorithmic aspects in information and management : joint international conference, FAW-AAIM 2012, Beijing, China, May 14-16, 2012. Proceedings / Jack Snoeyink, Pinyan Lu, Kaile Su, Lusheng Wang (eds.).
Frontiers in algorithmics and algorithmic aspects in information and management : joint international conference, FAW-AAIM 2012, Beijing, China, May 14-16, 2012. Proceedings / Jack Snoeyink, Pinyan Lu, Kaile Su, Lusheng Wang (eds.).
Creatore [FAW-AAIM (Conference) (2012 : Beijing, China)]
Estensione 1 online resource (xvii, 370 pages).
Disciplina 005.1
Accesso persona Snoeyink, Jack
Genere/Forma Electronic books
Conference papers and proceedings
Soggetto non controllato Computer science
Data structures (Computer science)
Information theory
Computer software
Computational complexity
Information Systems
Algorithm Analysis and Problem Complexity
Discrete Mathematics in Computer Science
Mathematics of Computing
Theory of Computation
Management of Computing and Information Systems
ISBN 9783642297007
3642297005
3642296998
9783642296994
Classificazione 54.10
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Optimal Binary Representation of Mosaic Floorplans and Baxter Permutations / Bryan He -- Succinct Strictly Convex Greedy Drawing of 3-Connected Plane Graphs / Jiun-Jie Wang and Xin He -- Weighted Inverse Minimum Cut Problem under the Sum-Type Hamming Distance / Longcheng Liu, Yong Chen, Biao Wu and Enyu Yao -- Voronoi Diagram with Visual Restriction / Chenglin Fan, Jun Luo, Wencheng Wang and Binhai Zhu -- Minimization of the Maximum Distance between the Two Guards Patrolling a Polygonal Region / Xuehou Tan and Bo Jiang -- On Covering Points with Minimum Turns / Minghui Jiang -- On Envy-Free Pareto Efficient Pricing / Xia Hua -- Online Pricing for Multi-type of Items / Yong Zhang, Francis Y.L. Chin and Hing-Fung Ting -- Algorithms with Limited Number of Preemptions for Scheduling on Parallel Machines / Yiwei Jiang, Zewei Weng and Jueliang Hu -- Computing Maximum Non-crossing Matching in Convex Bipartite Graphs / Danny Z. Chen, Xiaomin Liu and Haitao Wang -- Algorithms for Bandwidth Consecutive Multicolorings of Graphs / (Extended Abstract) / Kazuhide Nishikawa, Takao Nishizeki and Xiao Zhou.
Independent Domination on Tree Convex Bipartite Graphs / Yu Song, Tian Liu and Ke Xu -- On-Line Scheduling of Parallel Jobs in Heterogeneous Multiple Clusters / Deshi Ye and Lili Mei -- On Multiprocessor Temperature-Aware Scheduling Problems / Evripidis Bampis, Dimitrios Letsios, Giorgio Lucarelli, Evangelos Markakis and Ioannis Milis -- Online Minimum Makespan Scheduling with a Buffer / Yan Lan, Xin Chen, Ning Ding, György Dósa and Xin Han -- A Dense Hierarchy of Sublinear Time Approximation Schemes for Bin Packing / Richard Beigel and Bin Fu -- Multivariate Polynomial Integration and Differentiation Are Polynomial Time Inapproximable Unless P=NP / Bin Fu -- Some Remarks on the Incompressibility of Width-Parameterized SAT Instances / Bangsheng Tang -- Kernels for Packing and Covering Problems / (Extended Abstract) / Jianer Chen, Henning Fernau, Peter Shaw, Jianxin Wang and Zhibiao Yang -- The Worst-Case Upper Bound for Exact 3-Satisfiability with the Number of Clauses as the Parameter / Junping Zhou and Minghao Yin -- Fixed-Parameter Tractability of almost CSP Problem with Decisive Relations / Chihao Zhang and Hongyang Zhang -- On Editing Graphs into 2-Club Clusters / Hong Liu, Peng Zhang and Daming Zhu.
Solving Generalized Optimization Problems Subject to SMT Constraints / Feifei Ma, Jun Yan and Jian Zhang -- Solving Difficult SAT Problems by Using OBDDs and Greedy Clique Decomposition / Yanyan Xu, Wei Chen, Kaile Su and Wenhui Zhang -- Zero-Sum Flow Numbers of Regular Graphs / Tao-Ming Wang and Shih-Wei Hu -- More Efficient Parallel Integer Sorting / Yijie Han and Xin He -- Fast Relative Lempel-Ziv Self-index for Similar Sequences / Huy Hoang Do, Jesper Jansson, Kunihiko Sadakane and Wing-Kin Sung -- A Comparison of Performance Measures via Online Search / Joan Boyar, Kim S. Larsen and Abyayananda Maiti -- Online Exploration of All Vertices in a Simple Polygon / Yuya Higashikawa and Naoki Katoh -- In-Place Algorithms for Computing a Largest Clique in Geometric Intersection Graphs / Minati De, Subhas C. Nandy and Sasanka Roy -- The Black-and-White Coloring Problem on Distance-Hereditary Graphs and Strongly Chordal Graphs / Ton Kloks, Sheung-Hung Poon, Feng-Ren Tsai and Yue-Li Wang -- An Improved Approximation Algorithm for the Bandpass Problem / Weitian Tong, Randy Goebel, Wei Ding and Guohui Lin -- Partial Degree Bounded Edge Packing Problem / Peng Zhang -- Erratum: The Approximability of the Exemplar Breakpoint Distance Problem / Zhixiang Chen, Bin Fu and Binhai Zhu.
Record Nr. NYU-004622799
[FAW-AAIM (Conference) (2012 : Beijing, China)]  
Materiale a stampa
Lo trovi qui: New York University
How the world computes : Turing Centenary Conference and 8th Conference on Computability in Europe, CiE 2012, Cambridge, UK, June 18-23, 2012. Proceedings / edited by S. Barry Cooper, Anuj Dawar, Benedikt Löwe
How the world computes : Turing Centenary Conference and 8th Conference on Computability in Europe, CiE 2012, Cambridge, UK, June 18-23, 2012. Proceedings / edited by S. Barry Cooper, Anuj Dawar, Benedikt Löwe
Creatore [Conference on Computability in Europe (8th : 2012 : Cambridge, England)]
Estensione 1 online resource.
Disciplina 511.3/52
Accesso persona Cooper, S. B. (S. Barry)
Dawar, Anuj
Löwe, Benedikt
Genere/Forma Electronic books
Conference papers and proceedings
Soggetto non controllato Computer science
Computer software
Computational complexity
Algebra -- Data processing
Logic, Symbolic and mathematical
Computation by Abstract Devices
Algorithm Analysis and Problem Complexity
Discrete Mathematics in Computer Science
Symbolic and Algebraic Manipulation
Mathematical Logic and Foundations
ISBN 9783642308703
3642308708
9783642308697
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Ordinal Analysis and the Infinite Ramsey Theorem / Bahareh Afshari and Michael Rathjen -- Curiouser and Curiouser: The Link between Incompressibility and Complexity / Eric Allender -- Information and Logical Discrimination / Patrick Allo -- Robustness of Logical Depth / Luís Antunes, Andre Souto and Andreia Teixeira -- Turing's Normal Numbers: Towards Randomness / Verónica Becher -- Logic of Ruler and Compass Constructions / Michael Beeson -- On the Computational Content of the Brouwer Fixed Point Theorem / Vasco Brattka, Stéphane Le Roux and Arno Pauly -- Square Roots and Powers in Constructive Banach Algebra Theory / Douglas S. Bridges and Robin S. Havea -- The Mate-in-n Problem of Infinite Chess Is Decidable / Dan Brumleve, Joel David Hamkins and Philipp Schlicht -- A Note on Ramsey Theorems and Turing Jumps / Lorenzo Carlucci and Konrad Zdanowski -- Automatic Functions, Linear Time and Learning / John Case, Sanjay Jain, Samuel Seah and Frank Stephan -- An Undecidable Nested Recurrence Relation / Marcel Celaya and Frank Ruskey -- Hard Instances of Algorithms and Proof Systems / Yijia Chen, Jörg Flum and Moritz Müller -- On Mathias Generic Sets / Peter A. Cholak, Damir D. Dzhafarov and Jeffry L. Hirst -- Complexity of Deep Inference via Atomic Flows / Anupam Das -- Connecting Partial Words and Regular Languages / Jürgen Dassow, Florin Manea and Robert Mercaş
Lower Bound on Weights of Large Degree Threshold Functions / Vladimir V. Podolskii -- What Are Computers (If They're not Thinking Things)? / John Preston -- Compactness and the Effectivity of Uniformization / Robert Rettinger -- On the Computability Power of Membrane Systems with Controlled Mobility / Shankara Narayanan Krishna, Bogdan Aman and Gabriel Ciobanu -- On Shift Spaces with Algebraic Structure / Ville Salo and Ilkka Törmä -- Finite State Verifiers with Constant Randomness / A.C. Cem Say and Abuzer Yakaryılmaz -- Game Arguments in Computability Theory and Algorithmic Information Theory / Alexander Shen -- Turing Patterns in Deserts / Jonathan A. Sherratt -- Subsymbolic Computation Theory for the Human Intuitive Processor / Paul Smolensky -- A Correspondence Principle for Exact Constructive Dimension / Ludwig Staiger -- Lown Boolean Subalgebras / Rebecca M. Steiner -- Bringing Up Turing's 'Child-Machine' / Susan G. Sterrett -- Is Turing's Thesis the Consequence of a More General Physical Principle? / Matthew P. Szudzik -- Some Natural Zero One Laws for Ordinals Below ε0 / Andreas Weiermann and Alan R. Woods -- On the Road to Thinking Machines: Insights and Ideas / Jiří Wiedermann -- Making Solomonoff Induction Effective / Or: You Can Learn What You Can Bound / Jörg Zimmermann and Armin B. Cremers.
Randomness, Computation and Mathematics / Rod Downey -- Learning, Social Intelligence and the Turing Test / Why an "Out-of-the-Box" Turing Machine Will Not Pass the Turing Test / Bruce Edmonds and Carlos Gershenson -- Confluence in Data Reduction: Bridging Graph Transformation and Kernelization / Hartmut Ehrig, Claudia Ermel, Falk Hüffner, Rolf Niedermeier and Olga Runge -- Highness and Local Noncappability / Chengling Fang, Wang Shenling and Guohua Wu -- Turing Progressions and Their Well-Orders / David Fernández Duque and Joost J. Joosten -- A Short Note on Spector's Proof of Consistency of Analysis / Fernando Ferreira -- Sets of Signals, Information Flow, and Folktales / Mark Alan Finlayson -- On the Foundations and Philosophy of Info-metrics / Amos Golan -- On Mathematicians Who Liked Logic / The Case of Max Newman / Ivor Grattan-Guinness -- Densities and Entropies in Cellular Automata / Pierre Guillon and Charalampos Zinoviadis -- Foundational Analyses of Computation / Yuri Gurevich -- Turing Machine-Inspired Computer Science Results / Juris Hartmanis -- NP-Hardness and Fixed-Parameter Tractability of Realizing Degree Sequences with Directed Acyclic Graphs / Sepp Hartung and André Nichterlein -- A Direct Proof of Wiener's Theorem / Matthew Hendtlass and Peter Schuster -- Effective Strong Nullness and Effectively Closed Sets / Kojiro Higuchi and Takayuki Kihara.
Word Automaticity of Tree Automatic Scattered Linear Orderings Is Decidable / Martin Huschenbett -- On the Relative Succinctness of Two Extensions by Definitions of Multimodal Logic / Wiebe van der Hoek, Petar Iliev and Barteld Kooi -- On Immortal Configurations in Turing Machines / Emmanuel Jeandel -- A Slime Mold Solver for Linear Programming Problems / Anders Johannson and James Zou -- Multi-scale Modeling of Gene Regulation of Morphogenesis / Jaap A. Kaandorp, Daniel Botman, Carlos Tamulonis and Roland Dries -- Tree-Automatic Well-Founded Trees / Alexander Kartzow, Jiamou Liu and Markus Lohrey -- Infinite Games and Transfinite Recursion of Multiple Inductive Definitions / Keisuke Yoshii and Kazuyuki Tanaka -- A Hierarchy of Immunity and Density for Sets of Reals / Takayuki Kihara -- How Much Randomness Is Needed for Statistics? / Bjørn Kjos-Hanssen, Antoine Taveneaux and Neil Thapen -- Towards a Theory of Infinite Time Blum-Shub-Smale Machines / Peter Koepke and Benjamin Seyfferth -- Turing Pattern Formation without Diffusion / Shigeru Kondo -- Degrees of Total Algorithms versus Degrees of Honest Functions / Lars Kristiansen -- A 5n -- o(n) Lower Bound on the Circuit Size over U2 of a Linear Boolean Function / Alexander S. Kulikov, Olga Melanich and Ivan Mihajlin -- Local Induction and Provably Total Computable Functions: A Case Study / Andrés Cordón-Franco and F. Félix Lara-Martín.
What is Turing's Comparison between Mechanism and Writing Worth? / Jean Lassègue and Giuseppe Longo -- Substitutions and Strongly Deterministic Tilesets / Bastien Le Gloannec and Nicolas Ollinger -- The Computing Spacetime / Fotini Markopoulou -- Unifiability and Admissibility in Finite Algebras / George Metcalfe and Christoph Röthlisberger -- Natural Signs / Ruth Garrett Millikan -- Characteristics of Minimal Effective Programming Systems / Samuel E. Moelius III -- After Turing: Mathematical Modelling in the Biomedical and Social Sciences / From Animal Coat Patterns to Brain Tumours to Saving Marriages / James D. Murray -- Existence of Faster than Light Signals Implies Hypercomputation already in Special Relativity / Péter Németi and Gergely Székely -- Turing Computable Embeddings and Coding Families of Sets / Víctor A. Ocasio-González -- On the Behavior of Tile Assembly System at High Temperatures / Shinnosuke Seki and Yasushi Okuno -- Abstract Partial Cylindrical Algebraic Decomposition I: The Lifting Phase / Grant Olney Passmore and Paul B. Jackson -- Multi-valued Functions in Computability Theory / Arno Pauly -- Relative Randomness for Martin-Löf Random Sets / NingNing Peng, Kojiro Higuchi, Takeshi Yamazaki and Kazuyuki Tanaka -- On the Tarski-Lindenbaum Algebra of the Class of all Strongly Constructivizable Prime Models / Mikhail G. Peretyat'kin.
Record Nr. NYU-004623040
[Conference on Computability in Europe (8th : 2012 : Cambridge, England)]  
Materiale a stampa
Lo trovi qui: New York University
Parallel problem solving from nature-- PPSN XII : 12th International Conference, Taormina, Italy, September 1-5, 2012, Proceedings. Part I / Carlos A. Coello Coello [and others] (eds.).
Parallel problem solving from nature-- PPSN XII : 12th International Conference, Taormina, Italy, September 1-5, 2012, Proceedings. Part I / Carlos A. Coello Coello [and others] (eds.).
Creatore [International Conference on Parallel Problem Solving from Nature (12th : 2012 : Taormina, Italy)]
Estensione 1 online resource.
Disciplina 004/.35
Accesso persona Coello Coello, Carlos A.
Genere/Forma Electronic books
Conference papers and proceedings
Soggetto non controllato Computer science
Computer software
Computational complexity
Artificial intelligence
Computational Biology/Bioinformatics
Computation by Abstract Devices
Algorithm Analysis and Problem Complexity
ISBN 9783642329371
3642329373
9783642329364
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Convergence of the IGO-Flow of Isotropic Gaussian Distributions on Convex Quadratic Problems / Tobias Glasmachers -- Homogeneous and Heterogeneous Island Models for the Set Cover Problem / Andrea Mambrini, Dirk Sudholt and Xin Yao -- Geometric Semantic Genetic Programming / Alberto Moraglio, Krzysztof Krawiec and Colin G. Johnson -- Efficient Negative Selection Algorithms by Sampling and Approximate Counting / Johannes Textor -- Convergence of the Continuous Time Trajectories of Isotropic Evolution Strategies on Monotonic C22-composite Functions / Youhei Akimoto, Anne Auger and Nikolaus Hansen -- A Parameterized Runtime Analysis of Simple Evolutionary Algorithms for Makespan Scheduling / Andrew M. Sutton and Frank Neumann -- On Algorithm-Dependent Boundary Case Identification for Problem Classes / Chao Qian, Yang Yu and Zhi-Hua Zhou -- Cumulative Step-Size Adaptation on Linear Functions / Alexandre Chotard, Anne Auger and Nikolaus Hansen -- On the Behaviour of the (1, [lambda])-[sigma]SA-ES for a Constrained Linear Problem / Dirk V. Arnold -- An Empirical Evaluation of O(1) Steepest Descent for NK-Landscapes / Darrell Whitley, Wenxiang Chen and Adele Howe -- Experimental Supplements to the Computational Complexity Analysis of Genetic Programming for Problems Modelling Isolated Program Semantics / Tommaso Urli, Markus Wagner and Frank Neumann.
ACO Beats EA on a Dynamic Pseudo-Boolean Function / Timo Kötzing and Hendrik Molter -- Runtime Analysis of Simple Interactive Evolutionary Biobjective Optimization Algorithms / Dimo Brockhoff, Manuel López-Ibáñez, Boris Naujoks and Günter Rudolph -- Parsimony Pressure versus Multi-objective Optimization for Variable Length Representations / Markus Wagner and Frank Neumann -- An Evolutionary and Graph-Based Method for Image Segmentation / Alessia Amelio and Clara Pizzuti -- Real-Time GPU Based Road Sign Detection and Classification / Roberto Ugolotti, Youssef S.G. Nashed and Stefano Cagnoni -- Acceleration of Evolutionary Image Filter Design Using Coevolution in Cartesian GP / Michaela Sikulova and Lukas Sekanina -- Transfer Learning, Soft Distance-Based Bias, and the Hierarchical BOA / Martin Pelikan, Mark W. Hauschild and Pier Luca Lanzi -- Reinforcement Learning with N-tuples on the Game Connect-4 / Markus Thill, Patrick Koch and Wolfgang Konen -- Efficient Sampling and Handling of Variance in Tuning Data Mining Models / Patrick Koch and Wolfgang Konen -- A Spatial EA Framework for Parallelizing Machine Learning Methods / Uday Kamath, Johan Kaers, Amarda Shehu and Kenneth A. De Jong -- Competing Mutating Agents for Bayesian Network Structure Learning / Olivier Regnier-Coudert and John McCall.
A Meta-learning Prediction Model of Algorithm Performance for Continuous Optimization Problems / Mario A. Muñoz, Michael Kirley and Saman K. Halgamuge -- Pruning GP-Based Classifier Ensembles by Bayesian Networks / C. De Stefano, G. Folino, F. Fontanella and A. Scotto di Freca -- A Multi-parent Search Operator for Bayesian Network Building / David Iclănzan -- Enhancing Learning Capabilities by XCS with Best Action Mapping / Masaya Nakata, Pier Luca Lanzi and Keiki Takadama -- Using Expert Knowledge to Guide Covering and Mutation in a Michigan Style Learning Classifier System to Detect Epistasis and Heterogeneity / Ryan J. Urbanowicz, Delaney Granizo-Mackenzie and Jason H. Moore -- On Measures to Build Linkage Trees in LTGA / Peter A.N. Bosman and Dirk Thierens -- Evolvability Analysis of the Linkage Tree Genetic Algorithm / Dirk Thierens and Peter A.N. Bosman -- Alternative Restart Strategies for CMA-ES / Ilya Loshchilov, Marc Schoenauer and Michèle Sebag -- Are State-of-the-Art Fine-Tuning Algorithms Able to Detect a Dummy Parameter? / Elizabeth Montero, María-Cristina Riff, Leslie Pérez-Caceres and Carlos A. Coello Coello -- Compressed Network Complexity Search / Faustino Gomez, Jan Koutník and Jürgen Schmidhuber -- Single Node Genetic Programming on Problems with Side Effects / David Jackson.
Generalized Compressed Network Search / Rupesh Kumar Srivastava, Jürgen Schmidhuber and Faustino Gomez -- Analyzing Module Usage in Grammatical Evolution / John Mark Swafford, Erik Hemberg, Michael O'Neill and Anthony Brabazon -- On the Anytime Behavior of IPOP-CMA-ES / Manuel López-Ibáñez, Tianjun Liao and Thomas Stützle -- HappyCat -- A Simple Function Class Where Well-Known Direct Search Algorithms Do Fail / Hans-Georg Beyer and Steffen Finck -- Differential Gene Expression with Tree-Adjunct Grammars / Eoin Murphy, Miguel Nicolau, Erik Hemberg, Michael O'Neill and Anthony Brabazon -- Analysing the Effects of Diverse Operators in a Genetic Programming System / MinHyeok Kim, Bob (RI) McKay, Kangil Kim and Xuan Hoai Nguyen -- Quantitative Analysis of Locally Geometric Semantic Crossover / Krzysztof Krawiec and Tomasz Pawlak -- Length Scale for Characterising Continuous Optimization Problems / Rachael Morgan and Marcus Gallagher -- Analyzing the Behaviour of Population-Based Algorithms Using Rayleigh Distribution / Gabriel Luque and Enrique Alba -- Variable Transformations in Estimation of Distribution Algorithms / Davide Cucci, Luigi Malagò and Matteo Matteucci.
Controlling Overfitting in Symbolic Regression Based on a Bias/Variance Error Decomposition / Alexandros Agapitos, Anthony Brabazon and Michael O'Neill -- On Spectral Invariance of Randomized Hessian and Covariance Matrix Adaptation Schemes / Sebastian U. Stich and Christian L. Müller -- Variable Neighborhood Search and GRASP for Three-Layer Hierarchical Ring Network Design / Christian Schauer and Günther R. Raidl -- Extracting Key Gene Regulatory Dynamics for the Direct Control of Mechanical Systems / Jean Krohn and Denise Gorse -- An Evolutionary Optimization Approach for Bulk Material Blending Systems / Michael P. Cipold, Pradyumn Kumar Shukla, Claus C. Bachmann, Kaibin Bao and Hartmut Schmeck -- Study of Cancer Hallmarks Relevance Using a Cellular Automaton Tumor Growth Model / José Santos and Ángel Monteagudo -- Between Selfishness and Altruism: Fuzzy Nash-Berge-Zhukovskii Equilibrium / Réka Nagy, Noémi Gaskó, Rodica Ioana Lung and D. Dumitrescu -- A Spanning Tree-Based Encoding of the MAX CUT Problem for Evolutionary Search / Kisung Seo, Soohwan Hyun and Yong-Hyuk Kim -- A Hybrid Approach to Piecewise Modelling of Biochemical Systems / Zujian Wu, Shengxiang Yang and David Gilbert -- An Empirical Comparison of CMA-ES in Dynamic Environments / Chun-Kit Au and Ho-Fung Leung.
Record Nr. NYU-004624406
[International Conference on Parallel Problem Solving from Nature (12th : 2012 : Taormina, Italy)]  
Materiale a stampa
Lo trovi qui: New York University
Latent variable analysis and signal separation : 10th International Conference, LVA/ICA 2012, Tel Aviv, Israel, March 12-15, 2012. Proceedings / Fabian Theis [and others] (eds.).
Latent variable analysis and signal separation : 10th International Conference, LVA/ICA 2012, Tel Aviv, Israel, March 12-15, 2012. Proceedings / Fabian Theis [and others] (eds.).
Creatore [LVA/ICA 2012 (2012 : Tel Aviv, Israel)]
Estensione 1 online resource (xvi, 538 pages) : illustrations.
Disciplina 621.382/2
Accesso persona Theis, Fabian J.
Genere/Forma Electronic books
Conference papers and proceedings
Soggetto non controllato Computer science
Software engineering
Computer software
Computational complexity
Computer simulation
Computer vision
Optical pattern recognition
Pattern Recognition
Image Processing and Computer Vision
Simulation and Modeling
Algorithm Analysis and Problem Complexity
Discrete Mathematics in Computer Science
Special Purpose and Application-Based Systems
ISBN 9783642285516
3642285511
9783642285509
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Block Component Analysis, a New Concept for Blind Source Separation -- Partially Linear Estimation with Application to Image Deblurring Using Blurred/Noisy Image Pairs -- Causal Discovery for Linear Non-Gaussian Acyclic Models in the Presence of Latent Gaussian Confounders -- Alleviating the Influence of Weak Data Asymmetries on Granger-Causal Analyses -- Online PLCA for Real-Time Semi-supervised Source Separation -- Cramér-Rao Bound for Circular Complex Independent Component Analysis -- Complex Non-Orthogonal Joint Diagonalization Based on LU and LQ Decompositions -- Exact and Approximate Quantum Independent Component Analysis for Qubit Uncoupling -- A Matrix Joint Diagonalization Approach for Complex Independent Vector Analysis -- Algebraic Solutions to Complex Blind Source Separation -- On the Separation Performance of the Strong Uncorrelating Transformation When Applied to Generalized Covariance and Pseudo-covariance Matrices -- A Canonical Correlation Analysis Based Method for Improving BSS of Two Related Data Sets -- A Probability-Based Combination Method for Unsupervised Clustering with Application to Blind Source Separation -- Charrelation Matrix Based ICA -- Contrast Functions for Independent Subspace Analysis -- Distributional Convergence of Subspace Estimates in FastICA: A Bootstrap Study -- New Online EM Algorithms for General Hidden Markov Models. Application to the SLAM Problem -- The Role of Whitening for Separation of Synchronous Sources -- Simultaneous Diagonalization of Skew-Symmetric Matrices in the Symplectic Group.
Joint Block Diagonalization Algorithms for Optimal Separation of Multidimensional Components -- On Computation of Approximate Joint Block-Diagonalization Using Ordinary AJD -- Joint Diagonalization of Several Scatter Matrices for ICA -- To Infinity and Beyond: On ICA over Hilbert Spaces -- Regularized Sparse Representation for Spectrometric Pulse Separation and Counting Rate Estimation -- Some Uniqueness Results in Sparse Convolutive Source Separation -- Ternary Sparse Coding -- Closed-Form EM for Sparse Coding and Its Application to Source Separation -- Convolutive Underdetermined Source Separation through Weighted Interleaved ICA and Spatio-temporal Source Correlation -- Dictionary Learning with Large Step Gradient Descent for Sparse Representations -- Separation of Sparse Signals in Overdetermined Linear-Quadratic Mixtures -- Collaborative Filtering via Group-Structured Dictionary Learning -- Group Polytope Faces Pursuit for Recovery of Block-Sparse Signals -- Nonnegative Matrix Factorization via Generalized Product Rule and Its Application for Classification -- An Algebraic Method for Approximate Rank One Factorization of Rank Deficient Matrices -- Bayesian Non-negative Matrix Factorization with Learned Temporal Smoothness Priors -- On Connection between the Convolutive and Ordinary Nonnegative Matrix Factorizations -- On Revealing Replicating Structures in Multiway Data: A Novel Tensor Decomposition Approach -- An On-Line NMF Model for Temporal Pattern Learning: Theory with Application to Automatic Speech Recognition -- Low-Latency Instrument Separation in Polyphonic Audio Using Timbre Models.
Real-Time Speech Separation by Semi-supervised Nonnegative Matrix Factorization -- An Audio-Video Based IVA Algorithm for Source Separation and Evaluation on the AV16.3 Corpus -- Non-negative Matrix Factorization Based Noise Reduction for Noise Robust Automatic Speech Recognition -- Audio Imputation Using the Non-negative Hidden Markov Model -- A Non-negative Approach to Language Informed Speech Separation -- Temporally-Constrained Convolutive Probabilistic Latent Component Analysis for Multi-pitch Detection -- A Latently Constrained Mixture Model for Audio Source Separation and Localization -- Multiple Instrument Mixtures Source Separation Evaluation Using Instrument-Dependent NMF Models -- Complex Extension of Infinite Sparse Factor Analysis for Blind Speech Separation -- A General Framework for Online Audio Source Separation -- Sound Recognition in Mixtures -- The 2011 Signal Separation Evaluation Campaign (SiSEC2011): -- Audio Source Separation -- -- The 2011 Signal Separation Evaluation Campaign (SiSEC2011): -- Biomedical Data Analysis -- -- Improved Perceptual Metrics for the Evaluation of Audio Source Separation -- Musical Audio Source Separation Based on User-Selected F0 Track -- A GMM Sound Source Model for Blind Speech Separation in Under-determined Conditions -- Model-Driven Speech Enhancement for Multisource Reverberant Environment (Signal Separation Evaluation Campaign (SiSEC) 2011) -- Semi-blind Source Separation Based on ICA and Overlapped Speech Detection -- Nonparametric Modelling of ECG: Applications to Denoising and to Single Sensor Fetal ECG Extraction -- Nesterov's Iterations for NMF-Based Supervised Classification of Texture Patterns -- Detection of Aliasing in Image Sequences Using Nonlinear Factor Analysis -- Geometrical Method Using Simplicial Cones for Overdetermined Nonnegative Blind Source Separation: Application to Real PET Images -- Multi- domain Feature of Event-Related Potential Extracted by Nonnegative Tensor Factorization: 5 vs. 14 Electrodes EEG Data -- The Use of Linear Feature Projection for Precipitation Classification Using Measurements from Commercial Microwave Links -- Bayesian Inference of Latent Causes in Gene Regulatory Dynamics -- Bayesian Fuzzy Clustering of Colored Graphs.
Record Nr. NYU-004621663
[LVA/ICA 2012 (2012 : Tel Aviv, Israel)]  
Materiale a stampa
Lo trovi qui: New York University
Information security and cryptology-- ICISC 2011 : 14th International Conference, Seoul, Korea, November 30 - December 2, 2011. Revised selected papers / Howon Kim (ed.).
Information security and cryptology-- ICISC 2011 : 14th International Conference, Seoul, Korea, November 30 - December 2, 2011. Revised selected papers / Howon Kim (ed.).
Creatore [ICISC (Conference) (14th : 2011 : Seoul, Korea)]
Estensione 1 online resource (xii, 512 pages) : illustrations.
Disciplina 005.8
Accesso persona Kim, Howon
Genere/Forma Electronic books
Conference papers and proceedings
Soggetto non controllato Computer science
Computer Communication Networks
Data protection
Data encryption (Computer science)
Computer software
Computational complexity
Information Systems
Management of Computing and Information Systems
Algorithm Analysis and Problem Complexity
Systems and Data Security
Discrete Mathematics in Computer Science
ISBN 9783642319129
3642319122
3642319114
9783642319112
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Improved Integral Analysis on Tweaked Lesamnta / Yu Sasaki and Kazumaro Aoki -- Analysis of Trivium Using Compressed Right Hand Side Equations / Thorsten Ernst Schilling and Håvard Raddum -- Cryptanalysis of Round-Reduced HAS-160 / Florian Mendel, Tomislav Nad and Martin Schläffer -- An Efficient Method for Eliminating Random Delays in Power Traces of Embedded Software / Daehyun Strobel and Christof Paar -- An Efficient Leakage Characterization Method for Profiled Power Analysis Attacks / Hailong Zhang, Yongbin Zhou and Dengguo Feng -- Correcting Errors in Private Keys Obtained from Cold Boot Attacks / Hyung Tae Lee, HongTae Kim, Yoo-Jin Baek and Jung Hee Cheon -- Strong Security Notions for Timed-Release Public-Key Encryption Revisited / Ryo Kikuchi, Atsushi Fujioka, Yoshiaki Okamoto and Taiichi Saito -- Fully Secure Unidirectional Identity-Based Proxy Re-encryption / Song Luo, Qingni Shen and Zhong Chen -- Detecting Parasite P2P Botnet in eMule-like Networks through Quasi-periodicity Recognition / Yong Qiao, Yuexiang Yang, Jie He, Bo Liu and Yingzhi Zeng -- AutoDunt: Dynamic Latent Dependence Analysis for Detection of Zero Day Vulnerability / Kai Chen, Yifeng Lian and Yingjun Zhang -- Weaknesses in Current RSA Signature Schemes / Juliane Krämer, Dmitry Nedospasov and Jean-Pierre Seifert.
Back Propagation Neural Network Based Leakage Characterization for Practical Security Analysis of Cryptographic Implementations / Shuguo Yang, Yongbin Zhou, Jiye Liu and Danyang Chen -- A Revocable Group Signature Scheme with the Property of Hiding the Number of Revoked Users / Keita Emura, Atsuko Miyaji and Kazumasa Omote -- Generic Constructions for Verifiable Signcryption / Laila El Aimani -- Non-delegatable Strong Designated Verifier Signature on Elliptic Curves / Haibo Tian, Xiaofeng Chen, Zhengtao Jiang and Yusong Du -- An Improved Known Plaintext Attack on PKZIP Encryption Algorithm / Kyung Chul Jeong, Dong Hoon Lee and Daewan Han -- Synthetic Linear Analysis: Improved Attacks on CubeHash and Rabbit / Yi Lu, Serge Vaudenay, Willi Meier, Liping Ding and Jianchun Jiang -- On the Resistance of Boolean Functions against Fast Algebraic Attacks / Yusong Du, Fangguo Zhang and Meicheng Liu -- CCA Secure IB-KEM from the Computational Bilinear Diffie-Hellman Assumption in the Standard Model / Yu Chen, Liqun Chen and Zongyang Zhang -- Design, Implementation, and Evaluation of a Vehicular Hardware Security Module / Marko Wolf and Timo Gendrullis -- Efficient Modular Exponentiation-Based Puzzles for Denial-of-Service Protection / Jothi Rangasamy, Douglas Stebila, Lakshmi Kuppusamy, Colin Boyd and Juan Gonzalez Nieto -- Implementing Information-Theoretically Secure Oblivious Transfer from Packet Reordering / Paolo Palmieri and Olivier Pereira.
Compression Functions Using a Dedicated Blockcipher for Lightweight Hashing / Shoichi Hirose, Hidenori Kuwakado and Hirotaka Yoshida -- Biclique Attack on the Full HIGHT / Deukjo Hong, Bonwook Koo and Daesung Kwon -- Preimage Attacks on Step-Reduced SM3 Hash Function / Jian Zou, Wenling Wu, Shuang Wu, Bozhan Su and Le Dong -- Breaking a 3D-Based CAPTCHA Scheme / Vu Duc Nguyen, Yang-Wai Chow and Willy Susilo -- Multi-User Keyword Search Scheme for Secure Data Sharing with Fine-Grained Access Control / Fangming Zhao, Takashi Nishide and Kouichi Sakurai -- Reaction Attack on Outsourced Computing with Fully Homomorphic Encryption Schemes / Zhenfei Zhang, Thomas Plantard and Willy Susilo -- A Blind Digital Image Watermarking Method Based on the Dual-Tree Complex Discrete Wavelet Transform and Interval Arithmetic / Teruya Minamoto and Ryuji Ohura -- On the Communication Complexity of Reliable and Secure Message Transmission in Asynchronous Networks / Ashish Choudhury and Arpita Patra -- Two-Party Round-Optimal Session-Policy Attribute-Based Authenticated Key Exchange without Random Oracles / Kazuki Yoneyama -- Sufficient Condition for Identity-Based Authenticated Key Exchange Resilient to Leakage of Secret Keys / Atsushi Fujioka and Koutarou Suzuki.
Record Nr. NYU-004623667
[ICISC (Conference) (14th : 2011 : Seoul, Korea)]  
Materiale a stampa
Lo trovi qui: New York University
Approximation and Online Algorithms : 9th International Workshop, WAOA 2011, Saarbrücken, Germany, September 8-9, 2011, Revised selected papers / Roberto Solis-Oba, Giuseppe Persiano (eds.).
Approximation and Online Algorithms : 9th International Workshop, WAOA 2011, Saarbrücken, Germany, September 8-9, 2011, Revised selected papers / Roberto Solis-Oba, Giuseppe Persiano (eds.).
Creatore [WAOA 2011 (2011 : Saarbrücken, Germany)]
Estensione 1 online resource (x, 273 pages).
Disciplina 005.1
Accesso persona Solis-Oba, Roberto
Persiano, Giuseppe
Genere/Forma Electronic books
Conference papers and proceedings
Soggetto non controllato Computer science
Computer software
Electronic data processing
Computational complexity
Algorithms
Algorithm Analysis and Problem Complexity
Discrete Mathematics in Computer Science
Numeric Computing
Information Systems Applications (incl. Internet)
ISBN 9783642291166
3642291163
9783642291159
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Approximation Algorithms for Scheduling and Packing Problems / Klaus Jansen -- Approximating Subset k-Connectivity Problems / Zeev Nutov -- Learning in Stochastic Machine Scheduling / Sebastián Marbán, Cyriel Rutten and Tjark Vredeveld -- An Online Algorithm Optimally Self-tuning to Congestion for Power Management Problems / Wolfgang Bein, Naoki Hatta, Nelson Hernandez-Cons, Hiro Ito and Shoji Kasahara, et al. -- Single Approximation for Biobjective Max TSP / Cristina Bazgan, Laurent Gourvès, Jérôme Monnot and Fanny Pascual -- Parameterized Approximation Algorithms for Hitting Set / Ljiljana Brankovic and Henning Fernau -- Approximation Algorithms for the Maximum Leaf Spanning Tree Problem on Acyclic Digraphs / Nadine Schwartges, Joachim Spoerhase and Alexander Wolff -- Optimization over Integers with Robustness in Cost and Few Constraints / Kai-Simon Goetzmann, Sebastian Stiller and Claudio Telha -- A Lower Bound on Deterministic Online Algorithms for Scheduling on Related Machines without Preemption / Tomáš Ebenlendr and Jiří Sgall -- Scheduling Jobs on Identical and Uniform Processors Revisited / Klaus Jansen and Christina Robenek.
Approximation Algorithms for Fragmenting a Graph against a Stochastically-Located Threat / David B. Shmoys and Gwen Spencer -- Non-clairvoyant Weighted Flow Time Scheduling on Different Multi-processor Models / Jianqiao Zhu, Ho-Leung Chan and Tak-Wah Lam -- A New Perspective on List Update: Probabilistic Locality and Working Set / Reza Dorrigiv and Alejandro López-Ortiz -- OnlineMin: A Fast Strongly Competitive Randomized Paging Algorithm / Gerth Stølting Brodal, Gabriel Moruz and Andrei Negoescu -- Faster and Simpler Approximation of Stable Matchings / Katarzyna Paluch -- Simpler 3/4-Approximation Algorithms for MAX SAT / Anke van Zuylen -- On Online Algorithms with Advice for the k-Server Problem / Marc P. Renault and Adi Rosén -- Improved Lower Bound for Online Strip Packing / (Extended Abstract) / Rolf Harren and Walter Kern -- Competitive Router Scheduling with Structured Data / Yishay Mansour, Boaz Patt-Shamir and Dror Rawitz -- Approximation with a Fixed Number of Solutions of Some Biobjective Maximization Problems / Cristina Bazgan, Laurent Gourvès and Jérôme Monnot -- Generalized Maximum Flows over Time / Martin Groß and Martin Skutella -- The Price of Anarchy for Minsum Related Machine Scheduling / Ruben Hoeksma and Marc Uetz.
Record Nr. NYU-004374775
[WAOA 2011 (2011 : Saarbrücken, Germany)]  
Materiale a stampa
Lo trovi qui: New York University