Sciweavers

943 search results - page 26 / 189
» How should data structures and algorithms be taught
Sort
View
ECAI
2000
Springer
15 years 1 months ago
Learning Efficiently with Neural Networks: A Theoretical Comparison between Structured and Flat Representations
Abstract. We are interested in the relationship between learning efficiency and representation in the case of supervised neural networks for pattern classification trained by conti...
Marco Gori, Paolo Frasconi, Alessandro Sperduti
ICML
2009
IEEE
15 years 10 months ago
Structure learning of Bayesian networks using constraints
This paper addresses exact learning of Bayesian network structure from data and expert's knowledge based on score functions that are decomposable. First, it describes useful ...
Cassio Polpo de Campos, Zhi Zeng, Qiang Ji
SIGMOD
2007
ACM
187views Database» more  SIGMOD 2007»
15 years 9 months ago
P-ring: an efficient and robust P2P range index structure
Data availability, collection and storage have increased dramatically in recent years, raising new technological and algorithmic challenges for database design and data management...
Adina Crainiceanu, Prakash Linga, Ashwin Machanava...
VLDB
2007
ACM
108views Database» more  VLDB 2007»
15 years 10 months ago
Time Series Compressibility and Privacy
In this paper we study the trade-offs between time series compressibility and partial information hiding and their fundamental implications on how we should introduce uncertainty ...
Spiros Papadimitriou, Feifei Li, George Kollios, P...
73
Voted
ECML
2007
Springer
15 years 3 months ago
Learning Directed Probabilistic Logical Models: Ordering-Search Versus Structure-Search
We discuss how to learn non-recursive directed probabilistic logical models from relational data. This problem has been tackled before by upgrading the structure-search algorithm i...
Daan Fierens, Jan Ramon, Maurice Bruynooghe, Hendr...