16666 search results - page 364 / 3334 » Descriptive and Computational Complexity |
178
click to vote
IWPEC
2009
Springer
16 years 1 months ago
2009
Springer
We study the parameterized complexity of two families of problems: the bounded length disjoint paths problem and the bounded length cut problem. From Menger’s theorem both proble...
180
click to vote
ICMCS
2005
IEEE
16 years 11 days ago
2005
IEEE
Owing to the great computation complexity of the ME (motion estimation) in video coding, a lot of fast ME algorithms have been proposed in literature. Most of them are designed ba...
154
click to vote
IUI
2004
ACM
16 years 6 days ago
2004
ACM
Complex systems abound in nature and are becoming increasingly important in artificial systems. The understanding and controlling of such systems is a major challenge. This paper ...
193
click to vote
RT
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. Many disciplines must handle the creation, visualization, and manipulation of huge and complex 3D environments. Examples include large structural and mechanical engineeri...
197
click to vote
WSCG
2004
15 years 8 months ago
2004
In many computer graphics and computer-aided design problems, it is very common to find a smooth and well structured surface to fit a set of unstructured 3-dimensional data. Altho...