Sciweavers

2286 search results - page 95 / 458
» Algorithms for Categorical Equivalence
Sort
View
ICCAD
2001
IEEE
89views Hardware» more  ICCAD 2001»
15 years 6 months ago
Sequential SPFDs
SPFDs are a mechanism to express flexibility in Boolean networks. Introduced by Yamashita et al. in the context of FPGA synthesis [4], they were extended later to general combina...
Subarnarekha Sinha, Andreas Kuehlmann, Robert K. B...
IS
2002
14 years 9 months ago
Pushing extrema aggregates to optimize logic queries
In this paper, we explore the possibility of transforming queries with minimum and maximum predicates into equivalent queries that can be computed more efficiently. The main contr...
Filippo Furfaro, Sergio Greco, Sumit Ganguly, Carl...
WEBI
2005
Springer
15 years 3 months ago
A Semi-Supervised Document Clustering Algorithm Based on EM
Document clustering is a very hard task in Automatic Text Processing since it requires to extract regular patterns from a document collection without a priori knowledge on the cat...
Leonardo Rigutini, Marco Maggini
IJVR
2008
111views more  IJVR 2008»
14 years 10 months ago
Improve a Game Board based on Cultural Algorithms
Evolutionary computation is a generic term used to make reference to the solution of computational problems planned and implemented based on models of an evolutionary process. Most...
Alberto Ochoa, Alejandro Padilla, Saúl Gonz...
ALENEX
2008
142views Algorithms» more  ALENEX 2008»
14 years 11 months ago
Consensus Clustering Algorithms: Comparison and Refinement
Consensus clustering is the problem of reconciling clustering information about the same data set coming from different sources or from different runs of the same algorithm. Cast ...
Andrey Goder, Vladimir Filkov