Sciweavers

674 search results - page 117 / 135
» Telephony in the Year 2005
Sort
View
APPROX
2005
Springer
96views Algorithms» more  APPROX 2005»
14 years 3 months ago
Tolerant Locally Testable Codes
An error-correcting code is said to be locally testable if it has an efficient spot-checking procedure that can distinguish codewords from strings that are far from every codeword...
Venkatesan Guruswami, Atri Rudra
ATAL
2005
Springer
14 years 3 months ago
Protocol synthesis with dialogue structure theory
Inspired by computational linguistic approaches to annotate the structures that occur in human dialogue, this paper describes a technique which encodes these structures as transfo...
Jarred McGinnis, David Robertson, Christopher Walt...
BIRTHDAY
2005
Springer
14 years 3 months ago
Planning in Answer Set Programming using Ordered Task Decomposition
abstract. In this paper we investigate a formalism for solving planning problems based on ordered task decomposition using Answer Set Programming (ASP). Our planning methodology is...
Jürgen Dix, Ugur Kuter, Dana S. Nau
BIRTHDAY
2005
Springer
14 years 3 months ago
Still
Keywords Name of the disease and synonyms Definition/Diagnostic criteria Juvenile form Comments on the differential diagnosis Incidence Clinical description Method of biological d...
Alice ter Meulen
CCS
2005
ACM
14 years 3 months ago
Automated trust negotiation using cryptographic credentials
In automated trust negotiation (ATN), two parties exchange digitally signed credentials that contain attribute information to establish trust and make access control decisions. Be...
Jiangtao Li, Ninghui Li, William H. Winsborough