Sciweavers

1174 search results - page 88 / 235
» Functional Trees
Sort
View
SPAA
1996
ACM
14 years 2 months ago
Constant Time per Edge is Optimal on Rooted Tree Networks
We analyze the relationship between the expected packet delay in rooted tree networks and the distribution of time needed for a packet to cross an edge using convexity-based stoch...
Michael Mitzenmacher
ECML
2006
Springer
14 years 1 months ago
Approximate Policy Iteration for Closed-Loop Learning of Visual Tasks
Abstract. Approximate Policy Iteration (API) is a reinforcement learning paradigm that is able to solve high-dimensional, continuous control problems. We propose to exploit API for...
Sébastien Jodogne, Cyril Briquet, Justus H....
ICSE
2003
IEEE-ACM
14 years 3 months ago
Architecture as an Emergent Property of Requirements Integration
Functional requirements contain, and systems exhibit, the behavior summarized below.Despite the advances in software engineering since 1968, how to go from a set of functional req...
R. Geoff Dromey
POPL
2010
ACM
14 years 7 months ago
Higher-Order Multi-Parameter Tree Transducers and Recursion Schemes for Program Verification
We introduce higher-order, multi-parameter, tree transducers (HMTTs, for short), which are kinds of higher-order tree transducers that take input trees and output a (possibly infi...
Naoki Kobayashi, Naoshi Tabuchi, Hiroshi Unno
BMCBI
2010
91views more  BMCBI 2010»
13 years 10 months ago
Coverage statistics for sequence census methods
We study the shape of coverage functions resulting from the sequencing of random genome fragments, and show that they can be described by Galton-Watson trees. This extends standar...
Steven N. Evans, Valerie Hower, Lior Pachter