Sciweavers

2938 search results - page 256 / 588
» On obfuscating point functions
Sort
View
LICS
2007
IEEE
16 years 26 days ago
A computable approach to measure and integration theory
We introduce a computable framework for Lebesgue’s measure and integration theory in the spirit of domain theory. For an effectively given second countable locally compact Hausd...
Abbas Edalat
ICCVW
1999
Springer
15 years 11 months ago
Optimization Criteria, Sensitivity and Robustness of Motion and Structure Estimation
The prevailing efforts to study the standard formulation of motion and structure recovery have been recently focused on issues of sensitivity and and robustness of existing techn...
Jana Kosecka, Yi Ma, Shankar Sastry
CCS
2007
ACM
15 years 10 months ago
Reconfigurable trusted computing in hardware
Trusted Computing (TC) is an emerging technology towards building trustworthy computing platforms. The Trusted Computing Group (TCG) has proposed several specifications to impleme...
Thomas Eisenbarth, Tim Güneysu, Christof Paar...
BMCBI
2007
160views more  BMCBI 2007»
15 years 6 months ago
Convergent algorithms for protein structural alignment
Background: Many algorithms exist for protein structural alignment, based on internal protein coordinates or on explicit superposition of the structures. These methods are usually...
Leandro Martínez, Roberto Andreani, Jos&eac...
CORR
2007
Springer
173views Education» more  CORR 2007»
15 years 6 months ago
Computing modular polynomials in quasi-linear time
We analyse and compare the complexity of several algorithms for computing modular polynomials. We show that an algorithm relying on floating point evaluation of modular functions...
Andreas Enge