6618 search results - page 1324 / 1324 » Natural Logic for Natural Language |
ICALP
2011
Springer
12 years 8 months ago
2011
Springer
We present an O( √ n log n)-approximation algorithm for the problem of finding the sparsest spanner of a given directed graph G on n vertices. A spanner of a graph is a sparse ...
262
click to vote
Lecture Notes
I have been designing and building applications, including the databases used by those applications, for several decades now. I have seen similar problems approached by different d...
SIGUCCS
2006
ACM
13 years 11 months ago
2006
ACM
In this paper we present the results of an experiment made with our e-librarian service ”MatES”, an e-Learning tool on fractions in mathematics. MatES allows students to enter...