Sciweavers

1192 search results - page 11 / 239
» Computing Weakest Readings
Sort
View
CSL
2005
Springer
15 years 5 months ago
Computing with Sequences, Weak Topologies and the Axiom of Choice
We study computability on sequence spaces, as they are used in functional analysis. It is known that non-separable normed spaces cannot be admissibly represented on Turing machines...
Vasco Brattka, Matthias Schröder
CHI
1998
ACM
15 years 4 months ago
Beyond Paper: Supporting Active Reading with Free Form Digital Ink Annotations
Reading frequently involves not just looking at words on a page, but also underlining, highlighting and commenting, either on the text or in a separate notebook. This combination ...
Bill N. Schilit, Gene Golovchinsky, Morgan N. Pric...
71
Voted
CONCUR
2009
Springer
15 years 6 months ago
Compositional Control Synthesis for Partially Observable Systems
We present a compositional method for deriving control constraints on a network of interconnected, partially observable and partially controllable plant components. The constraint ...
Wouter Kuijper, Jaco van de Pol
CIKM
2008
Springer
15 years 1 months ago
Reading in the office
Reading online poses a number of technological challenges. Advances in technology such as touch screens, light-weight high-power computers, and bi-stable displays have periodicall...
Gene Golovchinsky
RECOMB
2010
Springer
15 years 6 months ago
Inference of Isoforms from Short Sequence Reads
Jianxing Feng, Wei Li, Tao Jiang