Sciweavers

1068 search results - page 191 / 214
» Factorization as a Rank 1 Problem
Sort
View
70
Voted
ICONIP
2007
14 years 11 months ago
Using Generalization Error Bounds to Train the Set Covering Machine
In this paper we eliminate the need for parameter estimation associated with the set covering machine (SCM) by directly minimizing generalization error bounds. Firstly, we consider...
Zakria Hussain, John Shawe-Taylor
ISSA
2004
14 years 11 months ago
Are Current B2b Security Standards Antithetical To Global Interoperability?
This paper argues that powerful impetus exists for the realisation of a global multilateral electronic market infrastructure, as envisaged by the ebXML1 endeavour. Crucial in this...
Maree Pather
BMCBI
2007
158views more  BMCBI 2007»
14 years 9 months ago
Penalized likelihood for sparse contingency tables with an application to full-length cDNA libraries
Background: The joint analysis of several categorical variables is a common task in many areas of biology, and is becoming central to systems biology investigations whose goal is ...
Corinne Dahinden, Giovanni Parmigiani, Mark C. Eme...
CORR
2008
Springer
121views Education» more  CORR 2008»
14 years 9 months ago
The Forgiving Tree: A Self-Healing Distributed Data Structure
We consider the problem of self-healing in peer-to-peer networks that are under repeated attack by an omniscient adversary. We assume that the following process continues for up t...
Tom Hayes, Navin Rustagi, Jared Saia, Amitabh Treh...
CORR
2006
Springer
113views Education» more  CORR 2006»
14 years 9 months ago
A Unified View of TD Algorithms; Introducing Full-Gradient TD and Equi-Gradient Descent TD
This paper addresses the issue of policy evaluation in Markov Decision Processes, using linear function approximation. It provides a unified view of algorithms such as TD(), LSTD()...
Manuel Loth, Philippe Preux