2694 search results - page 384 / 539 » Frege's New Science |
156
click to vote
AIED
2009
Springer
16 years 1 months ago
2009
Springer
Comprehension of science texts is challenging, particularly when the reader lacks the skills or knowledge necessary to fill in conceptual gaps in the text content. The iSTART syste...
132
click to vote
WDAG
2009
Springer
16 years 1 months ago
2009
Springer
Given an undirected graph and 0 ≤ ≤ 1, a set of nodes is called -near clique if all but an fraction of the pairs of nodes in the set have a link between them. In this paper we...
152
click to vote
COCO
2009
Springer
16 years 1 months ago
2009
Springer
The coding theorem is a fundamental result of algorithmic information theory. A well known theorem of G´acs shows that the analog of the coding theorem fails for continuous sample...
163
click to vote
COCO
2009
Springer
16 years 1 months ago
2009
Springer
—We show that the rank of a depth-3 circuit (over any field) that is simple, minimal and zero is at most O(k3 log d). The previous best rank bound known was 2O(k2 ) (log d)k−2...
161
click to vote
ICCS
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. The high level of abstraction necessary to teach data structures and algorithmic schemes has been more than a hindrance to students. In order to make a proper approach to...