1883 search results - page 221 / 377 » Ordered theta graphs |
EMSOFT
2005
Springer
14 years 1 months ago
2005
Springer
Abstract— This paper explores the problem of efficiently ordering interprocessor communication operations in both statically and dynamically-scheduled multiprocessors for iterat...
WG
2004
Springer
14 years 1 months ago
2004
Springer
The clique problem consists in determining whether an undirected graph G of order n contains a clique of order . In this paper we are concerned with the decremental version of cliq...
ACSAC
2003
IEEE
14 years 1 months ago
2003
IEEE
Reassembly of fragmented objects from a collection of randomly mixed fragments is a common problem in classical forensics. In this paper we address the digital forensic equivalent...
ISIPTA
2003
IEEE
14 years 1 months ago
2003
IEEE
Independence models induced by some uncertainty measures (e.g. conditional probability, possibility) do not obey the usual graphoid properties, since they do not satisfy the symme...
SIBGRAPI
2000
IEEE
14 years 17 days ago
2000
IEEE
This article deals with a new segmentation approach applied to unconstrained handwritten digits. The novelty of the proposed algorithm is based on the combination of two types of s...