Sciweavers

903 search results - page 32 / 181
» On the reduction of a random basis
Sort
View
BMCBI
2006
165views more  BMCBI 2006»
15 years 2 months ago
Improved variance estimation of classification performance via reduction of bias caused by small sample size
Background: Supervised learning for classification of cancer employs a set of design examples to learn how to discriminate between tumors. In practice it is crucial to confirm tha...
Ulrika Wickenberg-Bolin, Hanna Göransson, M&a...
JSC
2007
71views more  JSC 2007»
15 years 1 months ago
Rational invariants of a group action. Construction and rewriting
Geometric constructions applied to a rational action of an algebraic group lead to a new algorithm for computing rational invariants. A finite generating set of invariants appear...
Evelyne Hubert, Irina A. Kogan
DCG
2007
94views more  DCG 2007»
15 years 1 months ago
Banach-Mazur Distances and Projections on Random Subgaussian Polytopes
We consider polytopes in Rn that are generated by N vectors in Rn whose coordinates are independent subgaussian random variables. (A particular case of such polytopes are symmetri...
Rafal Latala, Piotr Mankiewicz, Krzysztof Oleszkie...
ISSTA
2007
ACM
15 years 3 months ago
Experimental assessment of random testing for object-oriented software
Progress in testing requires that we evaluate the effectiveness of testing strategies on the basis of hard experimental evidence, not just intuition or a priori arguments. Random ...
Ilinca Ciupa, Andreas Leitner, Manuel Oriol, Bertr...
SODA
2004
ACM
144views Algorithms» more  SODA 2004»
15 years 3 months ago
Covering minimum spanning trees of random subgraphs
We consider the problem of finding a sparse set of edges containing the minimum spanning tree (MST) of a random subgraph of G with high probability. The two random models that we ...
Michel X. Goemans, Jan Vondrák