Sciweavers

4 search results - page 1 / 1
» Fragment of Nonstandard Analysis with a Finitary Consistency...
Sort
View
BSL
2007
53views more  BSL 2007»
13 years 5 months ago
Fragment of Nonstandard Analysis with a Finitary Consistency Proof
We introduce a nonstandard arithmetic NQA− based on the theory developed by R. Chuaqui and P. Suppes in [2] (we will denote it by NQA+ ), with a weakened external open minimizati...
Michal Rössler, Emil Jerábek
CIKM
2007
Springer
13 years 11 months ago
Structure and semantics for expressive text kernels
Several problems in text categorization are too hard to be solved by standard bag-of-words representations. Work in kernel-based learning has approached this problem by (i) consid...
Stephan Bloehdorn, Alessandro Moschitti
JDA
2011
104views more  JDA 2011»
13 years 18 days ago
Deconstructing intractability - A multivariate complexity analysis of interval constrained coloring
The NP-hard Interval Constrained Coloring (ICC) problem appears in the interpretation of experimental data in biochemistry dealing with protein fragments. Given a set of m integer...
Christian Komusiewicz, Rolf Niedermeier, Johannes ...
CPM
2009
Springer
127views Combinatorics» more  CPM 2009»
14 years 6 days ago
Deconstructing Intractability: A Case Study for Interval Constrained Coloring
The NP-hard Interval Constrained Coloring problem appears in the interpretation of experimental data in biochemistry dealing with protein fragments. Given a set of m integer interv...
Christian Komusiewicz, Rolf Niedermeier, Johannes ...