Sciweavers

16430 search results - page 210 / 3286
» On Computable Tree Functions
Sort
View
JMLR
2010
129views more  JMLR 2010»
14 years 11 months ago
Learning Polyhedral Classifiers Using Logistic Function
In this paper we propose a new algorithm for learning polyhedral classifiers. In contrast to existing methods for learning polyhedral classifier which solve a constrained optimiza...
Naresh Manwani, P. S. Sastry
CORR
2007
Springer
106views Education» more  CORR 2007»
15 years 4 months ago
Bandit Algorithms for Tree Search
Bandit based methods for tree search have recently gained popularity when applied to huge trees, e.g. in the game of go [6]. Their efficient exploration of the tree enables to ret...
Pierre-Arnaud Coquelin, Rémi Munos
BMCBI
2004
87views more  BMCBI 2004»
15 years 3 months ago
Selection of informative clusters from hierarchical cluster tree with gene classes
Background: A common clustering method in the analysis of gene expression data has been hierarchical clustering. Usually the analysis involves selection of clusters by cutting the...
Petri Törönen
GLOBECOM
2007
IEEE
15 years 10 months ago
A Hash Function Scheme for Key Management in UMTS MBMS
—3GPP 33.246 proposes Key Management Mechanism (KMM) to distribute security keys for Universal Mobile Telecommunications System (UMTS) Multimedia Broadcast and Multicast Service ...
Shin-Ming Cheng, Wei-Ru Lai, Phone Lin
MP
2011
14 years 11 months ago
An FPTAS for minimizing the product of two non-negative linear cost functions
We consider a quadratic programming (QP) problem (Π) of the form min xT Cx subject to Ax ≥ b where C ∈ Rn×n + , rank(C) = 1 and A ∈ Rm×n , b ∈ Rm . We present an FPTAS ...
Vineet Goyal, Latife Genç Kaya, R. Ravi