Sciweavers

993 search results - page 23 / 199
» The Complexity of Probabilistic EL
Sort
View
COLING
1990
13 years 8 months ago
A Formal Description of Arabic Syntax in Definite Clause Grammar
Arabic has some special syntax features which lead to complex syntax structures. We have developed a formal description of Arabic syntax in Definite Clause Grammar. This grarnrnar...
Hisham El-Shishiny
CORR
2007
Springer
114views Education» more  CORR 2007»
13 years 7 months ago
Self-organizing maps and symbolic data
Abstract. In data analysis new forms of complex data have to be considered like for example (symbolic data, functional data, web data, trees, SQL query and multimedia data,. . . )....
Aïcha El Golli, Brieuc Conan-Guez, Fabrice Ro...
COCO
2001
Springer
107views Algorithms» more  COCO 2001»
14 years 6 days ago
In Search of an Easy Witness: Exponential Time vs. Probabilistic Polynomial Time
Restricting the search space {0, 1}n to the set of truth tables of “easy” Boolean functions on log n variables, as well as using some known hardness-randomness tradeoffs, we ...
Russell Impagliazzo, Valentine Kabanets, Avi Wigde...
ICDE
2007
IEEE
137views Database» more  ICDE 2007»
14 years 9 months ago
ProVeR: Probabilistic Video Retrieval using the Gauss-Tree
Modeling objects by probability density functions (pdf) is a new powerful method to represent complex objects in databases. By representing an object as a pdf, e.g. a Gaussian, it...
Alexey Pryakhin, Christian Böhm, Matthias Sch...
UAI
1998
13 years 9 months ago
Learning the Structure of Dynamic Probabilistic Networks
Dynamic probabilistic networks are a compact representation of complex stochastic processes. In this paper we examine how to learn the structure of a DPN from data. We extend stru...
Nir Friedman, Kevin P. Murphy, Stuart J. Russell