Sciweavers

2482 search results - page 116 / 497
» Analysis and Presentation of Results for Mobile Local Search
Sort
View
ICDM
2009
IEEE
134views Data Mining» more  ICDM 2009»
15 years 4 months ago
Efficient Discovery of Confounders in Large Data Sets
Given a large transaction database, association analysis is concerned with efficiently finding strongly related objects. Unlike traditional associate analysis, where relationships ...
Wenjun Zhou, Hui Xiong
CVPR
2010
IEEE
15 years 8 months ago
Simultaneous Searching of Globally Optimal Interacting Surfaces with Shape Priors
Multiple surface searching with only image intensity information is a difficult job in the presence of high noise and weak edges. We present in this paper a novel method for global...
Qi Song, Xiaodong Wu, Yunlong Liu, Mona Garvin, Mi...
ECSQARU
2005
Springer
15 years 12 months ago
Default Clustering from Sparse Data Sets
Categorization with a very high missing data rate is seldom studied, especially from a non-probabilistic point of view. This paper proposes a new algorithm called default clusterin...
Julien Velcin, Jean-Gabriel Ganascia
FLAIRS
2004
15 years 7 months ago
Dynamic Agent-Ordering and Nogood-Repairing in Distributed Constraint Satisfaction Problems
The distributed constraint satisfaction problem (CSP) is a general formalization used to represent problems in distributed multi-agent systems. To deal with realistic problems, mu...
Lingzhong Zhou, John Thornton, Abdul Sattar
ECCV
2008
Springer
15 years 7 months ago
Discriminative Locality Alignment
—This paper presents a fast part-based subspace selection algorithm, termed the binary sparse nonnegative matrix factorization (B-SNMF). Both the training process and the testing...
Tianhao Zhang, Dacheng Tao, Jie Yang