1809 search results - page 15 / 362 » Weakly Computable Real Numbers |
TCS
2008
13 years 7 months ago
2008
We define a new cost model for the call-by-value lambda-calculus satisfying the invariance thesis. That is, under the proposed cost model, Turing machines and the call-by-value la...
SPAA
2009
ACM
14 years 2 months ago
2009
ACM
We study deterministic, distributed algorithms for two weak variants of the standard graph coloring problem. We consider defective colorings, i.e., colorings where nodes of a colo...
CVPR
2009
IEEE
15 years 2 months ago
2009
IEEE
The goal of this work is to automatically learn a large
number of British Sign Language (BSL) signs from TV
broadcasts. We achieve this by using the supervisory information
avai...
CIE
2007
Springer
13 years 9 months ago
2007
Springer
This paper examines the constructive Hausdorff and packing dimensions of weak truth-table degrees. The main result is that every infinite sequence S with constructive Hausdorff...
ACL
2011
12 years 11 months ago
2011
Information extraction (IE) holds the promise of generating a large-scale knowledge base from the Web’s natural language text. Knowledge-based weak supervision, using structured...