Sciweavers

70 search results - page 4 / 14
» Approximation Reformulations
Sort
View
IJAR
2010
75views more  IJAR 2010»
13 years 9 months ago
Generalized loopy 2U: A new algorithm for approximate inference in credal networks
Credal nets generalize Bayesian nets by relaxing the requirement of precision of probabilities. Credal nets are considerably more expressive than Bayesian nets, but this makes bel...
Alessandro Antonucci, Yi Sun, Cassio P. de Campos,...
ICML
2004
IEEE
14 years 11 months ago
SVM-based generalized multiple-instance learning via approximate box counting
The multiple-instance learning (MIL) model has been very successful in application areas such as drug discovery and content-based imageretrieval. Recently, a generalization of thi...
Qingping Tao, Stephen D. Scott, N. V. Vinodchandra...
ICCAD
2001
IEEE
107views Hardware» more  ICCAD 2001»
14 years 7 months ago
A Convex Programming Approach to Positive Real Rational Approximation
As system integration evolves and tighter design constraints must be met, it becomes necessary to account for the non-ideal behavior of all the elements in a system. Certain devic...
Carlos P. Coelho, Joel R. Phillips, Luis Miguel Si...
ICDE
2012
IEEE
191views Database» more  ICDE 2012»
12 years 1 months ago
Processing and Notifying Range Top-k Subscriptions
— We consider how to support a large number of users over a wide-area network whose interests are characterized by range top-k continuous queries. Given an object update, we need...
Albert Yu, Pankaj K. Agarwal, Jun Yang 0001
MOC
1998
67views more  MOC 1998»
13 years 10 months ago
A negative-norm least squares method for Reissner-Mindlin plates
In this paper a least squares method, using the minus one norm developed by Bramble, Lazarov, and Pasciak, is introduced to approximate the solution of the Reissner-Mindlin plate p...
James H. Bramble, Tong Sun