Sciweavers

2252 search results - page 209 / 451
» Improving Random Forests
Sort
View
WIOPT
2011
IEEE
14 years 7 months ago
Lower bounds on the success probability for ad hoc networks with local FDMA scheduling
—This paper studies the performance of ad hoc networks with local FDMA scheduling using stochastic point processes. In such networks, the Poisson assumption is not justified due...
Ralph Tanbourgi, Jens P. Elsner, Holger Jäkel...
CVPR
2012
IEEE
13 years 6 months ago
Learning features on robotic surgical tools
Computer-aided surgical interventions in both manual and robotic procedures have been shown to improve patient outcomes and enhance the skills of the human physician. Tool trackin...
Austin Reiter, Peter K. Allen, Tao Zhao
FOCS
2007
IEEE
15 years 10 months ago
Linear Equations Modulo 2 and the L1 Diameter of Convex Bodies
We design a randomized polynomial time algorithm which, given a 3-tensor of real numbers A = {aijk}n i,j,k=1 such that for all i, j, k ∈ {1, . . . , n} we have ai jk = aik j = a...
Subhash Khot, Assaf Naor
RECOMB
2007
Springer
16 years 4 months ago
Minimizing and Learning Energy Functions for Side-Chain Prediction
Abstract. Side-chain prediction is an important subproblem of the general protein folding problem. Despite much progress in side-chain prediction, performance is far from satisfact...
Chen Yanover, Ora Schueler-Furman, Yair Weiss
BMCBI
2007
153views more  BMCBI 2007»
15 years 3 months ago
Lower bounds on multiple sequence alignment using exact 3-way alignment
Background: Multiple sequence alignment is fundamental. Exponential growth in computation time appears to be inevitable when an optimal alignment is required for many sequences. E...
Charles J. Colbourn, Sudhir Kumar