Sciweavers

7106 search results - page 1211 / 1422
» Restricted Complexity, General Complexity
Sort
View
131
Voted
SODA
2003
ACM
114views Algorithms» more  SODA 2003»
15 years 6 months ago
Lower bounds for collusion-secure fingerprinting
Collusion-secure fingerprinting codes are an important primitive used by many digital watermarking schemes [1, 10, 9]. Boneh and Shaw [3] define a model for these types of codes...
Chris Peikert, Abhi Shelat, Adam Smith
138
Voted
ACL
1997
15 years 6 months ago
Co-evolution of Language and of the Language Acquisition Device
A new account of parameter setting during grammatical acquisition is presented in terms of Generalized Categorial Grammar embedded in a default inheritance hierarchy, providing a ...
Ted Briscoe
WSC
2000
15 years 6 months ago
Model abstraction for discrete event systems using neural networks and sensitivity information
STRACTION FOR DISCRETE EVENT SYSTEMS USING NEURAL NETWORKS AND SENSITIVITY INFORMATION Christos G. Panayiotou Christos G. Cassandras Department of Manufacturing Engineering Boston ...
Christos G. Panayiotou, Christos G. Cassandras, We...
UAI
1997
15 years 6 months ago
A Scheme for Approximating Probabilistic Inference
This paper describes a class ofprobabilistic approximation algorithms based on bucket elimination which o er adjustable levels of accuracy ande ciency. We analyzethe approximation...
Rina Dechter, Irina Rish
AAAI
1993
15 years 6 months ago
On the Adequateness of the Connection Method
Roughly speaking, adequatness is the property of a theorem proving method to solve simpler problems faster than more difficult ones. Automated inferencing methods are often not ad...
Antje Beringer, Steffen Hölldobler
« Prev « First page 1211 / 1422 Last » Next »