10289 search results - page 1896 / 2058 » Standard bases in K |
188
click to vote
CCO
2001
Springer
15 years 11 months ago
2001
Springer
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
171
click to vote
CCS
2001
ACM
15 years 11 months ago
2001
ACM
Authenticating mobile computing users can require a significant amount of processing and communications resources— particularly when protocols based on public key encryption are...
200
click to vote
SSIAI
2000
IEEE
15 years 11 months ago
2000
IEEE
In this paper we propose a new probabilistic relaxation framework to perform robust multiple motion estimation and segmentation from a sequence of images. Our approach uses displa...
131
click to vote
SIGUCCS
2000
ACM
15 years 11 months ago
2000
ACM
This paper will provide a useful guide to those schools that have not yet implemented IMAP and are considering doing so. With both the systems and user services perspectives, any ...
154
click to vote
COLT
1999
Springer
15 years 10 months ago
1999
Springer
The empirical error on a test set, the hold-out estimate, often is a more reliable estimate of generalization error than the observed error on the training set, the training estim...