Sciweavers

1787 search results - page 126 / 358
» classification 2006
Sort
View
130
Voted
COMBINATORICS
2000
120views more  COMBINATORICS 2000»
15 years 4 months ago
The Characteristic Polynomial of a Graph is Reconstructible from the Characteristic Polynomials of its Vertex-Deleted Subgraphs
The question of whether the characteristic polynomial of a simple graph is uniquely determined by the characteristic polynomials of its vertex-deleted subgraphs is one of the many...
Elias M. Hagos
130
Voted
ORL
2010
93views more  ORL 2010»
15 years 2 months ago
Internal vs. external risk measures: How capital requirements differ in practice
: We compare capital requirements derived by tail conditional expectation (TCE) with those derived by tail conditional median (TCM) and find that there is no clear-cut relationship...
Martin Eling, Luisa Tibiletti
COMBINATORICS
2000
91views more  COMBINATORICS 2000»
15 years 4 months ago
A Construction Method for Complete Sets of Mutually Orthogonal Frequency Squares
A construction is described for combining affine designs with complete sets of mutually orthogonal frequency squares to produce other complete sets. Key words: Matrices, orthogona...
Vassili C. Mavron
FLAIRS
2006
15 years 5 months ago
Machine Learning for Imbalanced Datasets: Application in Medical Diagnostic
In this paper, we present a new rule induction algorithm for machine learning in medical diagnosis. Medical datasets, as many other real-world datasets, exhibit an imbalanced clas...
Luis Mena, Jesus A. Gonzalez
STOC
2006
ACM
125views Algorithms» more  STOC 2006»
16 years 4 months ago
On earthmover distance, metric labeling, and 0-extension
We study the fundamental classification problems 0-Extension and Metric Labeling. A generalization of Multiway Cut, 0-Extension is closely related to partitioning problems in grap...
Howard J. Karloff, Subhash Khot, Aranyak Mehta, Yu...