6715 search results - page 783 / 1343 » Learning from a Test Set |
185
click to vote
CRYPTO
2008
Springer
15 years 9 months ago
2008
Springer
In this work we study the design of secure protocols for linear algebra problems. All current solutions to the problem are either inefficient in terms of communication complexity o...
205
click to vote
SDM
2008
SIAM
15 years 8 months ago
2008
SIAM
In this paper, we present a measure associated with detection and inference of statistically anomalous clusters of a graph based on the likelihood test of observed and expected ed...
192
click to vote
NIPS
2003
15 years 8 months ago
2003
This paper presents a novel graph-theoretic approach, named ratio contour, to extract perceptually salient boundaries from a set of noisy boundary fragments detected in real image...
168
click to vote
HM
2010
Springer
15 years 8 months ago
2010
Springer
The problem of designing workforce shifts and break patterns is a relevant employee scheduling problem that arises in many contexts, especially in service industries. The issue is ...
192
click to vote
EOR
2010
15 years 7 months ago
2010
In this work we study the Capacitated p-Center Problem (CpCP) and we propose an exact algorithm to solve it. We study two auxiliary problems and their relation to CpCP, and we pro...