Sciweavers

44 search results - page 6 / 9
» A logical account of uncertain databases based on linear log...
Sort
View
CORR
2007
Springer
126views Education» more  CORR 2007»
13 years 7 months ago
Linear Tabling Strategies and Optimizations
Recently there has been a growing interest of research in tabling in the logic programming community because of its usefulness in a variety of application domains including progra...
Neng-Fa Zhou, Taisuke Sato, Yi-Dong Shen
ICASSP
2011
IEEE
12 years 11 months ago
Belief theoretic methods for soft and hard data fusion
In many contexts, one is confronted with the problem of extracting information from large amounts of different types soft data (e.g., text) and hard data (from e.g., physics-based...
Thanuka Wickramarathne, Kamal Premaratne, Manohar ...
FUZZIEEE
2007
IEEE
14 years 1 months ago
Using the OLS Algorithm to Build Interpretable Rule Bases: An Application to a Depollution Problem
— One of the main advantages of fuzzy modeling is the ability to yield interpretable results. Amongst these modeling methods, the OLS algorithm is a mathematically robust techniq...
Sébastien Destercke, Serge Guillaume, Brigi...
ICDT
2010
ACM
219views Database» more  ICDT 2010»
14 years 5 months ago
Aggregate Queries for Discrete and Continuous Probabilistic XML
Sources of data uncertainty and imprecision are numerous. A way to handle this uncertainty is to associate probabilistic annotations to data. Many such probabilistic database mode...
Serge Abiteboul, T.-H Hubert Chan, Evgeny Kharlamo...
ICDE
2004
IEEE
105views Database» more  ICDE 2004»
14 years 9 months ago
SPINE: Putting Backbone into String Indexing
The indexing technique commonly used for long strings, such as genomes, is the suffix tree, which is based on a vertical (intra-path) compaction of the underlying trie structure. ...
Naresh Neelapala, Romil Mittal, Jayant R. Haritsa