Sciweavers

588 search results - page 13 / 118
» Minimality Results for the Spatial Logics
Sort
View
SSD
1999
Springer
97views Database» more  SSD 1999»
13 years 11 months ago
A Performance Evaluation of Spatial Join Processing Strategies
We provide an evaluation of query execution plans (QEP) in the case of queries with one or two spatial joins. The QEPs assume R -tree indexed relations and use a common set of spat...
Apostolos Papadopoulos, Philippe Rigaux, Michel Sc...
INFOCOM
2012
IEEE
11 years 10 months ago
Block permutations in Boolean Space to minimize TCAM for packet classification
Packet classification is one of the major challenges in designing high-speed routers and firewalls as it involves sophisticated multi-dimensional searching. Ternary Content Address...
Rihua Wei, Yang Xu, H. Jonathan Chao
ICCAD
2004
IEEE
150views Hardware» more  ICCAD 2004»
14 years 4 months ago
Hermes: LUT FPGA technology mapping algorithm for area minimization with optimum depth
— This paper presents Hermes, a depth-optimal LUT based FPGA mapping algorithm. The presented algorithm is based on a new strategy for finding LUTs allowing to find a good LUT ...
Maxim Teslenko, Elena Dubrova
PAMI
2006
180views more  PAMI 2006»
13 years 7 months ago
Globally Minimal Surfaces by Continuous Maximal Flows
In this paper we consider the problem of computing globally minimal continuous curves and surfaces for image segmentation and 3D reconstruction. This is solved using a maximal flo...
Ben Appleton, Hugues Talbot
IPPS
2000
IEEE
13 years 12 months ago
Job Scheduling that Minimizes Network Contention due to both Communication and I/O
As communication and I/O traffic increase on the interconnection network of high-performance systems, network contention becomes a critical problem drastically reducing performan...
Jens Mache, Virginia Mary Lo, Sharad Garg