Time Series Analysis Using NOC Noriaki Kawamae The University of Tokyo 7 Chome-3-1 Hongo, Bunkyo, Tokyo, Japan Japan

Source URL: gdac.uqam.ca

• Computational linguistics
• Linguistics
• Corpus linguistics
• Artificial intelligence
• Statistical natural language processing
• Speech recognition
• Applied linguistics
• Natural language processing
• Topic model
• N-gram
• Time series

Pollard Rho on the PlayStation 3 Joppe W. Bos1 1 EPFL 2 Microsoft

Source URL: www.hyperelliptic.org

• Cryptography
• Abstract algebra
• Algebra
• Finite fields
• Group theory
• Applied mathematics
• Logarithms
• Elliptic-curve cryptography
• Discrete logarithm
• Key size
• Elliptic curve
• Cryptanalysis

Page 1 of 3 The ExpressVote Voter Assistance Terminal Operating Instructions The ExpressVote voter assistance terminal is an accessible device that displays the ballot on a screen and uses a touch screen or keypad to re

Source URL: idahovotes.gov

• Assistive technology
• Educational technology
• Web accessibility
• Electronic voting
• Keypad
• Touchscreen
• Humancomputer interaction
• Input/output
• Human behavior

tifact Categories and Subject Descriptors D.3.3 [Programming Languages]: Language Constructs and Features Keywords Macros, hygiene, binding, scope 1.

Source URL: www.cs.utah.edu

• Software engineering
• Computer programming
• Computing
• Transformation languages
• Metaprogramming
• Source code
• Dylan
• Hygienic macro
• Scheme
• Macro
• Scope
• Anonymous function

Code-Carrying Authorization Sergio Maffeis2,3 , Mart´ın Abadi1,2 , C´edric Fournet1 , and Andrew D. Gordon1 1 2

Source URL: www.doc.ic.ac.uk

• Process calculi
• Theoretical computer science
• -calculus
• Expected value
• Mathematics
• Creativity
• Abstraction

MiniMaxSat: a New Weighted Max-SAT Solver Federico Heras, Javier Larrosa, and Albert Oliveras Universitat Politecnica de Catalunya, Jordi Girona 1-3, 08034 Barcelona, Spain Abstract. In this paper we introduce M INI M A

Source URL: www.lsi.upc.edu

• Theoretical computer science
• Mathematics
• Computational complexity theory
• Logic in computer science
• Automated theorem proving
• Boolean algebra
• NP-complete problems
• Combinatorial optimization
• Maximum satisfiability problem
• Boolean satisfiability problem
• Resolution
• Unit propagation

On the (Im)possibility of Blind Message Authentication Codes Michel Abdalla1 , Chanathip Namprempre2 , and Gregory Neven1,3 1 Departement d’Informatique

Source URL: www.neven.org

• Cryptography
• Public-key cryptography
• Message authentication codes
• Error detection and correction
• Financial cryptography
• Digital signature
• Blind signature

Do Cascades Recur? Justin Cheng1 , Lada A Adamic2 , Jon Kleinberg3 , Jure Leskovec4 1,4 1,4 Stanford University, 2 Facebook, 3 Cornell University

Source URL: gdac.uqam.ca

PRÊT A CHANTER: THE RULES §1 No speaking. Only vocalisations other than speaking are allowed——————§2 The number TWO is not allowed—————— §3 In this opera, speaking is considered

Source URL: odrathek.org

• Music
• Human voice
• Extended techniques
• Multiphonic
• Lore Lixenberg
• Overtone
• Yodeling

Bulletproofs: Short Proofs for Confidential Transactions and More Benedikt B¨ unz∗1 , Jonathan Bootle†2 , Dan Boneh‡1 , Andrew Poelstra§3 , Pieter Wuille¶3 , and Greg Maxwellk 1

Source URL: web.stanford.edu

• Cryptography
• Cryptocurrencies
• Alternative currencies
• Bitcoin
• Decentralization
• Cryptographic protocols
• Non-interactive zero-knowledge proof
• Zero-knowledge proof
• Proof of knowledge
• NP
• Soundness
• IP