Sciweavers

895 search results - page 105 / 179
» Triangulating Topological Spaces
Sort
View
ESA
2010
Springer
248views Algorithms» more  ESA 2010»
14 years 1 days ago
The Robustness of Level Sets
We define the robustness of a level set homology class of a function f : X R as the magnitude of a perturbation necessary to kill the class. Casting this notion into a group theor...
Paul Bendich, Herbert Edelsbrunner, Dmitriy Morozo...
CORR
2010
Springer
98views Education» more  CORR 2010»
13 years 11 months ago
Strategical languages of infinite words
: We deal in this paper with strategical languages of infinite words, that is those generated by a nondeterministic strategy in the sense of game theory. We first show the existenc...
Mustapha Arfi, Bedine Ould M. Lemine, Carla Selmi
CPC
2006
132views more  CPC 2006»
13 years 11 months ago
Duality in Infinite Graphs
The adaption of combinatorial duality to infinite graphs has been hampered by the fact that while cuts (or cocycles) can be infinite, cycles are finite. We show that these obstruc...
Henning Bruhn, Reinhard Diestel
IJDMMM
2008
87views more  IJDMMM 2008»
13 years 11 months ago
Is an ordinal class structure useful in classifier learning?
In recent years, a number of machine learning algorithms have been developed for the problem of ordinal classification. These algorithms try to exploit, in one way or the other, t...
Jens C. Huhn, Eyke Hüllermeier
ENTCS
2007
86views more  ENTCS 2007»
13 years 11 months ago
On the Non-sequential Nature of Domain Models of Real-number Computation
Escard´o, Hofmann and Streicher showed that real-number computations in the interval-domain environment are inherently parallel, in the sense that they imply the presence of weak...
Thomas Anberrée