Sciweavers

2938 search results - page 192 / 588
» On obfuscating point functions
Sort
View
BMCBI
2010
136views more  BMCBI 2010»
15 years 6 months ago
Protein structure analysis of mutations causing inheritable diseases. An e-Science approach with life scientist friendly interfa
Background: Many newly detected point mutations are located in protein-coding regions of the human genome. Knowledge of their effects on the protein's 3D structure provides i...
Hanka Venselaar, Tim A. H. te Beek, Remko K. P. Ku...
CORR
2004
Springer
103views Education» more  CORR 2004»
15 years 6 months ago
Online convex optimization in the bandit setting: gradient descent without a gradient
We study a general online convex optimization problem. We have a convex set S and an unknown sequence of cost functions c1, c2, . . . , and in each period, we choose a feasible po...
Abraham Flaxman, Adam Tauman Kalai, H. Brendan McM...
ICML
2003
IEEE
16 years 7 months ago
Online Convex Programming and Generalized Infinitesimal Gradient Ascent
Convex programming involves a convex set F Rn and a convex cost function c : F R. The goal of convex programming is to find a point in F which minimizes c. In online convex prog...
Martin Zinkevich
3DPVT
2002
IEEE
108views Visualization» more  3DPVT 2002»
15 years 11 months ago
Probabilistic 3D Data Fusion for Adaptive Resolution Surface Generation
In this paper we present an algorithm for adaptive resolution integration of 3D data collected from multiple distributed sensors. The input to the algorithm is a set of 3D surface...
Andrew E. Johnson, Roberto Manduchi
PG
2002
IEEE
15 years 11 months ago
A Physics-Based Framework for Subdivision Surface Design with Automatic Rules Control
The recent non-uniform subdivision approach extends traditional uniform subdivision schemes with variable rules, offering additional shape parameters (such as knot spacings) for f...
Hui Xie, Hong Qin