Sciweavers

1736 search results - page 77 / 348
» On antimagic directed graphs
Sort
View
ISPA
2004
Springer
14 years 4 months ago
Cayley DHTs - A Group-Theoretic Framework for Analyzing DHTs Based on Cayley Graphs
Static DHT topologies influence important features of such DHTs such as scalability, communication load balancing, routing efficiency and fault tolerance. Nevertheless, it is co...
Changtao Qu, Wolfgang Nejdl, Matthias Kriesell
CVPR
2005
IEEE
15 years 23 days ago
Graph Embedding: A General Framework for Dimensionality Reduction
In the last decades, a large family of algorithms supervised or unsupervised; stemming from statistic or geometry theory have been proposed to provide different solutions to the p...
Shuicheng Yan, Dong Xu, Benyu Zhang, HongJiang Zha...
AC
2000
Springer
14 years 3 months ago
Graph-Theoretical Methods in Computer Vision
The management of large databases of hierarchical (e.g., multi-scale or multilevel) image features is a common problem in object recognition. Such structures are often represented ...
Ali Shokoufandeh, Sven J. Dickinson
AIPS
2006
14 years 4 days ago
Incremental Maintenance of Double Precedence Graphs: A Constraint-Based Approach
Reasoning on precedence relations is crucial for many planning and scheduling systems. In this paper we propose a double precedence graph where direct precedence relations are kep...
Roman Barták, Ondrej Cepek
SIROCCO
2001
14 years 3 days ago
On Finding Minimum Deadly Sets for Directed Networks
Given a set S of elements in a directed network that are initially faulty, an element becomes (functionally) faulty if all its in-neighbors or all its outneighbors are (functional...
Norbert Zeh, Nicola Santoro