Sciweavers

336 search results - page 16 / 68
» Analytic Cut Trees
Sort
View
SBACPAD
2008
IEEE
170views Hardware» more  SBACPAD 2008»
14 years 2 months ago
Using Analytical Models to Efficiently Explore Hardware Transactional Memory and Multi-Core Co-Design
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...
James Poe, Chang-Burm Cho, Tao Li
DEXA
1998
Springer
140views Database» more  DEXA 1998»
13 years 12 months ago
An Analytical Study of Object Identifier Indexing
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...
Kjetil Nørvåg, Kjell Bratbergsengen
TIT
2011
149views more  TIT 2011»
13 years 2 months ago
Network Coding for Computing: Cut-Set Bounds
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...
Rathinakumar Appuswamy, Massimo Franceschetti, Nik...
ECAI
1998
Springer
13 years 12 months ago
Metaprogramming Forced Moves
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...
Tristan Cazenave
IPL
2002
107views more  IPL 2002»
13 years 7 months ago
Binary space partitions for axis-parallel line segments: Size-height tradeoffs
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...
Sunil Arya