Sciweavers

8728 search results - page 1465 / 1746
» On Reduct Construction Algorithms
Sort
View
CORR
2008
Springer
97views Education» more  CORR 2008»
15 years 6 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 6 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
158
Voted
EOR
2008
106views more  EOR 2008»
15 years 6 months ago
Convergent Lagrangian heuristics for nonlinear minimum cost network flows
We consider the separable nonlinear and strictly convex single-commodity network flow problem (SSCNFP). We develop a computational scheme for generating a primal feasible solution...
Torbjörn Larsson, Johan Marklund, Caroline Ol...
BMCBI
2006
150views more  BMCBI 2006»
15 years 6 months ago
Protein structure similarity from principle component correlation analysis
Background: Owing to rapid expansion of protein structure databases in recent years, methods of structure comparison are becoming increasingly effective and important in revealing...
Xiaobo Zhou, James Chou, Stephen T. C. Wong
ECCC
2006
134views more  ECCC 2006»
15 years 6 months ago
Derandomizing the AW matrix-valued Chernoff bound using pessimistic estimators and applications
Ahlswede and Winter [AW02] introduced a Chernoff bound for matrix-valued random variables, which is a non-trivial generalization of the usual Chernoff bound for real-valued random...
Avi Wigderson, David Xiao
« Prev « First page 1465 / 1746 Last » Next »