Sciweavers

2635 search results - page 215 / 527
» Algorithms for the Database Layout Problem
Sort
View
ADBIS
1999
Springer
104views Database» more  ADBIS 1999»
15 years 11 months ago
Mining Various Patterns in Sequential Data in an SQL-like Manner
Abstract. One of the most important data mining tasks is discovery of frequently occurring patterns in sequences of events. Many algorithms for finding various patterns in sequenti...
Marek Wojciechowski
SIGMOD
1996
ACM
110views Database» more  SIGMOD 1996»
15 years 10 months ago
Mining Quantitative Association Rules in Large Relational Tables
We introduce the problem of mining association rules in large relational tables containing both quantitative and categorical attributes. An example of such an association might be...
Ramakrishnan Srikant, Rakesh Agrawal
ICDT
2007
ACM
105views Database» more  ICDT 2007»
15 years 10 months ago
Unlocking Keys for XML Trees
Abstract. We review key constraints in the context of XML as introduced by Buneman et al. We show that one of the proposed inference rules is not sound in general, and the axiomati...
Sven Hartmann, Sebastian Link
ICASSP
2011
IEEE
14 years 10 months ago
Rao-Blackwellized particle filter for Gaussian mixture models and application to visual tracking
One of the most important problems in visual tracking is how to incrementally update the appearance model because the appearance of a target object can be easily changed with time...
Jungho Kim, In-So Kweon
MIS
2004
Springer
162views Multimedia» more  MIS 2004»
15 years 12 months ago
Integrating the Results of Multimedia Sub-Queries Using Qualitative Preferences
When similarity queries over multimedia databases are processed by splitting the overall query condition into a set of sub-queries, the problem of how to efficiently and effectiv...
Ilaria Bartolini, Paolo Ciaccia, Vincent Oria, M. ...