10 Hits in 3.8 sec

06111 Abstracts Collection – Complexity of Boolean Functions

Matthias Krause, Pavel Pudlák, Rüdiger Reischuk, Dieter van Melkebeek
From 12.03.06 to 17.03.06, the Dagstuhl Seminar 06111 "Complexity of Boolean Functions" was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl.  ...  Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper.  ...  The complexity of Boolean functions from cryptographic viewpoint Claude Carlet (Université de Paris VIII, F) Cryptographic Boolean functions must be complex to satisfy Shannon's principle of confusion.  ... 
doi:10.4230/dagsemproc.06111.1 fatcat:vzcxxxlpxfgrfc772xeh2xaxpq

Executive Summary of the Dagstuhl Seminar 06111 "Complexity of Boolean Functions"

Matthias Krause, Dieter Van Melkebeek, Wisconsin Madison, Czech Pudlák, Rüdiger Republic, Reischuk, Lübeck
Dagstuhl Seminar Proceedings 06111 Complexity of Boolean Functions  ...  More details can be found in the Abstracts Collection, which are ordered alphabetically by authors' names.  ... 

Switching-Device Requirements for a New Horizontal-Deflection System

D. E. Burke
1969 IEEE Transactions on Broadcast and Television Receivers  
Slaven, Manager of Filter Group, for his direction and assistance in the preparation of this article; and to C. Cannon for typing the manuscript.  ...  Acknowledgment The authors acknowledge the assistance of Mr. John H, Hayden, senior design specialist, for his invaluable contribution to the design of this fluid thermal actuator.  ...  This can be accomplished with circuitry for the complex addressing a series of binary gates or perhaps the function instead of the electron beam. easiest way is to use a commercially In this case, the  ... 
doi:10.1109/tbtr1.1969.4320172 fatcat:cwvhiwx45rcxjly6ciek2o2oku

Dagstuhl Annual Report

Schloss Dagstuhl
The by invitation participation allowed us to have a set of high-level and nicely interdisciplinary researchers, discussing issues from different points of views.  ...  Several follow-up activities have been suggested, like turning this rich body of material into a (in the field very much needed) tutorial-like publication, organizing some kind of annual student ECA challenge  ...  Sester (Univ. of Hannover, DE), M. Worboys (Univ. of Maine, USA), P. van Oosterom (TU of Delft, NL) 06111, 13 -18 March 2006 Complexity of Boolean Functions M. Krause (Univ. of Mannheim, DE), P.  ... 

Dagstuhl TÄtigkeitsbericht Januar-Dezember 2005 2006 SCHLOSS DAGSTUHL INTERNATIONALES BEGEGNUNGS-UND FORSCHUNGSZENTRUM FÜR INFORMATIK Dagstuhl TÄtigkeitsbericht Januar-Dezember 2005

Geschäftsstelle Schloss Dagstuhl
Worboys (Univ. of Maine, US), P. van Oosterom (TU Delft, NL) 06111, 12.03.2006 -17.03.2006 Complexity of Boolean Functions M. Krause (Univ. Mannheim, DE), P.  ...  DROPS-Publikationen (Stand: März 2006) 2004 2005 Bände Dagstuhl Seminar Proceedings 30 25 Abstracts Collections / Reports 27 24 Summaries / Manifestos 14 23 Papers / Extended Abstracts  ...  "Wednesdayexcursion" which consisted of a visit of the Villeroy & Boch museum, a boat-trip on the river Saar, a stop-over at the beautiful Saarschleife and a wine-tasting, an finally the marvellous "Thursday-barbecue  ... 

Dagstuhl Annual Report

Schloss Dagstuhl
Worboys (Univ. of Maine, US), P. van Oosterom (TU Delft, NL) 06111, 12.03.2006 -17.03.2006 Complexity of Boolean Functions M. Krause (Univ. Mannheim, DE), P.  ...  Example: The following has been published on DROPS so far for 2006 for 29 seminars (of a total of 48): 252 abstract collections, papers and other documents.  ...  members of both communities.  ... 

Low autocorrelation sequences and flat polynomials [article]

Kai-Uwe Schmidt, Universitäts- Und Landesbibliothek Sachsen-Anhalt, Martin-Luther Universität, Alexander Pott
The methods are also applied to prove limit theorems for nonlinearity measures of Boolean functions.  ...  sehr allgemein anwendbar und wird weiterentwickelt, um eine Reihe von Vermutungen zu beweisen und einfachere und vereinheitlichende Beweise für viele bekannte Resultate in diesem Gebiet zu geben. iii iv Abstract  ...  Acknowledgement I thank Claude Carlet for some careful comments on a draft of this paper.  ... 
doi:10.25673/4118 fatcat:4sixhkzlhjhr7bqgtodiqf6hzm

Using Wikipedia Knowledge and Query Types in a New Indexing Approach for Web Search Engines

Falah Hassan Ali Al-Akashi, Université D'Ottawa / University Of Ottawa, Université D'Ottawa / University Of Ottawa
The Web is comprised of a vast quantity of text.  ...  There are many fundamental questions that need to be addressed, including: How many types of domains/websites are there in the Web? What type of data is in each type of domain?  ...  To reduce the complexity of search in long queries, most search engines, similarly to our approach, use Boolean searching to reduce the probability of term distribution on the document content.  ... 
doi:10.20381/ruor-6304 fatcat:bbie5vtmt5cn5gor4gfzndvhgm

Greg Welch (University of North Carolina-Chapel Hill, USA) 08241

Geschäftsstelle Schloss Dagstuhl, D Harel, S Böttcher, D Laidlaw, E Burke, G Boella, Dirk Arnold, Anne Auger, Stefan Droste, Universität Dortmund, Jonathan Rowe, Jane Liu (+26 others)
2006 Space Embeddings J. Gudmundsson (National ICT Australia   unpublished
Worboys (Univ. of Maine, US), P. van Oosterom (TU Delft, NL) 06111, 12.03.2006 -17.03.2006 Complexity of Boolean Functions M. Krause (Univ. Mannheim, DE), P.  ...  Für das Jahr 2006 wurden bislang zu 29 (von insges. 48 Seminaren) 252 Abstract Collections, Papers und andere Dokumente auf DROPS publi- ziert.  ...  members of both communities.  ... 

Geometric Networks and Metric Space

S Oishi (waseda Univ, M Jp), Plum (univ, Karlsruhe, S De), Rump
2005 unpublished
Worboys (Univ. of Maine, US), P. van Oosterom (TU Delft, NL) 06111, 12.03.2006 -17.03.2006 Complexity of Boolean Functions M. Krause (Univ. Mannheim, DE), P.  ...  the function rooms in the old building, providing for a large number of laptop places featuring Internet access.  ...  The Center's management committee is charged with the task of canvassing for donations and contributions for the purpose of securing the financial prerequisites of the Foundation as specified in sections  ...