Sciweavers

1984 search results - page 293 / 397
» The colourful feasibility problem
Sort
View
ICCS
2005
Springer
15 years 11 months ago
Super-Scalable Algorithms for Computing on 100, 000 Processors
In the next five years, the number of processors in high-end systems for scientific computing is expected to rise to tens and even hundreds of thousands. For example, the IBM Blu...
Christian Engelmann, Al Geist
MATA
2005
Springer
146views Communications» more  MATA 2005»
15 years 11 months ago
Distributed Authorization Framework for Mobile Agents
Abstract. Mobile agent systems provide new perspectives for distributed e-commerce applications. These applications may present specific restrictions, making mobile agent systems ...
Guillermo Navarro, Jose A. Ortega-Ruiz, Joan Ametl...
PCM
2005
Springer
288views Multimedia» more  PCM 2005»
15 years 11 months ago
Adaptive Deinterlacing for Real-Time Applications
In general, motion compensated (MC) deinterlacing algorithms can outperform non-MC (NMC) ones. However, we often prefer to choose the latter due to the considerations of error prop...
Qian Huang, Wen Gao, Debin Zhao, Huifang Sun
VLSM
2005
Springer
15 years 11 months ago
A Study of Non-smooth Convex Flow Decomposition
We present a mathematical and computational feasibility study of the variational convex decomposition of 2D vector fields into coherent structures and additively superposed flow ...
Jing Yuan, Christoph Schnörr, Gabriele Steidl...
ASPDAC
2004
ACM
120views Hardware» more  ASPDAC 2004»
15 years 11 months ago
Temporal floorplanning using 3D-subTCG
Improving logic capacity by time-sharing, dynamically reconfigurable FPGAs are employed to handle designs of high complexity and functionality. In this paper, we use a novel topo...
Ping-Hung Yuh, Chia-Lin Yang, Yao-Wen Chang, Hsin-...