Sciweavers

572 search results - page 83 / 115
» Exponential-Time Approximation of Hard Problems
Sort
View
AAAI
1998
14 years 11 months ago
Applying Online Search Techniques to Continuous-State Reinforcement Learning
In this paper, we describe methods for e ciently computing better solutions to control problems in continuous state spaces. We provide algorithms that exploit online search to boo...
Scott Davies, Andrew Y. Ng, Andrew W. Moore
CANS
2011
Springer
292views Cryptology» more  CANS 2011»
13 years 10 months ago
Breaking Fully-Homomorphic-Encryption Challenges
At EUROCRYPT ’10, van Dijk, Gentry, Halevi and Vaikuntanathan presented simple fully-homomorphic encryption (FHE) schemes based on the hardness of approximate integer common div...
Phong Q. Nguyen
SIGMOD
2010
ACM
324views Database» more  SIGMOD 2010»
15 years 2 months ago
Similarity search and locality sensitive hashing using ternary content addressable memories
Similarity search methods are widely used as kernels in various data mining and machine learning applications including those in computational biology, web search/clustering. Near...
Rajendra Shinde, Ashish Goel, Pankaj Gupta, Debojy...
MOBIHOC
2010
ACM
14 years 8 months ago
On quality of monitoring for multi-channel wireless infrastructure networks
Passive monitoring utilizing distributed wireless sniffers is an effective technique to monitor activities in wireless infrastructure networks for fault diagnosis, resource manage...
Arun Chhetri, Huy Anh Nguyen, Gabriel Scalosub, Ro...
DAC
2007
ACM
15 years 11 months ago
An Effective Guidance Strategy for Abstraction-Guided Simulation
tive Guidance Strategy for Abstraction-Guided Simulation Flavio M. De Paula Alan J. Hu Department of Computer Science, University of British Columbia, {depaulfm, ajh}@cs.ubc.ca D...
Flavio M. de Paula, Alan J. Hu