Sciweavers

3891 search results - page 709 / 779
» Query Models
Sort
View
CIE
2006
Springer
14 years 1 months ago
Lower Bounds Using Kolmogorov Complexity
Abstract. In this paper, we survey a few recent applications of Kolmogorov complexity to lower bounds in several models of computation. We consider KI complexity of Boolean functio...
Sophie Laplante
DEXA
2000
Springer
165views Database» more  DEXA 2000»
14 years 1 months ago
DIMS: Implementation of a Federated Information Management System for PRODNET II
The Esprit project PRODNET II1 (Production Planning and Management in an Extended Enterprise) had as its main objective the development of a reference architecture and a support in...
César Garita, Yasemin Ugur, Anne Frenkel, H...
GIS
1995
ACM
14 years 1 months ago
Collaborative Spatial Decision Making with Qualitative Constraints
: Usually spatial planning problems involve a large number of decision makers with different backgrounds and interests. The process of Collaborative Spatial Decision Making (CSDM)...
Nikos I. Karacapilidis, Dimitris Papadias, Max J. ...
NIL
1991
14 years 1 months ago
Deduction with Supernormal Defaults
In this paper we consider supernormal defaults [Poo88] with a strict partial order defining their priorities [Bre91]. We investigate their relation to minimal or preferential ent...
Stefan Brass
FSE
2010
Springer
146views Cryptology» more  FSE 2010»
14 years 1 months ago
A Unified Method for Improving PRF Bounds for a Class of Blockcipher Based MACs
This paper provides a unified framework for improving PRF (pseudorandom function) advantages of several popular MACs (message authentication codes) based on a blockcipher modeled a...
Mridul Nandi