Sciweavers

347 search results - page 31 / 70
» Computable Versions of Basic Theorems in Functional Analysis
Sort
View
ICPR
2008
IEEE
15 years 6 months ago
Linear time recognition algorithms for topological invariants in 3D
In this paper, we design linear time algorithms to recognize and determine topological invariants such as genus and homology groups in 3D. These invariants can be used to identify...
Li Chen, Yongwu Rong
ATAL
2005
Springer
15 years 5 months ago
Liberalizing protocols for argumentation in multi-agent systems
This publication summarizes research on the the design and implementation of liberalized version of existing truth-finding protocols for argumentation, such as the standard two-a...
Gerard Vreeswijk
IADIS
2008
15 years 1 months ago
Simulation And Other Facilities To Learn Statistics
For several years, some teachers of the Statistics' Department at the University of Cordoba, with some last course of technical Industrial Engineering in Computer science pup...
José Diz Pérez, Manuel Jurado Bello
IACR
2011
105views more  IACR 2011»
13 years 11 months ago
Leakage Tolerant Interactive Protocols
We put forth a framework for expressing security requirements from interactive protocols in the presence of arbitrary leakage. This allows capturing different levels of leakage to...
Nir Bitansky, Ran Canetti, Shai Halevi
ICCAD
2003
IEEE
140views Hardware» more  ICCAD 2003»
15 years 8 months ago
Block-based Static Timing Analysis with Uncertainty
Static timing analysis is a critical step in design of any digital integrated circuit. Technology and design trends have led to significant increase in environmental and process v...
Anirudh Devgan, Chandramouli V. Kashyap