Sciweavers

16430 search results - page 438 / 3286
» On Computable Tree Functions
Sort
View
174
Voted
ICML
2008
IEEE
16 years 7 months ago
Efficiently solving convex relaxations for MAP estimation
The problem of obtaining the maximum a posteriori (map) estimate of a discrete random field is of fundamental importance in many areas of Computer Science. In this work, we build ...
M. Pawan Kumar, Philip H. S. Torr
189
Voted
ICML
2005
IEEE
16 years 7 months ago
Discriminative versus generative parameter and structure learning of Bayesian network classifiers
In this paper, we compare both discriminative and generative parameter learning on both discriminatively and generatively structured Bayesian network classifiers. We use either ma...
Franz Pernkopf, Jeff A. Bilmes
ICDE
2010
IEEE
260views Database» more  ICDE 2010»
16 years 6 months ago
Anonymizing Weighted Social Network Graphs
The increasing popularity of social networks has initiated a fertile research area in information extraction and data mining. Although such analysis can facilitate better understan...
Sudipto Das, Ömer Egecioglu, Amr El Abbadi
184
Voted
LATA
2009
Springer
16 years 1 months ago
Termination of Priority Rewriting
Introducing priorities on rules in rewriting increases their expressive power and helps to limit computations. Priority rewriting is used in rule-based programming as well as in f...
Isabelle Gnaedig
EDOC
2008
IEEE
16 years 1 months ago
Managing the Life Cycle of Access Rules in CEOSIS
The definition and management of access rules (e.g., to control the access to business documents and business functions) is an important task within any enterprise information sy...
Stefanie Rinderle-Ma, Manfred Reichert