Sciweavers

1529 search results - page 108 / 306
» A slant removal algorithm
Sort
View
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...
ICIAR
2004
Springer
14 years 3 months ago
Robust Dichromatic Colour Constancy
Abstract. A novel colour constancy algorithm that utilises both physical and statistical knowledge is introduced. A physics-based model of image formation is combined with a statis...
Gerald Schaefer
COMPGEOM
2003
ACM
14 years 3 months ago
Incremental constructions con BRIO
Randomized incremental constructions are widely used in computational geometry, but they perform very badly on large data because of their inherently random memory access patterns...
Nina Amenta, Sunghee Choi, Günter Rote
GECCO
2007
Springer
166views Optimization» more  GECCO 2007»
14 years 2 months ago
Understanding particle swarms through simplification: a study of recombinant PSO
Simplified forms of the particle swarm algorithm are very beneficial in contributing to understanding of what makes a PSO swarm function in the way that it does. One of these form...
Daniel Bratton, Tim Blackwell
ICC
2007
IEEE
185views Communications» more  ICC 2007»
14 years 2 months ago
Systematic Modification of Parity-Check Matrices for Efficient Encoding of LDPC Codes
An algorithm for efficient encoding of LDPC codes is presented that does not impose any restrictions on the construction of the parity-check matrices. The algorithm modifies the pa...
Mohamed Shaqfeh, Norbert Görtz