1026 search results - page 92 / 206 » On Finding Minimal w-cutset |
169
click to vote
FOCS
1999
IEEE
15 years 10 months ago
1999
IEEE
We consider the DIRECTED STEINER NETWORK problem, also called the POINT-TO-POINT CONNECTION problem, where given a directed graph G and p pairs {(s1,t1),...,(sp,tp)} of nodes in t...
162
click to vote
ICDCS
1999
IEEE
15 years 10 months ago
1999
IEEE
In this paper, we describe the design and implementation of an integrated architecture for cache systems that scale to hundreds or thousands of caches with thousands to millions o...
158
click to vote
COLT
1999
Springer
15 years 10 months ago
1999
Springer
We consider the AdaBoost procedure for boosting weak learners. In AdaBoost, a key step is choosing a new distribution on the training examples based on the old distribution and th...
163
click to vote
DSS
2000
15 years 6 months ago
2000
By using panel data spanning a period of 18 years and by estimating a general cost function in a cost minimization Z .setting, we conducted an analysis of information technology I...
197
click to vote
CORR
2002
Springer
15 years 6 months ago
2002
Springer
A relational database is inconsistent if it does not satisfy a given set of integrity constraints. Nevertheless, it is likely that most of the data in it is consistent with the co...