Sciweavers

693 search results - page 114 / 139
» Minimization and Partitioning Method Reducing Input Sets
Sort
View
PKDD
2007
Springer
95views Data Mining» more  PKDD 2007»
15 years 7 months ago
Pruning Relations for Substructure Discovery of Multi-relational Databases
Multirelational data mining methods discover patterns across multiple interlinked tables (relations) in a relational database. In many large organizations, such a multi-relational ...
Hongyu Guo, Herna L. Viktor, Eric Paquet
CVPR
2010
IEEE
1192views Computer Vision» more  CVPR 2010»
15 years 10 months ago
RASL: Robust Alignment by Sparse and Low-rank Decomposition for Linearly Correlated Images
This paper studies the problem of simultaneously aligning a batch of linearly correlated images despite gross corruption (such as occlusion). Our method seeks an optimal set of im...
Yigang Peng, Arvind Balasubramanian, John Wright, ...
CSFW
2007
IEEE
15 years 7 months ago
Privacy and Utility in Business Processes
se an abstract model of business processes for the purpose of (i) evaluating privacy policy in light of the goals of the process and (ii) developing automated support for privacy ...
Adam Barth, John C. Mitchell, Anupam Datta, Sharad...
ICCAD
1999
IEEE
113views Hardware» more  ICCAD 1999»
15 years 5 months ago
Attractor-repeller approach for global placement
Traditionally, analytic placement used linear or quadratic wirelength objective functions. Minimizing either formulation attracts cells sharing common signals (nets) together. The...
Hussein Etawil, Shawki Areibi, Anthony Vannelli
ECCV
2010
Springer
15 years 3 months ago
Descriptor Learning for Efficient Retrieval
Many visual search and matching systems represent images using sparse sets of "visual words": descriptors that have been quantized by assignment to the best-matching symb...