15033 search results - page 2734 / 3007 » Complexity Theory and Algorithms |
148
click to vote
VLDB
1994
ACM
15 years 10 months ago
1994
ACM
We propose a new R-tree structure that outperforms all the older ones. The heart of the idea is to facilitate the deferred splitting approach in R-trees. This is done by proposing...
159
Voted
PPSN
1992
Springer
15 years 10 months ago
1992
Springer
This paper introduces a new optimization technique called hyperplane annealing. It is similar to the mean field annealing approach to combinatorial optimization. Both annealing te...
174
click to vote
VLDB
1992
ACM
15 years 10 months ago
1992
ACM
Research in temporal databases has mainly focused on defining temporal data models by extending existing models, and developing access structures for temporal data. Little has bee...
115
click to vote
SIGMOD
1990
ACM
15 years 10 months ago
1990
ACM
The role of database knowledge 1susually limited to the evaluation of data queries In this paper we argue that when this knowledge 1sof substantial volume and complexity, there 1s...
176
click to vote
ACII
2007
Springer
15 years 10 months ago
2007
Springer
In this paper we present a novel framework for analysing non-stylised motion in order to detect implicitly communicated affect. Our approach makes use of a segmentation technique w...