1083 search results - page 95 / 217 » Efficient Discovery of Confounders in Large Data Sets |
250
click to vote
ICDE
2000
IEEE
16 years 7 months ago
2000
IEEE
Dynamic Miss-Countingalgorithms are proposed, which find all implication and similarity rules with confidence pruning but without support pruning. To handle data sets with a large...
179
click to vote
CVPR
2007
IEEE
16 years 8 months ago
2007
IEEE
Volume intersection is a frequently used technique to solve the Shape-From-Silhouette problem, which constructs a 3D object estimate from a set of silhouettes taken with calibrate...
178
click to vote
KDD
2002
ACM
16 years 6 months ago
2002
ACM
Text clustering methods can be used to structure large sets of text or hypertext documents. The well-known methods of text clustering, however, do not really address the special p...
177
click to vote
CIKM
1997
Springer
15 years 10 months ago
1997
Springer
This paper presents an efficient algorithm for learning Bayesian belief networks from databases. The algorithm takes a database as input and constructs the belief network structur...
174
click to vote
TOG
2002
15 years 6 months ago
2002
Real-time control of three-dimensional avatars is an important problem in the context of computer games and virtual environments. Avatar animation and control is difficult, howeve...