Sciweavers

1419 search results - page 72 / 284
» A Characterization of Constructive Dimension
Sort
View
FSS
2008
82views more  FSS 2008»
15 years 4 months ago
Lattice-valued convergence spaces and regularity
: We define a regularity axiom for lattice-valued convergence spaces where the lattice is a complete Heyting algebra. To this end, we generalize the characterization of regularity ...
Gunther Jäger
115
Voted
COMBINATORICS
2006
112views more  COMBINATORICS 2006»
15 years 4 months ago
More Forbidden Minors for Wye-Delta-Wye Reducibility
A graph is Y Y reducible if it can be reduced to isolated vertices by a sequence of series-parallel reductions and Y Y transformations. It is still an open problem to characterize...
Yaming Yu
JGT
2010
84views more  JGT 2010»
15 years 2 months ago
Large classes of infinite k-cop-win graphs
While finite cop-win finite graphs possess a good structural characterization, none is known for infinite cop-win graphs. As evidence that such a characterization might not exis...
Anthony Bonato, Gena Hahn, Claude Tardif
141
Voted
JMLR
2010
139views more  JMLR 2010»
14 years 11 months ago
On the Foundations of Noise-free Selective Classification
We consider selective classification, a term we adopt here to refer to `classification with a reject option.' The essence in selective classification is to trade-off classifi...
Ran El-Yaniv, Yair Wiener
ICDE
2003
IEEE
193views Database» more  ICDE 2003»
16 years 5 months ago
An Adaptive and Efficient Dimensionality Reduction Algorithm for High-Dimensional Indexing
The notorious "dimensionality curse" is a well-known phenomenon for any multi-dimensional indexes attempting to scale up to high dimensions. One well known approach to o...
Hui Jin, Beng Chin Ooi, Heng Tao Shen, Cui Yu, Aoy...