Sciweavers

2635 search results - page 312 / 527
» Algorithms for the Database Layout Problem
Sort
View
ALT
2000
Springer
15 years 10 months ago
Computationally Efficient Transductive Machines
In this paper1 we propose a new algorithm for providing confidence and credibility values for predictions on a multi-class pattern recognition problem which uses Support Vector mac...
Craig Saunders, Alexander Gammerman, Volodya Vovk
IFIP12
2008
15 years 8 months ago
P-Prism: A Computationally Efficient Approach to Scaling up Classification Rule Induction
Top Down Induction of Decision Trees (TDIDT) is the most commonly used method of constructing a model from a dataset in the form of classification rules to classify previously unse...
Frederic T. Stahl, Max A. Bramer, Mo Adda
ALMOB
2006
80views more  ALMOB 2006»
15 years 6 months ago
Effective p-value computations using Finite Markov Chain Imbedding (FMCI): application to local score and to pattern statistics
The technique of Finite Markov Chain Imbedding (FMCI) is a classical approach to complex combinatorial problems related to sequences. In order to get efficient algorithms, it is k...
Grégory Nuel
CORR
2010
Springer
181views Education» more  CORR 2010»
15 years 5 months ago
Mapping XML Data to Relational Data: A DOM-Based Approach
XML has emerged as the standard for representing and exchanging data on the World Wide Web. It is critical to have efficient mechanisms to store and query XML data to exploit the...
Mustafa Atay, Yezhou Sun, Dapeng Liu, Shiyong Lu, ...
PVLDB
2010
96views more  PVLDB 2010»
15 years 5 months ago
Scalable Data Exchange with Functional Dependencies
The recent literature has provided a solid theoretical foundation for the use of schema mappings in data-exchange applications. Following this formalization, new algorithms have b...
Bruno Marnette, Giansalvatore Mecca, Paolo Papotti