13306 search results - page 461 / 2662 » Theoretical Computer Science |
199
click to vote
FOCS
2006
IEEE
16 years 1 months ago
2006
IEEE
The “analyst’s traveling salesman theorem” of geometric measure theory characterizes those subsets of Euclidean space that are contained in curves of finite length. This re...
212
click to vote
STACS
2009
Springer
16 years 2 months ago
2009
Springer
The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic-programming s...
191
click to vote
TCS
2010
15 years 6 months ago
2010
We compare how computational effects are modelled in Classical Domain Theory and Topological Domain Theory. Both of these theories provide powerful toolkits for denotational sema...
175
click to vote
ICALP
2004
Springer
16 years 1 months ago
2004
Springer
Abstract We present an analog and machine-independent algebraic characterization of elementarily computable functions over the real numbers in the sense of recursive analysis: we p...
189
click to vote
ITICSE
2005
ACM
16 years 1 months ago
2005
ACM
Recent research has shown that a student’s learning style – essentially, the way a student approaches and masters new material – can affect student performance in introducto...