Sciweavers

6306 search results - page 313 / 1262
» Space, Time, and the Use of Language
Sort
View
CCS
1998
ACM
15 years 11 months ago
A Probabilistic Poly-Time Framework for Protocol Analysis
We develop a framework for analyzing security protocols in which protocol adversaries may be arbitrary probabilistic polynomial-time processes. In this framework, protocols are wr...
Patrick Lincoln, John C. Mitchell, Mark Mitchell, ...
CLEIEJ
2006
96views more  CLEIEJ 2006»
15 years 7 months ago
A Single-Version Algorithmic Approach to Fault Tolerant Computing Using Static Redundancy
This paper describes a single-version algorithmic approach to design in fault tolerant computing in various computing systems by using static redundancy in order to mask transient...
Goutam Kumar Saha
DASFAA
2007
IEEE
143views Database» more  DASFAA 2007»
16 years 1 months ago
Using Redundant Bit Vectors for Near-Duplicate Image Detection
Images are amongst the most widely proliferated form of digital information due to affordable imaging technologies and the Web. In such an environment, the use of digital watermar...
Jun Jie Foo, Ranjan Sinha
LCTRTS
2000
Springer
15 years 11 months ago
Approximation of Worst-Case Execution Time for Preemptive Multitasking Systems
The control system of many complex mechatronic products requires for each task the Worst Case Execution Time (WCET), which is needed for the scheduler's admission tests and su...
Matteo Corti, Roberto Brega, Thomas R. Gross
SIGMOD
2010
ACM
324views Database» more  SIGMOD 2010»
16 years 8 days ago
Similarity search and locality sensitive hashing using ternary content addressable memories
Similarity search methods are widely used as kernels in various data mining and machine learning applications including those in computational biology, web search/clustering. Near...
Rajendra Shinde, Ashish Goel, Pankaj Gupta, Debojy...