4066 search results - page 357 / 814 » Almost Complete Sets |
199
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...
206
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...
152
Voted
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 ...
198
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...
179
click to vote
DLOG
1996
1996
Resolving Semantic Heterogeneity in Databases with a Terminological Model: Correspondence Refinement
15 years 8 months ago
The success of schema integration in multidatabase systems relies heavily on the determination of complete and refined correspondence relationships between them. So, the candidate...