Sciweavers

377 search results - page 13 / 76
» Linear Tabling Strategies and Optimizations
Sort
View
ASIAN
2004
Springer
69views Algorithms» more  ASIAN 2004»
14 years 2 months ago
Using Optimal Golomb Rulers for Minimizing Collisions in Closed Hashing
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 ...
Lars Lundberg, Håkan Lennerstad, Kamilla Klo...
CISS
2011
IEEE
13 years 12 days ago
On linear processing for dual-hop multi-channel relaying
—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...
Min Dong, Mahdi Hajiaghayi, Ben Liang
COCOON
1997
Springer
14 years 1 months ago
Edge and Node Searching Problems on Trees
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-...
Sheng-Lung Peng, Chin-Wen Ho, Tsan-sheng Hsu, Ming...
IIS
2004
13 years 10 months ago
Query Selectivity Estimation via Data Mining
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...
Jarek Gryz, Dongming Liang
MIA
2010
170views more  MIA 2010»
13 years 3 months ago
Linear intensity-based image registration by Markov random fields and discrete optimization
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 ...
Darko Zikic, Ben Glocker, Oliver Kutter, Martin Gr...