5350 search results - page 351 / 1070 » Space and time in eco-ontologies |
236
Voted
COMPGEOM
2010
ACM
15 years 12 months ago
2010
ACM
Orthogonal range reporting is the problem of storing a set of n points in d-dimensional space, such that the k points in an axis-orthogonal query box can be reported efficiently. ...
179
click to vote
DKE
1998
15 years 6 months ago
1998
Disk I/O is a major bottleneck for query processing in database applications. This bottleneck is especially a problem for temporal databases because of their large size. Reduction...
192
click to vote
SODA
2012
ACM
13 years 9 months ago
2012
ACM
We describe a data structure for submatrix maximum queries in Monge matrices or Monge partial matrices, where a query specifies a contiguous submatrix of the given matrix, and it...
245
click to vote
SODA
2010
ACM
16 years 4 months ago
2010
ACM
We present a simple and practical algorithm for the c-approximate near neighbor problem (c-NN): given n points P Rd and radius R, build a data structure which, given q Rd , can ...
286
click to vote
Publication
I. Introduction
II. Foundations
A. The Mathematical Structure of Physical Field Theories
B. Geometric Objects and Orientation
1. Space-Time Object...