Sciweavers

118 search results - page 13 / 24
» Ordinal computations
Sort
View
SAGT
2009
Springer
131views Game Theory» more  SAGT 2009»
14 years 2 months ago
The Computational Complexity of Weak Saddles
Abstract. We continue the recently initiated study of the computational aspects of weak saddles, an ordinal set-valued solution concept proposed by Shapley. Brandt et al. gave a po...
Felix Brandt, Markus Brill, Felix A. Fischer, Jan ...
BMCBI
2008
121views more  BMCBI 2008»
13 years 7 months ago
Stability of gene contributions and identification of outliers in multivariate analysis of microarray data
Background: Multivariate ordination methods are powerful tools for the exploration of complex data structures present in microarray data. These methods have several advantages com...
Florent Baty, Daniel Jaeger, Frank Preiswerk, Mart...
ICCV
2011
IEEE
12 years 7 months ago
Local Intensity Order Pattern for Feature Description
This paper presents a novel method for feature description based on intensity order. Specifically, a Local Intensity Order Pattern(LIOP) is proposed to encode the local ordinal i...
Zhenhua Wang, Bin Fan, Fuchao Wu
IICS
2009
Springer
14 years 2 months ago
Contributing and Socialization - Biaxial Segmentation for Users Generating Content
: User generated content is a valuable resource voluntarily provided by a growing number of users. As online and traditional businesses increasingly harness this resource the need ...
Hendrik Send, Daniel Michelis
BSL
2006
81views more  BSL 2006»
13 years 7 months ago
Classifying the Provably Total Functions of PA
We give a self-contained and streamlined version of the classification of the provably computable functions of PA. The emphasis is put on illuminating as good as seems possible th...
Andreas Weiermann