Sciweavers

569 search results - page 63 / 114
» An efficient clustering method for k-anonymization
Sort
View
KDD
2002
ACM
191views Data Mining» more  KDD 2002»
14 years 9 months ago
Multimedia Knowledge Integration, Summarization And Evaluation
This paper presents new methods for automatically integrating, summarizing and evaluating multimedia knowledge. These are essential for multimedia applications to efficiently and ...
Ana B. Benitez, Shih-Fu Chang
HT
1991
ACM
14 years 7 days ago
Implementing Hypertext Database Relationships through Aggregations and Exceptions
In order to combine hypertext with database facilities, we show how to extract an effective storage structure from given instance relationships. The schema of the structure recogn...
Yoshinori Hara, Arthur M. Keller, Gio Wiederhold
VIS
2008
IEEE
204views Visualization» more  VIS 2008»
14 years 10 months ago
Surface Extraction from Multi-field Particle Volume Data Using Multi-dimensional Cluster Visualization
Data sets resulting from physical simulations typically contain a multitude of physical variables. It is, therefore, desirable that visualization methods take into account the enti...
Lars Linsen, Tran Van Long, Paul Rosenthal, Ste...
BMCBI
2007
133views more  BMCBI 2007»
13 years 8 months ago
MATLIGN: a motif clustering, comparison and matching tool
Background: Sequence motifs representing transcription factor binding sites (TFBS) are commonly encoded as position frequency matrices (PFM) or degenerate consensus sequences (CS)...
Matti Kankainen, Ari Löytynoja
ICCV
2005
IEEE
14 years 10 months ago
A Spectral Technique for Correspondence Problems Using Pairwise Constraints
We present an efficient spectral method for finding consistent correspondences between two sets of features. We build the adjacency matrix M of a graph whose nodes represent the p...
Marius Leordeanu, Martial Hebert