Sciweavers

522 search results - page 5 / 105
» Necessary but Not Sufficient
Sort
View
MSS
2008
IEEE
88views Hardware» more  MSS 2008»
13 years 7 months ago
Maximizing an interval order on compact subsets of its domain
Maximal elements of a binary relation on compact subsets of a metric space define a choice function. An infinite extension of transitivity is necessary and sufficient for such a c...
Nikolai S. Kukushkin
CIARP
2006
Springer
13 years 11 months ago
A Theoretical Comparison of Two Linear Dimensionality Reduction Techniques
Abstract. A theoretical analysis for comparing two linear dimensionality reduction (LDR) techniques, namely Fisher's discriminant (FD) and Loog-Duin (LD) dimensionality reduci...
Luis Rueda, Myriam Herrera
APPML
2010
91views more  APPML 2010»
13 years 7 months ago
Certificates of convexity for basic semi-algebraic sets
We provide two certificates of convexity for arbitrary basic closed semi-algebraic sets of Rn. The first one is based on a necessary and sufficient condition whereas the second one...
Jean B. Lasserre
DAM
2008
72views more  DAM 2008»
13 years 7 months ago
On the existence of maximal elements: An impossibility theorem
All sufficient (as well as necessary) conditions for a binary relation on a metric space to admit a maximal element on every nonempty compact subset of its domain that have been f...
Nikolai S. Kukushkin
JGT
2008
58views more  JGT 2008»
13 years 7 months ago
Some remarks about factors of graphs
: A (g, f )-factor of a graph is a subset F of E such that for all v V, g(v) degF(v) f(v). Lovasz gave a necessary and sufficient condition for the existence of a (g, f )-factor...
José R. Correa, Martín Matamala