Sciweavers

1964 search results - page 111 / 393
» Partitioning Based Algorithms for Some Colouring Problems
Sort
View
ICIP
2009
IEEE
14 years 9 months ago
Monotone Operator Splitting For Optimization Problems In Sparse Recovery
This work focuses on several optimization problems involved in recovery of sparse solutions of linear inverse problems. Such problems appear in many fields including image and sig...
DAC
1999
ACM
14 years 9 months ago
Graph Coloring Algorithms for Fast Evaluation of Curtis Decompositions
Finding the minimum column multiplicity for a bound set of variables is an important problem in Curtis decomposition. To investigate this problem, we compared two graphcoloring pr...
Marek A. Perkowski, Rahul Malvi, Stan Grygiel, Mic...
HPCN
1995
Springer
13 years 11 months ago
Discrete optimisation and real-world problems
In the global economy, proper organisation and planning of production and storage locations, transportation and scheduling are vital to retain the competitive edge of companies. Th...
Josef Kallrath, Anna Schreieck
ISBRA
2007
Springer
14 years 2 months ago
GFBA: A Biclustering Algorithm for Discovering Value-Coherent Biclusters
Clustering has been one of the most popular approaches used in gene expression data analysis. A clustering method is typically used to partition genes according to their similarity...
Xubo Fei, Shiyong Lu, Horia F. Pop, Lily R. Liang
MINENET
2006
ACM
14 years 1 months ago
Mining web logs to debug distant connectivity problems
Content providers base their business on their ability to receive and answer requests from clients distributed across the Internet. Since disruptions in the flow of these request...
Emre Kiciman, David A. Maltz, Moisés Goldsz...