2474 search results - page 421 / 495 » Solving Problems on Parallel Computers by Cellular Programmi... |
MFCS
2009
Springer
14 years 1 months ago
2009
Springer
We present a simple algorithm for the maximum spanning star forest problem. We take advantage of the fact that the problem is a special case of complementary set cover and we adapt...
DAGSTUHL
2004
13 years 10 months ago
2004
Complexity is the core problem of contemporary information technology, as the "artificial complicatedness" of its artefacts is exploding. Intellectually easy and economic...
TOG
2008
13 years 8 months ago
2008
We propose a tone-mapping operator that can minimize visible contrast distortions for a range of output devices, ranging from e-paper to HDR displays. The operator weights contras...
CSB
2002
IEEE
14 years 1 months ago
2002
IEEE
There is a pressing need to align growing set of expressed sequence tags (ESTs) to newly sequenced human genome. The problem is, however, complicated by the exon/intron structure ...
VLSM
2005
Springer
14 years 2 months ago
2005
Springer
We present a mathematical and computational feasibility study of the variational convex decomposition of 2D vector fields into coherent structures and additively superposed flow ...