Sciweavers

1826 search results - page 332 / 366
» Using Random Forests in the Structured Language Model
Sort
View
LISP
2006
105views more  LISP 2006»
14 years 9 months ago
Call-by-push-value: Decomposing call-by-value and call-by-name
We present the call-by-push-value (CBPV) calculus, which decomposes the typed call-by-value (CBV) and typed call-by-name (CBN) paradigms into fine-grain primitives. On the operatio...
Paul Blain Levy
WOTUG
2008
14 years 11 months ago
Representation and Implementation of CSP and VCR Traces
Abstract. Communicating Sequential Processes (CSP) was developed around a formal algebra of processes and a semantics based on traces (and failures and divergences). A trace is a r...
Neil C. C. Brown, Marc L. Smith
FOSSACS
2007
Springer
15 years 3 months ago
Symbolic Backwards-Reachability Analysis for Higher-Order Pushdown Systems
Higher-order pushdown systems (PDSs) generalise pushdown systems through the use of higher-order stacks, that is, a nested “stack of stacks” structure. These systems may be us...
Matthew Hague, C.-H. Luke Ong
VLDB
1998
ACM
149views Database» more  VLDB 1998»
15 years 1 months ago
Incremental Maintenance for Materialized Views over Semistructured Data
Semistructured data is not strictly typed like relational or object-oriented data and may be irregular or incomplete. It often arises in practice, e.g., when heterogeneous data so...
Serge Abiteboul, Jason McHugh, Michael Rys, Vasili...
82
Voted
ACMSE
2005
ACM
14 years 11 months ago
Generative approaches for application tailoring of mobile devices
The popularity of mobile devices has propelled the development of many useful location-aware applications. However, the heterogeneity of mobile devices necessitates that the softw...
Victoria Davis, Jeff Gray, Joel Jones