Sciweavers

2635 search results - page 329 / 527
» Algorithms for the Database Layout Problem
Sort
View
OTM
2005
Springer
16 years 11 hour ago
Inferring Complex Semantic Mappings Between Relational Tables and Ontologies from Simple Correspondences
There are many problems requiring a semantic account of a database schema. At its best, such an account consists of mapping formulas between the schema and a formal conceptual mode...
Yuan An, Alexander Borgida, John Mylopoulos
PKDD
2000
Springer
125views Data Mining» more  PKDD 2000»
15 years 10 months ago
Materialized Data Mining Views
Data mining is a useful decision support technique, which can be used to find trends and regularities in warehouses of corporate data. A serious problem of its practical applicatio...
Tadeusz Morzy, Marek Wojciechowski, Maciej Zakrzew...
PLANX
2008
15 years 8 months ago
Complexity of Earliest Query Answering with Streaming Tree Automata
We investigate the complexity of earliest query answering for n-ary node selection queries defined by streaming tree automata (STAs). We elaborate an algorithm that selects query ...
Olivier Gauwin, Anne-Cécile Caron, Joachim ...
AAAI
2000
15 years 7 months ago
Information Extraction with HMM Structures Learned by Stochastic Optimization
Recent research has demonstrated the strong performance of hidden Markov models applied to information extraction--the task of populating database slots with corresponding phrases...
Dayne Freitag, Andrew McCallum
CIKM
2010
Springer
15 years 4 months ago
Anonymizing data with quasi-sensitive attribute values
We study the problem of anonymizing data with quasi-sensitive attributes. Quasi-sensitive attributes are not sensitive by themselves, but certain values or their combinations may ...
Pu Shi, Li Xiong, Benjamin C. M. Fung