Sciweavers

2576 search results - page 175 / 516
» The Complexity of Zero Knowledge
Sort
View
171
Voted
IJCAI
1993
15 years 7 months ago
A Computational Model of Tractable Reasoning - Taking Inspiration from Cognition
Polynomial time complexity is the usual ‘threshold’ for distinguishing the tractable from the intractable and it may seem reasonable to adopt this notion of tractability in th...
Lokendra Shastri
151
Voted
AIPS
2009
15 years 7 months ago
Extended Goals for Composing Services
The ability to automatically compose Web Services is critical for realising more complex functionalities. Several proposals to use automated planning to deal with the problem of s...
Eirini Kaldeli, Alexander Lazovik, Marco Aiello
CORR
2007
Springer
114views Education» more  CORR 2007»
15 years 6 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...
177
Voted
NPL
2002
151views more  NPL 2002»
15 years 5 months ago
Additive Composition of Supervised Self Organizing Maps
The learning of complex relationships can be decomposed into several neural networks. The modular organization is determined by prior knowledge of the problem that permits to split...
Jean-Luc Buessler, Jean-Philippe Urban, Julien Gre...
162
Voted
VLDB
2002
ACM
161views Database» more  VLDB 2002»
15 years 5 months ago
BANKS: Browsing and Keyword Searching in Relational Databases
The BANKS system enables keyword-based search on databases, together with data and schema browsing. BANKS enables users to extract information in a simple manner without any knowl...
B. Aditya, Gaurav Bhalotia, Soumen Chakrabarti, Ar...