1686 search results - page 284 / 338 » Programs as polygraphs: computability and complexity |
STOC
2004
ACM
15 years 10 months ago
2004
ACM
In this paper we present a sublinear time (1+ )-approximation randomized algorithm to estimate the weight of the minimum spanning tree of an n-point metric space. The running time...
ICALP
2009
Springer
15 years 10 months ago
2009
Springer
We present a range of new results for testing properties of Boolean functions that are defined in terms of the Fourier spectrum. Broadly speaking, our results show that the propert...
ICSE
2005
IEEE-ACM
15 years 9 months ago
2005
IEEE-ACM
When building scalable systems that involve general-purpose computation and persistent data, object-oriented languages and relational databases are often essential components. Yet...
MOBIHOC
2008
ACM
15 years 9 months ago
2008
ACM
ization of domain-specific programming abstractions for wireless sensor actor networks can greatly ease application development. A high level of abstraction from underlying system...
ICWS
2009
IEEE
15 years 6 months ago
2009
IEEE
Professional mashups that include complex choreographies, data mediation, and result publishing within Web pages are still affected by implementation and design practices that rel...