3172 search results - page 410 / 635 » On the Random-Self-Reducibility of Complete Sets |
160
click to vote
ICWS
2003
IEEE
15 years 8 months ago
2003
IEEE
In this paper, we propose a method for automated web service composition by applying Linear Logic (LL) theorem proving. We distinguish value-added web services and core service by ...
196
click to vote
UAI
2004
15 years 8 months ago
2004
This paper uses Factored Latent Analysis (FLA) to learn a factorized, segmental representation for observations of tracked objects over time. Factored Latent Analysis is latent cl...
198
click to vote
KRDB
2003
15 years 8 months ago
2003
The Polylog framework is designed to provide a language for efficiently automating complex queries of information represented in multiple formats. A Polylog program contains a set...
151
click to vote
NETWORKING
2000
15 years 8 months ago
2000
Many works have studied the negative impact of slow start on the performance of short transfers. Some works propose to accelerate the window increase during this phase in order to ...
194
click to vote
UAI
2000
15 years 8 months ago
2000
In this paper we present decomposable priors, a family of priors over structure and parameters of tree belief nets for which Bayesian learning with complete observations is tracta...