Sciweavers

1984 search results - page 317 / 397
» The colourful feasibility problem
Sort
View
ECCC
2007
144views more  ECCC 2007»
13 years 10 months ago
Algebraic Lower Bounds for Computing on Encrypted Data
In cryptography, there has been tremendous success in building primitives out of homomorphic semantically-secure encryption schemes, using homomorphic properties in a blackbox way...
Rafail Ostrovsky, William E. Skeith III
JMIV
2006
115views more  JMIV 2006»
13 years 10 months ago
Application of the Fisher-Rao Metric to Structure Detection
Abstract - Certain structure detection problems can be solved by sampling a parameter space for the different structures at a finite number of points and checking each point to see...
Stephen J. Maybank
JMLR
2006
116views more  JMLR 2006»
13 years 10 months ago
Point-Based Value Iteration for Continuous POMDPs
We propose a novel approach to optimize Partially Observable Markov Decisions Processes (POMDPs) defined on continuous spaces. To date, most algorithms for model-based POMDPs are ...
Josep M. Porta, Nikos A. Vlassis, Matthijs T. J. S...
SIAMJO
2008
100views more  SIAMJO 2008»
13 years 10 months ago
On the Global Solution of Linear Programs with Linear Complementarity Constraints
This paper presents a parameter-free integer-programming based algorithm for the global resolution of a linear program with linear complementarity constraints (LPCC). The cornersto...
Jing Hu, John E. Mitchell, Jong-Shi Pang, Kristin ...
TDSC
2008
125views more  TDSC 2008»
13 years 10 months ago
Trustworthy Computing under Resource Constraints with the DOWN Policy
Trustworthy computing modules like secure coprocessors (ScP) are already in extensive use today, albeit limited predominantly to scenarios where constraints on cost is not a seriou...
Mahalingam Ramkumar