16404 search results - page 801 / 3281 » A set coverage problem |
201
click to vote
PKC
2010
Springer
15 years 9 months ago
2010
Springer
This paper presents an efficient protocol for securely computing the fundamental problem of pattern matching. This problem is defined in the two-party setting, where party P1 hold...
193
click to vote
ESA
2008
Springer
15 years 9 months ago
2008
Springer
For a set P of n points in R2 , the Euclidean 2-center problem computes a pair of congruent disks of the minimal radius that cover P. We extend this to the (2, k)-center problem wh...
204
click to vote
ALT
2010
Springer
15 years 9 months ago
2010
Springer
: In many prediction problems, including those that arise in computer security and computational finance, the process generating the data is best modeled as an adversary with whom ...
200
click to vote
HIS
2008
15 years 9 months ago
2008
Artificial Neural Networks for online learning problems are often implemented with synaptic plasticity to achieve adaptive behaviour. A common problem is that the overall learning...
197
click to vote
HCI
2007
15 years 9 months ago
2007
With the U.S. facing a decline in science, math and engineering skills, there is a need for educators in these fields to team with engineers and cognitive scientists to pioneer nov...