3495 search results - page 145 / 699 » On the random satisfiable process |
147
click to vote
PPAM
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorit...
135
click to vote
IPPS
2003
IEEE
15 years 9 months ago
2003
IEEE
: This paper presents a new tightly coupled computation/communication design developed to support the unique operational requirements of sensor webs. A critical challenge of sensor...
138
click to vote
ADBIS
1999
Springer
15 years 8 months ago
1999
Springer
Abstract. Overlapping Linear Quadtrees is a structure suitable for storing consecutive raster images according to transaction time (a database of evolving images). This structure s...
133
click to vote
FUIN
2006
15 years 4 months ago
2006
In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorithm due to M...
112
click to vote
IGARSS
2009
15 years 2 months ago
2009
In the context of non-Gaussian polarimetric clutter models, this paper presents an application of the recent advances in the field of Spherically Invariant Random Vectors (SIRV) m...