20066 search results - page 240 / 4014 » T Spaces |
139
click to vote
STOC
2003
ACM
16 years 7 months ago
2003
ACM
We show that n lines in 3-space can be cut into O(n2-1/69 log16/69 n) pieces, such that all depth cycles defined by triples of lines are eliminated. This partially resolves a long...
266
click to vote
SIGMOD
2008
ACM
16 years 6 months ago
2008
ACM
Recently, skyline queries have attracted much attention in the database research community. Space partitioning techniques, such as recursive division of the data space, have been ...
252
click to vote
SIGMOD
2008
ACM
16 years 6 months ago
2008
ACM
Random sampling is an appealing approach to build synopses of large data streams because random samples can be used for a broad spectrum of analytical tasks. Users are often inter...
175
click to vote
EDBT
2008
ACM
16 years 6 months ago
2008
ACM
Due to the well-known dimensionality curse problem, search in a high-dimensional space is considered as a "hard" problem. In this paper, a novel symmetrical encoding-bas...
151
click to vote
PERCOM
2004
ACM
16 years 6 months ago
2004
ACM
In this paper we show a novel middleware approach for pervasise applications that communicate via an XMLbased distributed virtual shared information space. This approach extends s...