Sciweavers

467 search results - page 82 / 94
» The Complexity of Polynomials and Their Coefficient Function...
Sort
View
CIDM
2007
IEEE
15 years 3 months ago
Efficient Kernel-based Learning for Trees
Kernel methods are effective approaches to the modeling of structured objects in learning algorithms. Their major drawback is the typically high computational complexity of kernel ...
Fabio Aiolli, Giovanni Da San Martino, Alessandro ...
IJCAI
2007
15 years 1 months ago
Optimal Soft Arc Consistency
The Valued (VCSP) framework is a generic optimization framework with a wide range of applications. Soft arc consistency operations transform a VCSP into an equivalent problem by s...
Martin C. Cooper, Simon de Givry, Thomas Schiex
APPML
2007
58views more  APPML 2007»
14 years 12 months ago
A class of exactly solvable free-boundary inhomogeneous porous medium flows
We describe a class of inhomogeneous two-dimensional porous medium flows, driven by a finite number of multipole sources; the free boundary dynamics can be parametrized by polyn...
Sam D. Howison, Igor Loutsenko, John R. Ockendon
IJAR
2008
167views more  IJAR 2008»
14 years 11 months ago
Approximate algorithms for credal networks with binary variables
This paper presents a family of algorithms for approximate inference in credal networks (that is, models based on directed acyclic graphs and set-valued probabilities) that contai...
Jaime Shinsuke Ide, Fabio Gagliardi Cozman
JSAC
2006
128views more  JSAC 2006»
14 years 11 months ago
A framework for misuse detection in ad hoc networks- part II
We focus on detecting intrusions in ad hoc networks using the misuse detection technique. We allow for detection modules that periodically stop functioning due to operational failu...
D. Subhadrabandhu, S. Sarkar, F. Anjum