Sciweavers

332 search results - page 43 / 67
» The Monochromatic Column problem
Sort
View
TIT
2002
57views more  TIT 2002»
13 years 9 months ago
Writing sequences on the plane
The problem of arranging two-dimensional arrays of data into one-dimensional sequences comes up in image processing, color quantization, and optical and magnetic data recording. A ...
Emina Soljanin
MP
2010
116views more  MP 2010»
13 years 8 months ago
New techniques for cost sharing in combinatorial optimization games
Combinatorial optimization games form an important subclass of cooperative games. In recent years, increased attention has been given to the issue of finding good cost shares for...
Alberto Caprara, Adam N. Letchford
CORR
2010
Springer
143views Education» more  CORR 2010»
13 years 7 months ago
CUR from a Sparse Optimization Viewpoint
The CUR decomposition provides an approximation of a matrix X that has low reconstruction error and that is sparse in the sense that the resulting approximation lies in the span o...
Jacob Bien, Ya Xu, Michael W. Mahoney
ESA
2008
Springer
115views Algorithms» more  ESA 2008»
13 years 11 months ago
A New Approach to Exact Crossing Minimization
The crossing number problem is to find the smallest number of edge crossings necessary when drawing a graph into the plane. Eventhough the problem is NP-hard, we are interested in ...
Markus Chimani, Petra Mutzel, Immanuel M. Bomze
BMCBI
2008
166views more  BMCBI 2008»
13 years 10 months ago
Biclustering via optimal re-ordering of data matrices in systems biology: rigorous methods and comparative studies
Background: The analysis of large-scale data sets via clustering techniques is utilized in a number of applications. Biclustering in particular has emerged as an important problem...
Peter A. DiMaggio Jr., Scott R. McAllister, Christ...