4791 search results - page 588 / 959 » Clustering with partial information |
220
click to vote
SIGGRAPH
2000
ACM
15 years 11 months ago
2000
ACM
We present an algorithm for out-of-core simplification of large polygonal datasets that are too complex to fit in main memory. The algorithm extends the vertex clustering scheme o...
166
Voted
AUSDM
2008
Springer
15 years 9 months ago
2008
Springer
Given the threat of re-identification in our growing digital society, guaranteeing privacy while providing worthwhile data for knowledge discovery has become a difficult problem. ...
188
click to vote
CICLING
2008
Springer
15 years 9 months ago
2008
Springer
Abstract. Automatic document summarization has become increasingly important due to the quantity of written material generated worldwide. Generating good quality summaries enables ...
228
click to vote
ISSRE
2007
IEEE
15 years 9 months ago
2007
IEEE
During development and testing, changes made to a system to repair a detected fault can often inject a new fault into the code base. These injected faults may not be in the same f...
196
click to vote
AVI
2004
15 years 9 months ago
2004
Complex hypermedia structures can be difficult to author and maintain, especially when the usual hierarchic representation cannot capture important relations. We propose a graph-b...