Sciweavers

4255 search results - page 746 / 851
» On Learning Boolean Functions
Sort
View
PKDD
2009
Springer
147views Data Mining» more  PKDD 2009»
14 years 2 months ago
Kernel Polytope Faces Pursuit
Abstract. Polytope Faces Pursuit (PFP) is a greedy algorithm that approximates the sparse solutions recovered by 1 regularised least-squares (Lasso) [4,10] in a similar vein to (Or...
Tom Diethe, Zakria Hussain
SEMWEB
2009
Springer
14 years 2 months ago
Axiomatic First-Order Probability
Most languages for the Semantic Web have their logical basis in some fragment of first-order logic. Thus, integrating first-order logic with probability is fundamental for represen...
Kathryn B. Laskey
SOUPS
2009
ACM
14 years 2 months ago
Conditioned-safe ceremonies and a user study of an application to web authentication
We introduce the notion of a conditioned-safe ceremony. A “ceremony” is similar to the conventional notion of a protocol, except that a ceremony explicitly includes human part...
Chris Karlof, J. D. Tygar, David Wagner
CDC
2008
IEEE
104views Control Systems» more  CDC 2008»
14 years 2 months ago
A structured multiarmed bandit problem and the greedy policy
—We consider a multiarmed bandit problem where the expected reward of each arm is a linear function of an unknown scalar with a prior distribution. The objective is to choose a s...
Adam J. Mersereau, Paat Rusmevichientong, John N. ...
ETFA
2008
IEEE
14 years 2 months ago
Using neural networks for quality management
We present a method for fine grain QoS control of multimedia applications. This method takes as input an application software composed of actions. The execution times are unknown...
Mohamad Jaber, Jacques Combaz, Loïc Strus, Je...