| |
|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNISA996465703803316 |
|
|
Titolo |
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques [[electronic resource] ] : 16th International Workshop, APPROX 2013, and 17th International Workshop, RANDOM 2013, Berkeley, CA, USA, August 21-23, 2013, Proceedings / / edited by Prasad Raghavendra, Sofya Raskhodnikova, Klaus Jansen, José D.P. Rolim |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
|
|
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
Edizione |
[1st ed. 2013.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (XIV, 716 p. 48 illus.) |
|
|
|
|
|
|
Collana |
|
Theoretical Computer Science and General Issues, , 2512-2029 ; ; 8096 |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Algorithms |
Computer science—Mathematics |
Discrete mathematics |
Computer science |
Numerical analysis |
Mathematical statistics |
Artificial intelligence—Data processing |
Discrete Mathematics in Computer Science |
Theory of Computation |
Numerical Analysis |
Probability and Statistics in Computer Science |
Data Science |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
Bibliographic Level Mode of Issuance: Monograph |
|
|
|
|
|
|
Nota di contenuto |
|
Spectral Sparsification in Dynamic Graph Streams -- The Online Stochastic Generalized Assignment Problem -- On the NP-Hardness of Approximating Ordering Constraint Satisfaction Problems -- Approximating Large Frequency Moments with Pick-and-Drop Sampling -- Generalizing the Layering Method of Indyk and Woodruff: Recursive Sketches for Frequency-Based Vectors on Streams -- |
|
|
|
|
|
|
|
|
|
|
|
Capacitated Network Design on Undirected Graphs -- Scheduling Subset Tests: One-Time, Continuous, and How They Relate -- On the Total Perimeter of Homothetic Convex Bodies in a Convex Container -- Partial Interval Set Cover – Trade-Offs between Scalability and Optimality -- Online Square-into-Square Packing -- Online Non-clairvoyant Scheduling to Simultaneously Minimize All Convex Functions -- Shrinking Maxima, Decreasing Costs: New Online Packing and Covering Problems -- Multiple Traveling Salesmen in Asymmetric Metrics -- Approximate Indexability and Bandit Problems with Concave Rewards and Delayed Feedback -- The Approximability of the Binary Paintshop Problem -- Approximation Algorithms for Movement Repairmen -- Improved Hardness of Approximating Chromatic Number -- A Pseudo-approximation for the Genus of Hamiltonian Graphs -- A Local Computation Approximation Scheme to Maximum Matching -- Sketching Earth-Mover Distance on Graph Metrics -- Online Multidimensional Load Balancing -- A New Regularity Lemma and Faster Approximation Algorithms for Low Threshold Rank Graphs -- Interdiction Problems on Planar Graphs -- Conditional Random Fields, Planted Constraint Satisfaction and Entropy Concentration -- Finding Heavy Hitters from Lossy or Noisy Data -- Private Learning and Sanitization: Pure vs. Approximate Differential Privacy -- Phase Coexistence and Slow Mixing for the Hard-Core Model on Z2 -- Fast Private Data Release Algorithms for Sparse Queries -- Local Reconstructors and Tolerant Testers for Connectivity and Diameter -- An Optimal Lower Bound for Monotonicity Testing over Hypergrids -- Small-Bias Sets for Nonabelian Groups: Derandomizations of the Alon-Roichman Theorem -- What You Can Do with Coordinated Samples -- Robust Randomness Amplifiers: Upper and Lower Bounds -- The Power of Choice for Random Satisfiability -- Connectivity of Random High Dimensional Geometric Graphs -- Matching-Vector Families and LDCs over Large Modulo -- Explicit Noether Normalization for Simultaneous Conjugation via Polynomial Identity Testing -- Testing Membership in Counter Automaton Languages -- Tight Lower Bounds for Testing Linear Isomorphism -- Randomness-Efficient Curve Samplers -- Combinatorial Limitations of Average-Radius List Decoding -- Zero Knowledge LTCs and Their Applications -- A Tight Lower Bound for High Frequency Moment Estimation with Small Error -- Improved FPTAS for Multi-spin Systems -- Pseudorandomness for Regular Branching Programs via Fourier Analysis -- Absolutely Sound Testing of Lifted Codes -- On the Average Sensitivity and Density of k-CNF Formulas -- Improved Bounds on the Phase Transition for the Hard-Core Model in 2-Dimensions. |
|
|
|
|
|
|
Sommario/riassunto |
|
This book constitutes the proceedings of the 16th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2013, and the 17th International Workshop on Randomization and Computation, RANDOM 2013, held in August 2013 in the USA. The total of 48 carefully reviewed and selected papers presented in this volume consist of 23 APPROX papers selected out of 46 submissions, and 25 RANDOM papers selected out of 52 submissions. APPROX 2013 focuses on algorithmic and complexity theoretic issues relevant to the development of efficient approximate solutions to computationally difficult problems, while RANDOM 2013 focuses on applications of randomness to computational and combinatorial problems. |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2. |
Record Nr. |
UNINA9910778067503321 |
|
|
Titolo |
Vocalize to localize [[electronic resource] /] / edited by Christian Abry, Anne Vilain, Jean-Luc Schwartz |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Amsterdam ; ; Philadelphia, : John Benjamins Pub. Co., 2009 |
|
|
|
|
|
|
|
ISBN |
|
1-282-16989-0 |
9786612169892 |
90-272-8951-4 |
|
|
|
|
|
|
|
|
Descrizione fisica |
|
|
|
|
|
|
Collana |
|
Benjamins current topics, , 1874-0081 ; ; v. 13 |
|
|
|
|
|
|
Altri autori (Persone) |
|
AbryChristian |
VilainAnne |
SchwartzJean-Luc |
|
|
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Oral communication |
Visual communication |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
Previously published in Interaction studies 5:3 (2004) & 6:2 (2005). |
|
|
|
|
|
|
Nota di bibliografia |
|
Includes bibliographical references and index. |
|
|
|
|
|
|
Nota di contenuto |
|
Introduction: vocalize to localize? a call for better crosstalk between auditory and visual communication systems researchers / Christian Abry, Anne Vilain, and Jean-Luc Schwartz -- Vocalize to localize: a test on functionally referential alarm calls / Marta B. Manser and Lindsay B. Fletcher -- Mirror neurons, gestures, and language evolution / Leonardo Fogassi and Pier Francesco Ferrari -- Lateralization of communicative signals in nonhuman primates and the hypothesis of the gestural origin of language / Jacques Vauclair -- Manual deixis in apes and humans / David A. Leavens -- Neandertal vocal tract : which potential for vowel acoustics? / Louis-Jean Boë ... [et al.] -- Interweaving protosign and protospeech: further developments beyond the mirror / Michael A. Arbib -- The frame/content theory of evolution of speech: a comparison with a gestural-origins alternative / Peter F. MacNeilage and Barbara L. Davis -- Intentional communication and the anterior cingulate cortex / Oana Benga -- Gestural-vocal deixis and representational skills in early language development / Elena Pizzuto, Micaela Capobianco, and Antonella Devescovi -- Building a talking baby robot: a contribution to the study of speech acquisition and |
|
|
|
|
|
|
|
|
|
|
evolution / Jihène Serkhane, Jean-Luc Schwartz, and Pierre Bessière -- Aspects of descriptive, referential, and information structure in phrasal semantics: a contruction-based model / Peter F. Dominey -- First in, last out? the evolution of aphasic lexical speech automatisms to agrammatism and the evolution of human communication / Chris Code. |
|
|
|
|
|
| |