Sciweavers

342 search results - page 60 / 69
» Using Decision Trees to Construct a Practical Parser
Sort
View
SMALLTALK
2007
Springer
14 years 2 months ago
Transactional memory for smalltalk
Concurrency control in Smalltalk is based on locks and is therefore notoriously difficult to use. Even though some implementations provide high-level constructs, these add complexi...
Lukas Renggli, Oscar Nierstrasz
DEXA
2009
Springer
127views Database» more  DEXA 2009»
14 years 3 months ago
The Real Performance Drivers behind XML Lock Protocols
Abstract. Fine-grained lock protocols should allow for highly concurrent transaction processing on XML document trees, which is addressed by the taDOM lock protocol family enabling...
Sebastian Bächle, Theo Härder
CHI
2005
ACM
14 years 9 months ago
The role of the author in topical blogs
Web logs, or blogs, challenge the notion of authorship. Seemingly, rather than a model in which the author's writings are themselves a contribution, the blog author weaves a ...
Scott Carter
ICS
2010
Tsinghua U.
14 years 6 months ago
Distribution-Specific Agnostic Boosting
We consider the problem of boosting the accuracy of weak learning algorithms in the agnostic learning framework of Haussler (1992) and Kearns et al. (1992). Known algorithms for t...
Vitaly Feldman
ICLP
2007
Springer
14 years 2 months ago
Automatic Correctness Proofs for Logic Program Transformations
Abstract. The many approaches which have been proposed in the literature for proving the correctness of unfold/fold program transformations, consist in associating suitable well-fo...
Alberto Pettorossi, Maurizio Proietti, Valerio Sen...