Sciweavers

1522 search results - page 62 / 305
» On the Complexity of Several Haplotyping Problems
Sort
View
PODS
2008
ACM
153views Database» more  PODS 2008»
14 years 8 months ago
Approximation algorithms for co-clustering
Co-clustering is the simultaneous partitioning of the rows and columns of a matrix such that the blocks induced by the row/column partitions are good clusters. Motivated by severa...
Aris Anagnostopoulos, Anirban Dasgupta, Ravi Kumar
SETN
2004
Springer
14 years 1 months ago
A Meta-classifier Approach for Medical Diagnosis
Abstract. Single classifiers, such as Neural Networks, Support Vector Machines, Decision Trees and other, can be used to perform classification of data for relatively simple proble...
George L. Tsirogiannis, Dimitrios S. Frossyniotis,...
JPDC
2006
94views more  JPDC 2006»
13 years 7 months ago
Exchanging messages of different sizes
This paper deals with the study of the exchange of messages among a set of processors linked through an interconnection network. We focus on general, non-uniform versions of messa...
Alfredo Goldman, Joseph G. Peters, Denis Trystram
SIGPRO
2011
209views Hardware» more  SIGPRO 2011»
13 years 2 months ago
Surveying and comparing simultaneous sparse approximation (or group-lasso) algorithms
In this paper, we survey and compare different algorithms that, given an overcomplete dictionary of elementary functions, solve the problem of simultaneous sparse signal approxim...
A. Rakotomamonjy
ADC
2006
Springer
128views Database» more  ADC 2006»
14 years 1 months ago
Horn clauses and functional dependencies in complex-value databases
We extend Fagin’s result on the equivalence between functional dependencies in relational databases and propositional Horn clauses. It is shown that this equivalence still holds...
Sven Hartmann, Sebastian Link