Sciweavers

2412 search results - page 216 / 483
» Which Problems Have Strongly Exponential Complexity
Sort
View
DCC
2005
IEEE
16 years 3 months ago
Towards Practical Minimum-Entropy Universal Decoding
Minimum-entropy decoding is a universal decoding algorithm used in decoding block compression of discrete memoryless sources as well as block transmission of information across di...
Todd P. Coleman, Muriel Médard, Michelle Ef...
VLDB
2007
ACM
187views Database» more  VLDB 2007»
16 years 4 months ago
Secure Data Outsourcing
The networked and increasingly ubiquitous nature of today's data management services mandates assurances to detect and deter malicious or faulty behavior. This is particularly...
Radu Sion

Publication
334views
16 years 24 days ago
Rollout Sampling Approximate Policy Iteration
Several researchers have recently investigated the connection between reinforcement learning and classification. We are motivated by proposals of approximate policy iteration schem...
Christos Dimitrakakis, Michail G. Lagoudakis
135
Voted
MFCS
2007
Springer
15 years 10 months ago
Hardness Results for Tournament Isomorphism and Automorphism
A tournament is a graph in which each pair of distinct vertices is connected by exactly one directed edge. Tournaments are an important graph class, for which isomorphism testing ...
Fabian Wagner
COR
2008
128views more  COR 2008»
15 years 3 months ago
Search-based software engineering
In the past five years there has been a dramatic increase in work on Search Based Software Engineering (SBSE), an approach to software engineering in which search based optimisatio...
Walter J. Gutjahr, Mark Harman