149 search results - page 30 / 30 » Unsupervised clustering using hyperclique pattern constraint... |
178
click to vote
SAC
2010
ACM
16 years 10 days ago
2010
ACM
Numerous privacy models based on the k-anonymity property have been introduced in the last few years. While differing in their methods and quality of their results, they all focus...
176
click to vote
UIST
2004
ACM
16 years 13 days ago
2004
ACM
A long standing challenge in pen-based computer interaction is the ability to make sense of informal sketches. A main difficulty lies in reliably extracting and recognizing the i...
229
click to vote
WAW
2004
Springer
16 years 11 days ago
2004
Springer
We develop an algorithm to detect community structure in complex networks. The algorithm is based on spectral methods and takes into account weights and links orientations. Since t...
185
click to vote
PPOPP
2005
ACM
16 years 18 days ago
2005
ACM
In this paper, we develop a new language construct to address one of the pitfalls of parallel programming: precise handling of events across parallel components. The construct, te...