9871 search results - page 194 / 1975 » On the Structure of Low Sets |
152
click to vote
ICPR
2000
IEEE
15 years 11 months ago
2000
IEEE
This paper introduces a family of ¢ ¢ tensors, referred to as “join tensors” or Jtensors for short, which perform “3D to 3D” alignment between coordinate systems of sets...
173
click to vote
CAIP
1999
Springer
15 years 10 months ago
1999
Springer
Abstract. We propose a new computational method for segmenting topological sub-dimensional point-sets in scalar images of arbitrary spatial dimensions. The technique is based on co...
196
click to vote
EWNLG
1993
15 years 10 months ago
1993
Abstract. An active research programme in Natural Language Generation has grown up around the notion of `coherence relations'. Relations are being used in a variety of roles i...
170
click to vote
CSC
2008
15 years 8 months ago
2008
- The set-covering problem is an interesting problem in computational complexity theory. In [1], the setcovering problem has been proved to be NP hard and a greedy heuristic algori...
169
click to vote
ICIP
2002
IEEE
16 years 8 months ago
2002
IEEE
In this paper, we address the issue of joint space-time segmentation of image sequences. Typical approaches to such segmentation consider two image frames at a time, and perform t...