336 search results - page 16 / 68 » Analytic Cut Trees |
101
click to vote
SBACPAD
2008
IEEE
15 years 6 months ago
2008
IEEE
Transactional memory is emerging as a parallel programming paradigm for multi-core processors. Despite the recent interest in transactional memory, there has been no study to char...
DEXA
1998
Springer
15 years 4 months ago
1998
Springer
The object identifier index of an object-oriented database system is typically 20% of the size of the database itself, and for large databases, only a small part of the index fits...
TIT
2011
14 years 6 months ago
2011
Abstract—The following network computing problem is considered. Source nodes in a directed acyclic network generate independent messages and a single receiver node computes a tar...
ECAI
1998
Springer
15 years 4 months ago
1998
Springer
Knowledge about forced moves enables to select a small number of moves from the set of possible moves. It is very important in complex domains where search trees have a large branc...
104
click to vote
IPL
2002
14 years 11 months ago
2002
We present worst-case lower bounds on the minimum size of a binary space partition (BSP) tree as a function of its height, for a set S of n axis-parallel line segments in the plan...