Sciweavers

226 search results - page 22 / 46
» Counting Models using Extension Rules
Sort
View
VLDB
2008
ACM
147views Database» more  VLDB 2008»
14 years 8 months ago
Providing k-anonymity in data mining
In this paper we present extended definitions of k-anonymity and use them to prove that a given data mining model does not violate the k-anonymity of the individuals represented in...
Arik Friedman, Ran Wolff, Assaf Schuster
KR
2004
Springer
14 years 1 months ago
Inferential Complexity Control for Model-Based Abduction
We describe a technique for speeding up inference for model-based abduction tasks that trades off inference time and/or space for the fraction of queries correctly answered. We co...
Gregory M. Provan
IIWAS
2008
13 years 9 months ago
Model-driven engineering of composite web services using UML-S
Based on top of Web protocols and XML language, Web services are emerging as a framework to provide applicationto-application interaction. An important challenge is their integrat...
Christophe Dumez, Jaafar Gaber, Maxime Wack
AIPT
1993
13 years 9 months ago
Automating the OSI to Internet Management Conversion Through the Use of an Object-Oriented Platform
OSI provides a powerful object-oriented management model that is infinitely scalable and extensible but is only now beginning to see widespread support. The Internet model has fo...
George Pavlou, Saleem N. Bhatti, Graham Knight
NIPS
1998
13 years 9 months ago
Maximum Conditional Likelihood via Bound Maximization and the CEM Algorithm
We present the CEM (Conditional Expectation Maximization) algorithm as an extension of the EM (Expectation Maximization) algorithm to conditional density estimation under missing ...
Tony Jebara, Alex Pentland