Sciweavers

160 search results - page 20 / 32
» Definition and Complexity of Some Basic Metareasoning Proble...
Sort
View
CORR
2012
Springer
249views Education» more  CORR 2012»
12 years 3 months ago
Controlling Candidate-Sequential Elections
All previous work on “candidate-control” manipulation of elections has been in the model of full-information, simultaneous voting. This is a problem, since in quite a few real...
Edith Hemaspaandra, Lane A. Hemaspaandra, Jör...
ICALP
2005
Springer
14 years 1 months ago
Probabilistic Polynomial-Time Semantics for a Protocol Security Logic
Abstract. We describe a cryptographically sound formal logic for proving protocol security properties without explicitly reasoning about probability, asymptotic complexity, or the ...
Anupam Datta, Ante Derek, John C. Mitchell, Vitaly...
SERP
2003
13 years 8 months ago
Mappings between Object-Oriented Technology and Architecture-Based Models
In recent publications, two prominent approaches can be found which deal with the complexity of large software systems. First, there is the object–oriented approach, where ”ob...
Peter Tabeling, Bernhard Gröne
AES
2007
Springer
141views Cryptology» more  AES 2007»
13 years 7 months ago
Numerical methods for modelling leaching of pollutants in soils
Pesticides used in crop production and herbicides used for weed control are the major source of nonpoint-source pollutants to groundwater. The movement and degradation of pesticid...
M. Isabel Asensio, B. Ayuso, Luis Ferragut, G. San...
CORR
2010
Springer
221views Education» more  CORR 2010»
13 years 4 months ago
Reduction of Feature Vectors Using Rough Set Theory for Human Face Recognition
In this paper we describe a procedure to reduce the size of the input feature vector. A complex pattern recognition problem like face recognition involves huge dimension of input ...
Debotosh Bhattacharjee, Dipak Kumar Basu, Mita Nas...