Sciweavers

503 search results - page 36 / 101
» Two Algorithms for the Minimum Enclosing Ball Problem
Sort
View
111
Voted
ADBIS
2000
Springer
82views Database» more  ADBIS 2000»
15 years 7 months ago
A New Algorithm for Page Access Sequencing in Join Processing
Abstract. One of the fundamental problems in relational database management is the handling of the join operation. Two of the problems are: 1) finding a page access sequence which...
Andrew Lim, Wee-Chong Oon, Chi-Hung Chi
164
Voted
CORR
2008
Springer
142views Education» more  CORR 2008»
15 years 3 months ago
On the Capacity and Diversity-Multiplexing Tradeoff of the Two-Way Relay Channel
This paper considers a multiple input multiple output (MIMO) two-way relay channel, where two nodes want to exchange data with each other using multiple relays. An iterative algor...
Rahul Vaze, Robert W. Heath Jr.
134
Voted
APPML
2008
159views more  APPML 2008»
15 years 3 months ago
The rook problem on saw-toothed chessboards
A saw-toothed chessboard, or STC for short, is a kind of chessboard whose boundary forms two staircases from left down to right without any hole inside it. A rook at square (i, j)...
Hon-Chan Chen, Ting-Yem Ho
EDBT
2008
ACM
154views Database» more  EDBT 2008»
16 years 3 months ago
Ring-constrained join: deriving fair middleman locations from pointsets via a geometric constraint
We introduce a novel spatial join operator, the ring-constrained join (RCJ). Given two sets P and Q of spatial points, the result of RCJ consists of pairs p, q (where p P, q Q) ...
Man Lung Yiu, Panagiotis Karras, Nikos Mamoulis
JCSS
2002
95views more  JCSS 2002»
15 years 3 months ago
Efficient algorithms for multichromosomal genome rearrangements
Hannenhalli and Pevzner [5] gave a polynomial time algorithm for computing the minimum number of reversals, translocations, fissions, and fusions, that would transform one multichr...
Glenn Tesler