Sciweavers

1559 search results - page 304 / 312
» Fundamentals of Generic Programming
Sort
View
COMPGEOM
2010
ACM
15 years 2 months ago
Optimal partition trees
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...
Timothy M. Chan
PRDC
2002
IEEE
15 years 2 months ago
Caveat Emptor: Making Grid Services Dependable from the Client Side
Grid computing relies on fragile partnerships. Clients with hundreds or even thousands of pending service requests must seek out and form temporary alliances with remote servers e...
Miron Livny, Douglas Thain
HPDC
2000
IEEE
15 years 2 months ago
Creating Large Scale Database Servers
The BaBar experiment at the Stanford Linear Accelerator Center (SLAC) is designed to perform a high precision investigation of the decays of the B-meson produced from electron-pos...
Jacek Becla, Andrew Hanushevsky
SP
2010
IEEE
174views Security Privacy» more  SP 2010»
15 years 1 months ago
HyperSafe: A Lightweight Approach to Provide Lifetime Hypervisor Control-Flow Integrity
— Virtualization is being widely adopted in today’s computing systems. Its unique security advantages in isolating and introspecting commodity OSes as virtual machines (VMs) ha...
Zhi Wang, Xuxian Jiang
KBSE
2000
IEEE
15 years 1 months ago
Simultaneous Checking of Completeness and Ground Confluence
c specifications provide a powerful method for the specification of abstract data types in programming languages and software systems. Completeness and ground confluence are fundam...
Adel Bouhoula