Sciweavers

1389 search results - page 76 / 278
» Lightweight dependent classes
Sort
View
CORR
2010
Springer
146views Education» more  CORR 2010»
13 years 6 months ago
NLHB : A Non-Linear Hopper Blum Protocol
The Hopper-Blum (HB) protocol, which uses noised linear parities of a shared key for authentication, has been proposed for light-weight applications such as RFID. Recently, algorit...
Mukundan Madhavan, Andrew Thangaraj, Yogesh Sankar...
SCIA
2009
Springer
125views Image Analysis» more  SCIA 2009»
14 years 4 months ago
Recognition of Protruding Objects in Highly Structured Surroundings by Structural Inference
Recognition of objects in highly structured surroundings is a challenging task, because the appearance of target objects changes due to fluctuations in their surroundings. This ma...
Vincent Frans van Ravesteijn, Frans M. Vos, Lucas ...
KR
2010
Springer
14 years 2 months ago
Walking the Decidability Line for Rules with Existential Variables
We consider positive rules in which the conclusion may contain existentially quantified variables, which makes reasoning tasks (such as Deduction) undecidable. These rules have t...
Jean-François Baget, Michel LeClere, Marie-...
ALT
1999
Springer
14 years 1 months ago
Extended Stochastic Complexity and Minimax Relative Loss Analysis
We are concerned with the problem of sequential prediction using a givenhypothesis class of continuously-manyprediction strategies. An e ectiveperformance measure is the minimax re...
Kenji Yamanishi
CORR
2010
Springer
109views Education» more  CORR 2010»
13 years 9 months ago
Hybrid tractability of soft constraint problems
The constraint satisfaction problem (CSP) is a central generic problem in artificial intelligence. Considerable effort has been made in identifying properties which ensure tractabi...
Martin C. Cooper, Stanislav Zivný