We consider the problem of finding a maximum independent set in a random graph. The random graph G, which contains n vertices, is modelled as follows. Every edge is included inde...
Association Rule Mining algorithms operate on a data matrix to derive association rule, discarding the quantities of the items, which contains valuable information. In order to mak...
This paper deals with a problem of recognition by gait when time-dependent covariates are added, i.e. when 6 months have passed between recording of the gallery and the probe sets....
From Proc. CAiSE05 LNCS 3520, Pages 460-474 c Springer-Verlag 2005 Semi-structured data sources, such as XML, HTML or CSV files, present special problems when performing data int...
In many important applications, a collection of mutually distrustful parties must perform private computation over multisets. Each party’s input to the function is his private i...