Sciweavers

2229 search results - page 140 / 446
» The Case for Grounding Databases
Sort
View
IVC
2008
141views more  IVC 2008»
15 years 5 months ago
Segmentation of color images via reversible jump MCMC sampling
Reversible jump Markov chain Monte Carlo (RJMCMC) is a recent method which makes it possible to construct reversible Markov chain samplers that jump between parameter subspaces of...
Zoltan Kato
PETRA
2009
ACM
16 years 1 days ago
Towards faster activity search using embedding-based subsequence matching
Event search is the problem of identifying events or activity of interest in a large database storing long sequences of activity. In this paper, our topic is the problem of identi...
Panagiotis Papapetrou, Paul Doliotis, Vassilis Ath...
ICDE
1997
IEEE
101views Database» more  ICDE 1997»
16 years 6 months ago
Selectivity Estimation in the Presence of Alphanumeric Correlations
Query optimization is an integral part of relational database management systems. One important task in query optimization is selectivity estimation, that is, given a query P, we ...
Min Wang, Jeffrey Scott Vitter, Balakrishna R. Iye...
132
Voted
CORR
2002
Springer
135views Education» more  CORR 2002»
15 years 5 months ago
Minimal-Change Integrity Maintenance Using Tuple Deletions
We address the problem of minimal-change integrity maintenance in the context of integrity constraints in relational databases. We assume that integrity-restoration actions are li...
Jan Chomicki, Jerzy Marcinkowski
PODS
2004
ACM
130views Database» more  PODS 2004»
16 years 5 months ago
Computational Complexity of Itemset Frequency Satisfiability
Computing frequent itemsets is one of the most prominent problems in data mining. We introduce a new, related problem, called FREQSAT: given some itemset-interval pairs, does ther...
Toon Calders