8949 search results - page 1565 / 1790 » is 1998 |
162
click to vote
DAM
1998
15 years 6 months ago
1998
We first consider so-called (1,+s)-branching programs in which along every consistent path at most s variables are tested more than once. We prove that any such program computing...
169
click to vote
DATAMINE
1998
15 years 6 months ago
1998
The tutorial starts with an overview of the concepts of VC dimension and structural risk minimization. We then describe linear Support Vector Machines (SVMs) for separable and non-...
171
click to vote
DC
1998
15 years 6 months ago
1998
We show that the problem of predicate detection in distributed systems is NP-complete. In the past, efficient algorithms have been developed for special classes of predicates suc...
160
click to vote
DCG
1998
15 years 6 months ago
1998
We present a simple and e cient paradigm for computing the exact solution of the motionplanning problem in environments with a low obstacle density. Such environments frequently o...
175
click to vote
DEBU
1998
15 years 6 months ago
1998
Applications that rely on replicated data have different requirements for how their data is managed. For example, some applications may require that updates propagate amongst repl...