Sciweavers

725 search results - page 65 / 145
» Descriptive Set Theory of Families of Small Sets
Sort
View
ICFP
2005
ACM
15 years 9 months ago
A unified category-theoretic formulation of typed binding signatures
We generalise Fiore et al's account of variable binding for untyped cartesian contexts and Tanaka's account of variable binding for untyped linear contexts to give an ac...
Miki Tanaka, John Power
APPROX
2011
Springer
242views Algorithms» more  APPROX 2011»
13 years 9 months ago
New Tools for Graph Coloring
How to color 3 colorable graphs with few colors is a problem of longstanding interest. The best polynomial-time algorithm uses n0.2072 colors. There are no indications that colori...
Sanjeev Arora, Rong Ge
BMCBI
2006
94views more  BMCBI 2006»
14 years 9 months ago
Noise-injected neural networks show promise for use on small-sample expression data
Background: Overfitting the data is a salient issue for classifier design in small-sample settings. This is why selecting a classifier from a constrained family of classifiers, on...
Jianping Hua, James Lowey, Zixiang Xiong, Edward R...
AGILE
2008
Springer
120views GIS» more  AGILE 2008»
15 years 4 months ago
A Study on the Cognitive Plausibility of SIM-DL Similarity Rankings for Geographic Feature Types
The SIM-DL theory has been developed to enable similarity measurement between concept specifications using description logics. It thus closes the gap between similarity theories f...
Krzysztof Janowicz, Carsten Keßler, Ilija Pa...
QEST
2006
IEEE
15 years 3 months ago
Compositional Quantitative Reasoning
Abstract. We present a compositional theory of system verification, where specifications assign real-numbered costs to systems. These costs can express a wide variety of quantita...
Krishnendu Chatterjee, Luca de Alfaro, Marco Faell...