Sciweavers

1022 search results - page 17 / 205
» Logspace Complexity of Functions and Structures
Sort
View
CIE
2005
Springer
14 years 1 months ago
Recursion and Complexity
1 and 2, and in the last Section 4 of this abstract I will outline very briefly some conclusions about recursion and complexity which I believe that they support. 1 Partial Algebr...
Yiannis N. Moschovakis
BMCBI
2010
179views more  BMCBI 2010»
13 years 7 months ago
A semi-supervised learning approach to predict synthetic genetic interactions by combining functional and topological properties
Background: Genetic interaction profiles are highly informative and helpful for understanding the functional linkages between genes, and therefore have been extensively exploited ...
Zhuhong You, Zheng Yin, Kyungsook Han, De-Shuang H...
LATIN
2010
Springer
14 years 2 months ago
Compact Rich-Functional Binary Relation Representations
Binary relations are an important abstraction arising in a number of data representation problems. Each existing data structure specializes in the few basic operations required by ...
Jérémy Barbay, Francisco Claude, Gon...
SAS
2010
Springer
140views Formal Methods» more  SAS 2010»
13 years 6 months ago
Multi-dimensional Rankings, Program Termination, and Complexity Bounds of Flowchart Programs
Abstract. Proving the termination of a flowchart program can be done by exhibiting a ranking function, i.e., a function from the program states to a wellfounded set, which strictl...
Christophe Alias, Alain Darte, Paul Feautrier, Lau...
ALT
2010
Springer
13 years 7 months ago
Recursive Teaching Dimension, Learning Complexity, and Maximum Classes
This paper is concerned with the combinatorial structure of concept classes that can be learned from a small number of examples. We show that the recently introduced notion of recu...
Thorsten Doliwa, Hans-Ulrich Simon, Sandra Zilles