4860 search results - page 573 / 972 » SNPs Problems, Complexity, and Algorithms |
174
Voted
ICCV
2005
IEEE
15 years 10 months ago
2005
IEEE
We address the problem of seeking the global mode of a density function using the mean shift algorithm. Mean shift, like other gradient ascent optimisation methods, is susceptible...
161
Voted
SPAA
2010
ACM
15 years 5 months ago
2010
ACM
We develop logarithmic approximation algorithms for extremely general formulations of multiprocessor multiinterval offline task scheduling to minimize power usage. Here each proce...
192
click to vote
TCC
2007
Springer
15 years 11 months ago
2007
Springer
In this work we present secure two-party protocols for various core problems in linear algebra. Our main result is a protocol to obliviously decide singularity of an encrypted matr...
149
click to vote
MM
2004
ACM
15 years 10 months ago
2004
ACM
The realization of multimedia systems still heavily relies on building monolithic systems that need to be reengineered for every change in the application and little of which can ...
144
click to vote
SIAMCOMP
1998
15 years 4 months ago
1998
This paper continues the investigation of the connection between probabilistically checkable proofs (PCPs) and the approximability of NP-optimization problems. The emphasis is on p...