164 search results - page 9 / 33 » Maximally joining probabilistic data |
CIMCA
2005
IEEE
15 years 3 months ago
2005
IEEE
We give a fast and practical algorithm for statistical learning hyperparameters from observable data in probabilistic image processing, which is based on Gaussian graphical model ...
CIDR
2003
14 years 11 months ago
2003
Traditional science searched for new objects and phenomena that led to discoveries. Tomorrow's science will combine together the large pool of information in scientific archi...
SIGMOD
2005
ACM
15 years 9 months ago
2005
ACM
We consider the problem of joining data streams using limited cache memory, with the goal of producing as many result tuples as possible from the cache. Many cache replacement heu...
74
Voted
SIGGRAPH
2000
ACM
15 years 2 months ago
2000
ACM
Named after the title, the PCCM transformation is a simple, explicit algorithm that creates large, smoothly joining bicubic Nurbs patches from a refined Catmull-Clark subdivision...
ISI
2008
Springer
14 years 9 months ago
2008
Springer
Often several cooperating parties would like to have a global view of their joint data for various data mining objectives, but cannot reveal the contents of individual records due...