1814 search results - page 211 / 363 » Watermarking relational data: framework, algorithms and anal... |
187
click to vote
KDD
2004
ACM
16 years 7 months ago
2004
ACM
Co-clustering is a powerful data mining technique with varied applications such as text clustering, microarray analysis and recommender systems. Recently, an informationtheoretic ...
175
click to vote
DATE
2006
IEEE
16 years 17 days ago
2006
IEEE
Memory elements are the most vulnerable system component to soft errors. Since memory elements in cache arrays consume a large fraction of the die in modern microprocessors, the p...
193
click to vote
KDD
2012
ACM
13 years 9 months ago
2012
ACM
Most existing research about online trust assumes static trust relations between users. As we are informed by social sciences, trust evolves as humans interact. Little work exists...
203
click to vote
KDD
2009
ACM
16 years 7 months ago
2009
ACM
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-s...
199
click to vote
ICASSP
2010
IEEE
15 years 6 months ago
2010
IEEE
We present a novel framework based on hidden Markov models (HMMs) for matching feature point sets, which capture the shapes of object contours of interest. Point matching algorith...