Sciweavers

588 search results - page 63 / 118
» Reducibility and Completeness in Private Computations
Sort
View
102
Voted
IPPS
2009
IEEE
15 years 7 months ago
Minimizing startup costs for performance-critical threading
—Using the well-known ATLAS and LAPACK dense linear algebra libraries, we demonstrate that the parallel management overhead (PMO) can grow with problem size on even statically sc...
Anthony M. Castaldo, R. Clint Whaley
112
Voted
JGTOOLS
2008
189views more  JGTOOLS 2008»
15 years 18 days ago
Subtractive Shadows: A Flexible Framework for Shadow Level of Detail
Abstract. We explore the implications of reversing the process of shadow computation for real-time applications that model complex reflectance and lighting (such as that specified ...
Christopher DeCoro, Szymon Rusinkiewicz
100
Voted
DAC
2000
ACM
16 years 1 months ago
Code compression for low power embedded system design
erse approaches at all levels of abstraction starting from the physical level up to the system level. Experience shows that a highlevel method may have a larger impact since the de...
Haris Lekatsas, Jörg Henkel, Wayne Wolf
101
Voted
TIP
2002
114views more  TIP 2002»
15 years 8 days ago
New architecture for dynamic frame-skipping transcoder
Abstract--Transcoding is a key technique for reducing the bitrate of a previously compressed video signal. A high transcoding ratio may result in an unacceptable picture quality wh...
Kai-Tat Fung, Yui-Lam Chan, Wan-Chi Siu
120
Voted
BTW
2007
Springer
136views Database» more  BTW 2007»
15 years 6 months ago
System P: Completeness-driven Query Answering in Peer Data Management Systems
Abstract: Peer data management systems (PDMS) are a highly dynamic, decentralized infrastructure for large-scale data integration. They consist of a dynamic set of autonomous peers...
Armin Roth, Felix Naumann