Sciweavers

792 search results - page 26 / 159
» Reading What Machines
Sort
View
APLAS
2006
ACM
14 years 1 months ago
A Pushdown Machine for Recursive XML Processing
XML transformations are most naturally defined as recursive functions on trees. Their direct implementation, however, causes inefficient memory usage because the input XML tree is...
Keisuke Nakano, Shin-Cheng Mu
ENTCS
2008
144views more  ENTCS 2008»
13 years 7 months ago
Platform Independent Timing of Java Virtual Machine Bytecode Instructions
The accurate measurement of the execution time of Java bytecode is one factor that is important in order to estimate the total execution time of a Java application running on a Ja...
Jonathan M. Lambert, James F. Power
CORR
1999
Springer
120views Education» more  CORR 1999»
13 years 7 months ago
A Machine-Independent Debugger--Revisited
Most debuggers are notoriously machine-dependent, but some recent research prototypes achieve varying degrees of machine-independence with novel designs. Cdb, a simple source-leve...
David R. Hanson
CVPR
1997
IEEE
14 years 9 months ago
Global Training of Document Processing Systems Using Graph Transformer Networks
We propose a new machine learning paradigm called Graph Transformer Networks that extends the applicability of gradient-based learning algorithms to systems composed of modules th...
Léon Bottou, Yoshua Bengio, Yann LeCun
ECTEL
2009
Springer
14 years 2 months ago
A Comparison of Paper-Based and Online Annotations in the Workplace
While reading documents, people commonly make annotations: they underline or highlight text and write comments in the margin. Making annotations during reading activities has been ...
Ricardo Kawase, Eelco Herder, Wolfgang Nejdl