Sciweavers

588 search results - page 67 / 118
» Reducibility and Completeness in Private Computations
Sort
View
DSN
2006
IEEE
14 years 4 months ago
Evaluating the Performability of Systems with Background Jobs
As most computer systems are expected to remain operational 24 hours a day, 7 days a week, they must complete maintenance work while in operation. This work is in addition to the ...
Qi Zhang, Ningfang Mi, Evgenia Smirni, Alma Riska,...
IPPS
2003
IEEE
14 years 3 months ago
Optimizing Synchronization Operations for Remote Memory Communication Systems
Synchronization operations, such as fence and locking, are used in many parallel operations accessing shared memory. However, a process which is blocked waiting for a fence operat...
Darius Buntinas, Amina Saify, Dhabaleswar K. Panda...
FCCM
2002
IEEE
133views VLSI» more  FCCM 2002»
14 years 2 months ago
Reconfigurable Shape-Adaptive Template Matching Architectures
This paper presents three reconfigurable computing approaches for a Shape-Adaptive Template Matching (SA-TM) method to retrieve arbitrarily shaped objects within images or video f...
Jörn Gause, Peter Y. K. Cheung, Wayne Luk
GIS
2008
ACM
13 years 11 months ago
Sparse terrain pyramids
Bintrees based on longest edge bisection and hierarchies of diamonds are popular multiresolution techniques on regularly sampled terrain datasets. In this work, we consider sparse...
Kenneth Weiss, Leila De Floriani
ENTCS
2008
102views more  ENTCS 2008»
13 years 10 months ago
Soft Linear Logic and Polynomial Complexity Classes
We describe some results inspired to Lafont's Soft Linear Logic (SLL) which is a subsystem of second-order linear logic with restricted rules for exponentials, correct and co...
Marco Gaboardi, Jean-Yves Marion, Simona Ronchi De...