Sciweavers

588 search results - page 40 / 118
» Minimality Results for the Spatial Logics
Sort
View
FCT
2003
Springer
14 years 2 months ago
On a Logical Approach to Estimating Computational Complexity of Potentially Intractable Problems
Abstract. In the paper we present a purely logical approach to estimating computational complexity of potentially intractable problems. The approach is based on descriptive complex...
Andrzej Szalas
ICIP
2002
IEEE
14 years 10 months ago
Segmentation of non-rigid video objects using long term temporal consistency
This paper presents a new object-based segmentation technique which exploits a large temporal context in order to get coherent and robust segmentation results. The segmentation pr...
Henri Nicolas, Marc Chaumont, Stéphane Pate...
ICCAD
1997
IEEE
142views Hardware» more  ICCAD 1997»
14 years 1 months ago
Library-less synthesis for static CMOS combinational logic circuits
Traditional synthesis techniques optimize CMOS circuits in two phases i) logic minimization and ii) library mapping phase. Typically, the structures and the sizes of the gates in ...
Sergey Gavrilov, Alexey Glebov, Satyamurthy Pullel...
DAC
1999
ACM
14 years 9 months ago
Simultaneous Circuit Partitioning/Clustering with Retiming for Performance Optimization
Partitioning and clustering are crucial steps in circuit layout for handling large scale designs enabled by the deep submicron technologies. Retiming is an important sequential lo...
Jason Cong, Honching Li, Chang Wu
ICDE
2003
IEEE
116views Database» more  ICDE 2003»
14 years 10 months ago
Joining Massive High-Dimensional Datasets
We consider the problem of joining massive datasets. We propose two techniques for minimizing disk I/O cost of join operations for both spatial and sequence data. Our techniques o...
Tamer Kahveci, Christian A. Lang, Ambuj K. Singh