377 search results - page 13 / 76 » Linear Tabling Strategies and Optimizations |
124
click to vote
ASIAN
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. We give conditions for hash table probing which minimize the expected number of collisions. A probing algorithm is determined by a sequence of numbers denoting jumps for ...
175
click to vote
CISS
2011
IEEE
14 years 8 months ago
2011
IEEE
—In this paper, we consider the amplified-and-forward relaying in a multichannel system with linear processing capability at the relay. We propose an analytical approach to stud...
147
click to vote
COCOON
1997
Springer
15 years 9 months ago
1997
Springer
In this paper, we consider the edge searching and node searching problems on trees. Given a tree, we show a transformation from an optimal node-search strategy to an optimal edge-...
127
click to vote
IIS
2004
15 years 6 months ago
2004
Estimating the result size of a join is an important query optimization problem as it determines the choice of a good query evaluation strategy. Yet, there are few efficient techni...
163
click to vote
MIA
2010
14 years 12 months ago
2010
We propose a framework for intensity-based registration of images by linear transformations, based on a discrete Markov Random Field (MRF) formulation. Here, the challenge arises ...