Sciweavers

10988 search results - page 283 / 2198
» Algorithmic Folding Complexity
Sort
View
VTC
2007
IEEE
139views Communications» more  VTC 2007»
15 years 10 months ago
A Low Complexity Frequency Domain Iterative Decision-Directed Channel Estimation Technique for Single-Carrier Systems
— A low complexity frequency domain iterative decision-directed channel estimation (FD-IDDCE) technique for single-carrier (SC) systems with frequency domain multiplexed (FDM) pi...
Chan-Tong Lam, David D. Falconer, Florence Danilo-...
DATE
2006
IEEE
88views Hardware» more  DATE 2006»
15 years 10 months ago
Temporal partitioning for image processing based on time-space complexity in reconfigurable architectures
Temporal partitioning techniques are useful to implement large and complex applications, which can be split into partitions in FPGA devices. In order to minimize resources, each o...
Paulo Sérgio B. do Nascimento, Manoel Euseb...
SAC
2006
ACM
15 years 10 months ago
Service-oriented grid computation for large-scale parameter estimation in complex environmental modeling
Complex environmental modeling often involves a large number of unknown physical and ecological parameters. Parameter estimation is one of the most difficult steps in many modelin...
Kejing He, Shoubin Dong, Li Zheng
ISAAC
2005
Springer
98views Algorithms» more  ISAAC 2005»
15 years 9 months ago
Complexity of the Min-Max (Regret) Versions of Cut Problems
This paper investigates the complexity of the min-max and min-max regret versions of the s−t min cut and min cut problems. Even if the underlying problems are closely related and...
Hassene Aissi, Cristina Bazgan, Daniel Vanderpoote...
RT
2001
Springer
15 years 8 months ago
Interactive Sampling and Rendering for Complex and Procedural Geometry
We present a new sampling method for procedural and complex geometries, which allows interactive point-based modeling and rendering of such scenes. For a variety of scenes, object-...
Marc Stamminger, George Drettakis