Sciweavers

4908 search results - page 261 / 982
» On the Complexity of Optimal K-Anonymity
Sort
View
EGH
2005
Springer
16 years 5 days ago
Optimal automatic multi-pass shader partitioning by dynamic programming
Complex shaders must be partitioned into multiple passes to execute on GPUs with limited hardware resources. Automatic partitioning gives rise to an NP-hard scheduling problem tha...
Alan Heirich
IEAAIE
2005
Springer
16 years 5 days ago
Predicting Construction Litigation Outcome Using Particle Swarm Optimization
Construction claims are normally affected by a large number of complex and interrelated factors. It is highly desirable for the parties to a dispute to know with some certainty how...
Kwok-wing Chau
LCPC
2004
Springer
16 years 13 hour ago
Branch Strategies to Optimize Decision Trees for Wide-Issue Architectures
Abstract. Branch predictors are associated with critical design issues for nowadays instruction greedy processors. We study two important domains where the optimization of decision...
Patrick Carribault, Christophe Lemuet, Jean-Thomas...
191
Voted
ISCAS
2002
IEEE
163views Hardware» more  ISCAS 2002»
15 years 11 months ago
A two-pass optimal motion-threading technique for 3D wavelet video coding
Motion-threading is a novel technique that can efficiently incorporate motion information into the 3D wavelet video coding. By utilizing shape adaptive wavelet transform along wit...
Lin Luo, Feng Wu, Shipeng Li, Zhenquan Zhuang, Ya-...
EDBT
2009
ACM
112views Database» more  EDBT 2009»
15 years 11 months ago
GCIP: exploiting the generation and optimization of integration processes
As a result of the changing scope of data management towards the management of highly distributed systems and applications, integration processes have gained in imporuch integrati...
Matthias Böhm, Uwe Wloka, Dirk Habich, Wolfga...