Sciweavers

7129 search results - page 1193 / 1426
» Approximation Algorithms for Treewidth
Sort
View
DATE
2010
IEEE
182views Hardware» more  DATE 2010»
16 years 4 days ago
Fault-based attack of RSA authentication
For any computing system to be secure, both hardware and software have to be trusted. If the hardware layer in a secure system is compromised, not only it would be possible to ext...
Andrea Pellegrini, Valeria Bertacco, Todd M. Austi...
EMO
2009
Springer
140views Optimization» more  EMO 2009»
15 years 11 months ago
On Using Populations of Sets in Multiobjective Optimization
Abstract. Most existing evolutionary approaches to multiobjective optimization aim at finding an appropriate set of compromise solutions, ideally a subset of the Pareto-optimal se...
Johannes Bader, Dimo Brockhoff, Samuel Welten, Eck...
191
Voted
CIKM
1999
Springer
15 years 11 months ago
Requirement-Based Data Cube Schema Design
On-line analytical processing (OLAP) requires e cient processing of complex decision support queries over very large databases. It is well accepted that pre-computed data cubes ca...
David Wai-Lok Cheung, Bo Zhou, Ben Kao, Hongjun Lu...
239
Voted
INFOCOM
1998
IEEE
15 years 11 months ago
Implementing Distributed Packet Fair Queueing in a Scalable Switch Architecture
To support the Internet's explosive growth and expansion into a true integrated services network, there is a need for cost-effective switching technologies that can simultaneo...
Donpaul C. Stephens, Hui Zhang
VISUALIZATION
1998
IEEE
15 years 11 months ago
Eliminating popping artifacts in sheet buffer-based splatting
Splatting is a fast volume rendering algorithm which achieves its speed by projecting voxels in the form of pre-integrated interpolation kernels, or splats. Presently, two main va...
Klaus Mueller, Roger Crawfis
« Prev « First page 1193 / 1426 Last » Next »