10054 search results - page 1833 / 2011 » On the Complexity of Function Learning |
147
click to vote
ICFP
2008
ACM
16 years 4 months ago
2008
ACM
We describe an axiomatic extension to the Coq proof assistant, that supports writing, reasoning about, and extracting higher-order, dependently-typed programs with side-effects. C...
132
Voted
EUROSYS
2007
ACM
16 years 1 months ago
2007
ACM
In this paper, we present COSMOS, a novel architecture for macroprogramming heterogeneous sensor network systems. Macroprogramming entails aggregate system behavior specification...
133
click to vote
PEPM
2010
ACM
16 years 27 days ago
2010
ACM
We show how to efficiently evaluate generic map-filter-product queries, generalizations of select-project-join (SPJ) queries in relational algebra, based on a combination of two...
143
click to vote
SAC
2010
ACM
15 years 11 months ago
2010
ACM
Cluster-based multi-tier systems provide a means for building scalable Internet services. Building adaptive Internet services that are able to apply appropriate system sizing and ...
123
click to vote
MFCS
2009
Springer
15 years 10 months ago
2009
Springer
We introduce the tree evaluation problem, show that it is in LogDCFL (and hence in P), and study its branching program complexity in the hope of eventually proving a superlogarith...