Sciweavers

288 search results - page 45 / 58
» A distributed algorithm for anytime coalition structure gene...
Sort
View
KDD
2007
ACM
124views Data Mining» more  KDD 2007»
14 years 1 months ago
Hierarchical mixture models: a probabilistic analysis
Mixture models form one of the most widely used classes of generative models for describing structured and clustered data. In this paper we develop a new approach for the analysis...
Mark Sandler
ISSTA
2004
ACM
14 years 28 days ago
Evolutionary testing in the presence of loop-assigned flags: a testability transformation approach
Evolutionary testing is an effective technique for automatically generating good quality test data. However, for structural testing, the technique degenerates to random testing i...
André Baresel, David Binkley, Mark Harman, ...
AAECC
2001
Springer
132views Algorithms» more  AAECC 2001»
14 years 11 hour ago
Duality and Greedy Weights of Linear Codes and Projective Multisets
A projective multiset is a collection of projective points, which are not necessarily distinct. A linear code can be represented as a projective multiset, by taking the columns of ...
Hans Georg Schaathun
KDD
2006
ACM
164views Data Mining» more  KDD 2006»
14 years 8 months ago
Assessing data mining results via swap randomization
The problem of assessing the significance of data mining results on high-dimensional 0?1 data sets has been studied extensively in the literature. For problems such as mining freq...
Aristides Gionis, Heikki Mannila, Panayiotis Tsapa...
CP
2005
Springer
14 years 1 months ago
Neighbourhood Clause Weight Redistribution in Local Search for SAT
Abstract. In recent years, dynamic local search (DLS) clause weighting algorithms have emerged as the local search state-of-the-art for solving propositional satisfiability proble...
Abdelraouf Ishtaiwi, John Thornton, Abdul Sattar, ...