Sciweavers

9572 search results - page 363 / 1915
» Cover Algorithms and Their Combination
Sort
View
ENC
2004
IEEE
15 years 10 months ago
Efficient Data Structures and Parallel Algorithms for Association Rules Discovery
Discovering patterns or frequent episodes in transactions is an important problem in data-mining for the purpose of infering deductive rules from them. Because of the huge size of...
Christophe Cérin, Gay Gay, Gaël Le Mah...
ECCV
2010
Springer
15 years 8 months ago
Towards More Efficient and Effective LP-based algorithms for MRF Optimization
This paper proposes a framework that provides significant speed-ups and also improves the effectiveness of general message passing algorithms based on dual LP relaxations. It is ap...
ISCAPDCS
2007
15 years 8 months ago
Distributed algorithms for dynamic coverage in sensor networks
The coverage problem is of great interest for many sensor network applications, for example, detection of intruders in the sensor field. Topological changes in sensor networks ma...
Lan Lin, Hyunyoung Lee
SDM
2007
SIAM
74views Data Mining» more  SDM 2007»
15 years 8 months ago
HACS: Heuristic Algorithm for Clustering Subsets
The term consideration set is used in marketing to refer to the set of items a customer thought about purchasing before making a choice. While consideration sets are not directly ...
Ding Yuan, W. Nick Street
ACST
2006
15 years 8 months ago
Experimental study of hybrid-type distributed maximal constraint satisfaction algorithm
A constraint satisfaction problem (CSP) is a general framework that can formalize various application problems in artificial intelligence. However, practical real-world problems t...
Masato Noto, Masahito Kurihara