Sciweavers

16218 search results - page 2856 / 3244
» Standards
Sort
View
APPROX
2007
Springer
160views Algorithms» more  APPROX 2007»
16 years 1 months ago
Better Binary List-Decodable Codes Via Multilevel Concatenation
We give a polynomial time construction of binary codes with the best currently known trade-off between rate and error-correction radius. Specifically, we obtain linear codes ove...
Venkatesan Guruswami, Atri Rudra
APPROX
2007
Springer
104views Algorithms» more  APPROX 2007»
16 years 1 months ago
Worst-Case to Average-Case Reductions Revisited
Abstract. A fundamental goal of computational complexity (and foundations of cryptography) is to find a polynomial-time samplable distribution (e.g., the uniform distribution) and...
Dan Gutfreund, Amnon Ta-Shma
ASIAN
2007
Springer
102views Algorithms» more  ASIAN 2007»
16 years 1 months ago
A Static Birthmark of Binary Executables Based on API Call Structure
Abstract. A software birthmark is a unique characteristic of a program that can be used as a software theft detection. In this paper we suggest and empirically evaluate a static bi...
Seokwoo Choi, Heewan Park, Hyun-il Lim, Taisook Ha...
ATAL
2007
Springer
16 years 1 months ago
Model-based function approximation in reinforcement learning
Reinforcement learning promises a generic method for adapting agents to arbitrary tasks in arbitrary stochastic environments, but applying it to new real-world problems remains di...
Nicholas K. Jong, Peter Stone
ATAL
2007
Springer
16 years 1 months ago
Modelling the provenance of data in autonomous systems
Determining the provenance of data, i.e. the process that led to that data, is vital in many disciplines. For example, in science, the process that produced a given result must be...
Simon Miles, Steve Munroe, Michael Luck, Luc Morea...
« Prev « First page 2856 / 3244 Last » Next »