Sciweavers

332 search results - page 38 / 67
» The Monochromatic Column problem
Sort
View
EOR
2006
83views more  EOR 2006»
13 years 10 months ago
Lower bounds and heuristic algorithms for the k
We consider the problem of partitioning a set of positive integers values into a given number of subsets, each having an associated cardinality limit, so that the maximum sum of v...
Mauro Dell'Amico, Manuel Iori, Silvano Martello, M...
ISCAS
2008
IEEE
185views Hardware» more  ISCAS 2008»
14 years 4 months ago
A variant of a radix-10 combinational multiplier
— We consider the problem of adding the partial products in the combinational decimal multiplier presented by Lang and Nannarelli. In the original paper this addition is done wit...
Luigi Dadda, Alberto Nannarelli
CPM
2004
Springer
110views Combinatorics» more  CPM 2004»
14 years 3 months ago
Finding Biclusters by Random Projections
Given a matrix X composed of symbols, a bicluster is a submatrix of X obtained by removing some of the rows and some of the columns of X in such a way that each row of what is lef...
Stefano Lonardi, Wojciech Szpankowski, Qiaofeng Ya...
ICA
2004
Springer
14 years 3 months ago
Soft-LOST: EM on a Mixture of Oriented Lines
Robust clustering of data into overlapping linear subspaces is a common problem. Here we consider one-dimensional subspaces that cross the origin. This problem arises in blind sour...
Paul D. O'Grady, Barak A. Pearlmutter
TSP
2008
134views more  TSP 2008»
13 years 9 months ago
MIMO Instantaneous Blind Identification Based on Second-Order Temporal Structure
Blind identification is of paramount importance for well-known signal processing problems such as Blind Signal Separation and Direction Of Arrival (DOA) estimation. This paper pre...
Jakob van de Laar, Marc Moonen, Piet C. W. Sommen