Sciweavers

9842 search results - page 1608 / 1969
» Problem complexity
Sort
View
163
Voted
FCT
2005
Springer
16 years 10 days ago
Fully Incremental LCS Computation
Sequence comparison is a fundamental task in pattern matching. Its applications include file comparison, spelling correction, information retrieval, and computing (dis)similaritie...
Yusuke Ishida, Shunsuke Inenaga, Ayumi Shinohara, ...
FIMH
2005
Springer
16 years 10 days ago
Fast Spatio-temporal Free-Form Registration of Cardiac MR Image Sequences
Abstract. In this paper we present a novel approach to the problem of spatiotemporal alignment of cardiac MR image sequences. This novel method has the ability to correct spatial m...
Dimitrios Perperidis, Raad Mohiaddin, Daniel Rueck...
GD
2005
Springer
16 years 10 days ago
Fast Node Overlap Removal
Most graph layout algorithms treat nodes as points. The problem of node overlap removal is to adjust the layout generated by such methods so that nodes of non-zero width and height...
Tim Dwyer, Kim Marriott, Peter J. Stuckey
GECCO
2005
Springer
116views Optimization» more  GECCO 2005»
16 years 10 days ago
Measuring, enabling and comparing modularity, regularity and hierarchy in evolutionary design
For computer-automated design systems to scale to complex designs they must be able to produce designs that exhibit the characteristics of modularity, regularity and hierarchy –...
Gregory Hornby
ICANN
2005
Springer
16 years 10 days ago
Accurate and Robust Image Superresolution by Neural Processing of Local Image Representations
Image superresolution involves the processing of an image sequence to generate a still image with higher resolution. Classical approaches, such as bayesian MAP methods, require ite...
Carlos Miravet, Francisco de Borja Rodrígue...
« Prev « First page 1608 / 1969 Last » Next »