Sciweavers

2440 search results - page 260 / 488
» Data-Intensive Question Answering
Sort
View
SIGSOFT
1994
ACM
15 years 9 months ago
Foundations of Software Testing: Dependability Theory
Testing is potentially the best grounded part of software engineering, since it deals with the well defined situation of a fixed program and a test (a finite collection of input v...
Richard G. Hamlet
130
Voted
STACS
1989
Springer
15 years 9 months ago
A Generalization of Automatic Sequences
A sequence is said to be k-automatic if the nth term of this sequence is generated by a finite state machine with n in base k as input. Regular sequences were first defined by ...
Jeffrey Shallit
AINA
2007
IEEE
15 years 9 months ago
Uniformity and Efficiency of a Wireless Sensor Network's Coverage
Abstract-- The primary contribution of this paper is in a wireless sensor network's coverage analysis method, which focuses on both the coverage itself and its uniformity and ...
Md. Ashiqur Rahman, Sajid Hussain
ASSETS
2007
ACM
15 years 9 months ago
SADIe: exposing implicit information to improve accessibility
The World Wide Web (Web) is a visually complex, multimedia system that can be inaccessible to people with visual impairments. SADIe addresses this problem by using Semantic Web te...
Darren Lunn
200
Voted
CRYPTO
2007
Springer
172views Cryptology» more  CRYPTO 2007»
15 years 9 months ago
Deterministic and Efficiently Searchable Encryption
We present as-strong-as-possible definitions of privacy, and constructions achieving them, for public-key encryption schemes where the encryption algorithm is deterministic. We ob...
Mihir Bellare, Alexandra Boldyreva, Adam O'Neill