Sciweavers

387 search results - page 67 / 78
» Many Random Walks Are Faster Than One
Sort
View
CSR
2011
Springer
13 years 16 days ago
Improving the Space-Bounded Version of Muchnik's Conditional Complexity Theorem via "Naive" Derandomization
Abstract. Many theorems about Kolmogorov complexity rely on existence of combinatorial objects with specific properties. Usually the probabilistic method gives such objects with b...
Daniil Musatov
CHES
2011
Springer
254views Cryptology» more  CHES 2011»
12 years 9 months ago
Extractors against Side-Channel Attacks: Weak or Strong?
Randomness extractors are important tools in cryptography. Their goal is to compress a high-entropy source into a more uniform output. Beyond their theoretical interest, they have ...
Marcel Medwed, François-Xavier Standaert
AAAI
2012
11 years 11 months ago
Online Task Assignment in Crowdsourcing Markets
We explore the problem of assigning heterogeneous tasks to workers with different, unknown skill sets in crowdsourcing markets such as Amazon Mechanical Turk. We first formalize ...
Chien-Ju Ho, Jennifer Wortman Vaughan
BMCBI
2004
135views more  BMCBI 2004»
13 years 8 months ago
Information assessment on predicting protein-protein interactions
Background: Identifying protein-protein interactions is fundamental for understanding the molecular machinery of the cell. Proteome-wide studies of protein-protein interactions ar...
Nan Lin, Baolin Wu, Ronald Jansen, Mark Gerstein, ...
AI
2008
Springer
13 years 9 months ago
Modelling and solving temporal reasoning as propositional satisfiability
Representing and reasoning about time dependent information is a key research issue in many areas of computer science and artificial intelligence. One of the best known and widely...
Duc Nghia Pham, John Thornton, Abdul Sattar