Sciweavers

4372 search results - page 14 / 875
» Algorithmic Theories of Everything
Sort
View
CORR
2011
Springer
170views Education» more  CORR 2011»
13 years 11 days ago
A Modular Type-checking algorithm for Type Theory with Singleton Types and Proof Irrelevance
We define a logical framework with singleton types and one universe of small types. We give the semantics using a PER model; it is used for constructing a normalisation-by-evaluat...
Andreas Abel, Thierry Coquand, Miguel Pagano
ICML
2008
IEEE
14 years 9 months ago
Listwise approach to learning to rank: theory and algorithm
This paper aims to conduct a study on the listwise approach to learning to rank. The listwise approach learns a ranking function by taking individual lists as instances and minimi...
Fen Xia, Tie-Yan Liu, Jue Wang, Wensheng Zhang, Ha...
PAMI
2002
127views more  PAMI 2002»
13 years 8 months ago
Relative Fuzzy Connectedness and Object Definition: Theory, Algorithms, and Applications in Image Segmentation
The notion of fuzzy connectedness captures the idea of "hanging-togetherness" of image elements in an object by assigning a strength of connectedness to every possible pa...
Jayaram K. Udupa, Punam K. Saha, Roberto de Alenca...
CORR
2011
Springer
169views Education» more  CORR 2011»
13 years 3 months ago
Linear-Time Algorithms for Graphs of Bounded Rankwidth: A Fresh Look Using Game Theory
d Abstract) Alexander Langer, Peter Rossmanith, and Somnath Sikdar RWTH Aachen University, 52074 Aachen, Germany. We present an alternative proof of a theorem by Courcelle, Makowsk...
Alexander Langer, Peter Rossmanith, Somnath Sikdar
SYNTHESE
2008
84views more  SYNTHESE 2008»
13 years 8 months ago
How experimental algorithmics can benefit from Mayo's extensions to Neyman-Pearson theory of testing
Although theoretical results for several algorithms in many application domains were presented during the last decades, not all algorithms can be analyzed fully theoretically. Exp...
Thomas Bartz-Beielstein