Always private
DuckDuckGo never tracks your searches.
Learn More
You can hide this reminder in Search Settings
All regions
Argentina
Australia
Austria
Belgium (fr)
Belgium (nl)
Brazil
Bulgaria
Canada (en)
Canada (fr)
Catalonia
Chile
China
Colombia
Croatia
Czech Republic
Denmark
Estonia
Finland
France
Germany
Greece
Hong Kong
Hungary
Iceland
India (en)
Indonesia (en)
Ireland
Israel (en)
Italy
Japan
Korea
Latvia
Lithuania
Malaysia (en)
Mexico
Netherlands
New Zealand
Norway
Pakistan (en)
Peru
Philippines (en)
Poland
Portugal
Romania
Russia
Saudi Arabia
Singapore
Slovakia
Slovenia
South Africa
Spain (ca)
Spain (es)
Sweden
Switzerland (de)
Switzerland (fr)
Taiwan
Thailand (en)
Turkey
Ukraine
United Kingdom
US (English)
US (Spanish)
Vietnam (en)
Safe search: moderate
Strict
Moderate
Off
Any time
Any time
Past day
Past week
Past month
Past year
  1. users.ece.utexas.edu

    IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS, VOL. 12, NO. 12, DECEMBER 2004 1277 Weighted Pseudorandom Hybrid BIST Abhijit Jas, Member, IEEE, C. V. Krishna, Member, IEEE, and Nur A. Touba, Member, IEEE Abstract—This paper presents a new test data-compression scheme that is a hybrid approach between external testing and
  2. en.wikipedia.org

    United States Secretary of Education Rod Paige calls the National Education Association, the nation's largest teachers' union, a "terrorist organization." He later apologizes, calling his comments "an inappropriate choice of words to describe the obstructionist scare tactics the NEA's Washington lobbyists have employed against No Child Left Behind's historic education reforms."
  3. sciencedirect.com

    We establish a so-called counting lemma that allows embeddings of certain linear uniform hypergraphs into sparse pseudorandom hypergraphs, generalizing a result for graphs (Kohayakawa et al., 2004).
    Author:Yoshiharu Kohayakawa, Guilherme Oliveira Mota, Mathias Schacht, Anusch TarazPublished:2017
  4. engineering.buffalo.edu

    Departmental technical reports may include faculty research work, doctoral dissertations, master's theses, and other student research recommended by faculty for publication.
  5. theory.stanford.edu

    General Information. Lecturer: Luca Trevisan, luca@eecs, 679 Soda Hall, Tel. 642 8006 . Classes are Tuesdays and Thursdays, 2:30-4:00pm, 310 Soda . Office hours: Mondays, 2-3pm, or by appointment . Course Requirements: scribing one or two lectures (depending on attendance); final project. References: the main reference for the course will be scribed lecture notes.
  6. A celebrated theorem of Pippenger states that any almost regular hypergraph with small codegrees has an almost perfect matching. We show that one can find such an almost perfect matching which is `pseudorandom', meaning that, for instance, the matching contains as many edges from a given set of edges as predicted by a heuristic argument.
  7. We study the problem of privacy-preserving access to a database. Particularly, we consider the problem of privacy-preserving keyword search (KS), where records in the database are accessed according to their associated keywords and where we care for the privacy of both the client and the server.
  8. Can’t find what you’re looking for?

    Help us improve DuckDuckGo searches with your feedback

Custom date rangeX