Sciweavers

7228 search results - page 649 / 1446
» From Algorithmic to Subjective Randomness
Sort
View
CORR
2010
Springer
111views Education» more  CORR 2010»
15 years 7 months ago
Submodular Maximization by Simulated Annealing
We consider the problem of maximizing a nonnegative (possibly non-monotone) submodular set function with or without constraints. Feige et al. [9] showed a 2/5-approximation for th...
Shayan Oveis Gharan, Jan Vondrák
CORR
2008
Springer
97views Education» more  CORR 2008»
15 years 7 months ago
Lower bounds for adaptive linearity tests
Linearity tests are randomized algorithms which have oracle access to the truth table of some function f, and are supposed to distinguish between linear functions and functions whi...
Shachar Lovett
CSDA
2008
128views more  CSDA 2008»
15 years 7 months ago
Classification tree analysis using TARGET
Tree models are valuable tools for predictive modeling and data mining. Traditional tree-growing methodologies such as CART are known to suffer from problems including greediness,...
J. Brian Gray, Guangzhe Fan
BMCBI
2007
141views more  BMCBI 2007»
15 years 7 months ago
Artificial neural network models for prediction of intestinal permeability of oligopeptides
Background: Oral delivery is a highly desirable property for candidate drugs under development. Computational modeling could provide a quick and inexpensive way to assess the inte...
Eunkyoung Jung, Junhyoung Kim, Minkyoung Kim, Dong...
CORR
2010
Springer
111views Education» more  CORR 2010»
15 years 4 months ago
Calibration for Ultrasound Breast Tomography Using Matrix Completion
We study the calibration problem in circular ultrasound tomography devices for breast imaging, where the sensor positions deviate from the circumference of a perfect circle. We in...
Reza Parhizkar, Amin Karbasi, Sewoong Oh, Martin V...