Sciweavers

4463 search results - page 446 / 893
» computing 2000
Sort
View
FOCS
2000
IEEE
15 years 11 months ago
On the Hardness of Graph Isomorphism
We show that the graph isomorphism problem is hard under DLOGTIME uniform AC0 many-one reductions for the complexity classes NL, PL (probabilistic logarithmic space) for every loga...
Jacobo Torán
BMVC
2000
15 years 8 months ago
Data and Decision Level Fusion of Temporal Information for Automatic Target Recognition
Automatic Target Recognition (ATR) is a demanding application that requires separation of targets from a noisy background in a sequence of images. In our previous work [5] the bac...
Kieron Messer, Josef Kittler
CVPR
2000
IEEE
16 years 8 months ago
A Robust and Efficient Motion Segmentation Based on Orthogonal Projection Matrix of Shape Space
A novel algorithm for motion segmentation is proposed. The algorithm uses the fact that shape of an object with homogeneous motion is represented as 4 dimensional linear space. Th...
Naoyuki Ichimura
ICPR
2000
IEEE
16 years 7 months ago
Color and/or Texture Segmentation Using Deterministic Relaxation and Fast Marching Algorithms
The segmentation of colored texture images is considered. Either luminance, color, and/or texture features could be used for segmentation. For luminance and color the classes are ...
Spyros Liapis, Eftychios Sifakis, George Tziritas
IPPS
2000
IEEE
15 years 11 months ago
JavaSpMT: A Speculative Thread Pipelining Parallelization Model for Java Programs
This paper presents a new approach to improve performance of Java programs by extending the superthreaded speculative execution model [14, 15] to exploit coarsegrained parallelism...
Iffat H. Kazi, David J. Lilja