Sciweavers

1814 search results - page 91 / 363
» Watermarking relational data: framework, algorithms and anal...
Sort
View
ICDE
2001
IEEE
163views Database» more  ICDE 2001»
16 years 17 days ago
MAFIA: A Maximal Frequent Itemset Algorithm for Transactional Databases
We present a new algorithm for mining maximal frequent itemsets from a transactional database. Our algorithm is especially efficient when the itemsets in the database are very lon...
Douglas Burdick, Manuel Calimlim, Johannes Gehrke
ENTCS
2007
121views more  ENTCS 2007»
14 years 11 months ago
Incremental Parametric Development of Greedy Algorithms
The event B method provides a general framework for modelling both data structures and algorithms. B models are validated by discharging proof obligations ensuring safety properti...
Dominique Cansell, Dominique Méry
BIS
2007
92views Business» more  BIS 2007»
15 years 20 days ago
A Framework for Exploring Relationships Between Online Community Characteristics and Regulation Principles
In this paper, we explore a framework for researching relationships between community characteristics and regulation principles. Different regulation principles are supported by d...
E. ten Thij, Justin de Nooijer
ICFCA
2010
Springer
15 years 5 months ago
Describing Role Models in Terms of Formal Concept Analysis
Abstract. In the past years Software Engineering has experienced several difficulties in modularising crosscutting aspects, like shared, dynamic or scattered behavior of object-ori...
Henri Mühle, Christian Wende
CSDA
2010
165views more  CSDA 2010»
14 years 11 months ago
A two-component Weibull mixture to model early and late mortality in a Bayesian framework
A two component parametric mixture is proposed to model survival after an invasive treatment, when patients may experience different hazards regimes: a risk of early mortality dir...
Alessio Farcomeni, Alessandra Nardi