Sparse modelling and multi-exponential analysis (Dagstuhl Seminar 15251)

نویسندگان

  • Annie A. M. Cuyt
  • George Labahn
  • Avraham Sidi
  • Wen-shin Lee
چکیده

Computational Social Choice: Theory and Applications (Dagstuhl Seminar 15241) Britta Dorn, Nicolas Maudet, and Vincent Merlin . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 Complexity of Symbolic and Numerical Problems (Dagstuhl Seminar 15242) Peter Bürgisser, Felipe Cucker, Marek Karpinski, and Nicolai Vorobjov . . . . . . . . . . 28 Sparse Modelling and Multi-exponential Analysis (Dagstuhl Seminar 15251) Annie Cuyt, George Labahn, Avraham Sidi, and Wen-shin Lee . . . . . . . . . . . . . . . . . . . 48 Logics for Dependence and Independence (Dagstuhl Seminar 15261) Erich Grädel, Juha Kontinen, Jouko Väänänen, and Heribert Vollmer . . . . . . . . . . . 70

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sparse modelling and multi-exponential analysis

The research fields of harmonic analysis, approximation theory and computer algebra are seemingly different domains and are studied by seemingly separated research communities. However, all of these are connected to each other in many ways. The connection between harmonic analysis and approximation theory is not accidental: several constructions among which wavelets and Fourier series, provide ...

متن کامل

Exponential Algorithms: Algorithms and Complexity Beyond Polynomial Time (Dagstuhl Seminar 13331)

This report documents the program and the outcomes of Dagstuhl Seminar 13331 “Exponential Algorithms: Algorithms and Complexity Beyond Polynomial Time”. Problems are often solved in practice by algorithms with worst-case exponential time complexity. It is of interest to find the fastest algorithms for a given problem, be it polynomial, exponential, or something in between. The focus of the semi...

متن کامل

Moderately Exponential Time Algorithms Dagstuhl Seminar

From 19/10/2008 to 24/10/2008, the Dagstuhl Seminar 08431 Moderately Exponential Time Algorithms was held in Schloss Dagstuhl Leibniz Center for Informatics. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put...

متن کامل

Indexes and Computation over Compressed Structured Data (Dagstuhl Seminar 13232)

Belief Change and Argumentation in Multi-Agent Scenarios (Dagstuhl Seminar 13231) Jürgen Dix, Sven Ove Hansson, Gabriele Kern-Isberner, and Guillermo Simari . . . 1 Indexes and Computation over Compressed Structured Data (Dagstuhl Seminar 13232) Sebastian Maneth and Gonzalo Navarro . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 22 Virtual Realities (Dagstuhl S...

متن کامل

Meta-Modeling Model-Based Engineering Tools (Dagstuhl Seminar 13182)

Formal Verification of Distributed Algorithms (Dagstuhl Seminar 13141) Bernadette Charron-Bost, Stepahn Merz, Andrey Rybalchenko, and Josef Widder 1 Correct and Efficient Accelerator Programming (Dagstuhl Seminar 13142) Albert Cohen, Alastair F. Donaldson, Marieke Huisman, and Joost-Pieter Katoen 17 Drawing Graphs and Maps with Curves (Dagstuhl Seminar 13151) Stephen Kobourov, Martin Nöllenburg...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Dagstuhl Reports

دوره 5  شماره 

صفحات  -

تاریخ انتشار 2015