We are improving our search experience. To check which content you have full access to, or for advanced search, go back to the old search.

Search

Please fill in this field.
Filters applied:

Search Results

Showing 201-220 of 287 results
  1. Generalities

    In this chapter we present all necessary definitions and preliminary results on cryptographic functions which are used throughout this book.
    Chapter 2014
  2. Introduction to Data Science

    So what is data science and why is it so topical? Is it just another fad that will fade away after the hype? We will start with a simple introduction...
    Roger Barga, Valentine Fontama, Wee Hyong Tok in Predictive Analytics with Microsoft Azure Machine Learning
    Chapter 2015
  3. Quaternary cryptographic bent functions and their binary projection

    The nonlinearity of sequences is one of the important security measures for stream cipher systems. Recently, in the study of vectorized stream cipher...

    Zoubida Jadda, Patrice Parraud, Soukayna Qarboua in Cryptography and Communications
    Article 30 November 2012
  4. Gradient-based boosting for statistical relational learning: the Markov logic network and missing data cases

    Recent years have seen a surge of interest in Statistical Relational Learning (SRL) models that combine logic with probabilities. One prominent and...

    Tushar Khot, Sriraam Natarajan, ... Jude Shavlik in Machine Learning
    Article 20 February 2015
  5. A New Approach to Optimization with Life Cycle Assessment: Combining Optimization with Detailed Process Simulation

    In this paper we describe an approach that combines system optimization under environmental constraints with a detailed simulation of the processes...
    Richard J. Wallace, Antonino Marvuglia, ... Ligia Tiruta-Barna in Computational Science and Its Applications – ICCSA 2014
    Conference paper 2014
  6. Construction of Highly Nonlinear Plateaued Resilient Functions with Disjoint Spectra

    The nonlinearity of Boolean functions is one of the most important cryptographic criterion to provide protection against linear approximation attack....
    Conference paper 2012
  7. Optimizing Base Rankers Using Clicks

    We study the problem of optimizing an individual base ranker using clicks. Surprisingly, while there has been considerable attention for using clicks...
    Anne Schuth, Floor Sietsma, ... Maarten de Rijke in Advances in Information Retrieval
    Conference paper 2014
  8. Quadratic functions with prescribed spectra

    Wilfried Meidl, Alev Topuzoğlu in Designs, Codes and Cryptography
    Article 30 May 2012
  9. Icebreakers

    The amount and type of teacher–student interaction in a Puzzle-based Learning course can vary widely based on the number of students in the course....
    Edwin F. Meyer, Nickolas Falkner, ... Zbigniew Michalewicz in Guide to Teaching Puzzle-based Learning
    Chapter 2014
  10. Some New Domain Restrictions in Social Choice, and Their Consequences

    Restricting the domains of definition of social choice functions is a classical method to test the robustness of impossibility results and to find...
    Salvador Barberà, Dolors Berga, Bernardo Moreno in Modeling Decisions for Artificial Intelligence
    Conference paper 2013
  11. Introduction to Data Science

    So what is data science and why is it so topical? Is it just another fad that will fade away after the hype? We will start with a simple introduction...
    Roger Barga, Valentine Fontama, Wee Hyong Tok in Predictive Analytics with Microsoft Azure Machine Learning
    Chapter 2014
  12. Construction of rotation symmetric Boolean functions with optimal algebraic immunity and high nonlinearity

    Recent research shows that the class of rotation symmetric Boolean functions is potentially rich in functions of cryptographic significance. In this...

    Sihong Su, **aohu Tang in Designs, Codes and Cryptography
    Article 19 July 2012
  13. Indexing Rich Internet Applications Using Components-Based Crawling

    Automatic crawling of Rich Internet Applications (RIAs) is a challenge because client-side code modifies the client dynamically, fetching server-side...
    Ali Moosavi, Salman Hooshmand, ... Iosif Viorel Onut in Web Engineering
    Conference paper 2014
  14. On semi-bent functions with Niho exponents

    Semi-bent functions are a kind of Boolean functions with high nonlinearity. They have important applications in cryptography and communications. In...

    YeFeng He, Wen** Ma, Parminder Kang in Science China Information Sciences
    Article 11 April 2012
  15. Introducing User-Centered Systems Design

    If designers and developers want to design better technologies that are intended for human use they need to have a good understanding of the people...
    Frank E. Ritter, Gordon D. Baxter, Elizabeth F. Churchill in Foundations for Designing User-Centered Systems
    Chapter 2014
  16. Data Mining

    Recommendation systems find and summarize patterns in the structure of some data or in how we visit that data. Such summarizing can be implemented by...
    Chapter 2014
  17. On the practical use of the spectral homotopy analysis method and local linearisation method for unsteady boundary-layer flows caused by an impulsively stretching plate

    This paper expands the ideas of the spectral homotopy analysis method to apply them, for the first time, on non-linear partial differential...

    Sandile S. Motsa in Numerical Algorithms
    Article 12 September 2013
  18. Semi-bent Functions with Multiple Trace Terms and Hyperelliptic Curves

    Semi-bent functions with even number of variables are a class of important Boolean functions whose Hadamard transform takes three values. Semi-bent...
    Conference paper 2012
  19. High availability, elasticity, and strong consistency for massively parallel scans over relational data

    An elastic and highly available data store is a key component of many cloud applications. Existing data stores with strong consistency guarantees are...

    Philipp Unterbrunner, Gustavo Alonso, Donald Kossmann in The VLDB Journal
    Article Open access 19 November 2013
  20. Construction of even-variable rotation symmetric Boolean functions with maximum algebraic immunity

    Rotation symmetric Boolean functions (RSBFs) have been used as components of different cryptosystems. In this paper, we investigate n -variable ( n ...

    Shao**g Fu, Chao Li, ... LongJiang Qu in Science China Information Sciences
    Article 03 December 2011
Did you find what you were looking for? Share feedback.