1418 search results - page 225 / 284 » A Theory of Stream Queries |
WWW
2008
ACM
14 years 9 months ago
2008
ACM
All information exchange on the Internet ? whether through full text, controlled vocabularies, ontologies, or other mechanisms ? ultimately requires that that an information provi...
POPL
2004
ACM
14 years 9 months ago
2004
ACM
We aim to specify program transformations in a declarative style, and then to generate executable program transformers from such specifications. Many transformations require non-t...
CIE
2007
Springer
14 years 3 months ago
2007
Springer
Abstract. A classic result known as the speed-up theorem in machineindependent complexity theory shows that there exist some computable functions that do not have best programs for...
PODC
2006
ACM
14 years 3 months ago
2006
ACM
We study a novel separator property called k-path separable. Roughly speaking, a k-path separable graph can be recursively separated into smaller components by sequentially removi...
COMPGEOM
2004
ACM
14 years 2 months ago
2004
ACM
We present a novel Locality-Sensitive Hashing scheme for the Approximate Nearest Neighbor Problem under ÐÔ norm, based on Ôstable distributions. Our scheme improves the running...