Sciweavers

3267 search results - page 170 / 654
» Generalized quasirandom graphs
Sort
View
ICC
2008
IEEE
142views Communications» more  ICC 2008»
16 years 1 months ago
Maximal Scheduling in a Hypergraph Model for Wireless Networks
— We introduce a hypergraph based interference model for scheduling in wireless networks. As a generalization of the graph model, hypergraph considers the conflicts caused by su...
Qiao Li, Gyouhwan Kim, Rohit Negi
ICPR
2008
IEEE
16 years 1 months ago
Medical image segmentation via min s-t cuts with sides constraints
Graph cut algorithms (i.e., min s-t cuts) [3][10][15] are useful in many computer vision applications. In this paper we develop a formulation that allows the addition of side cons...
Jiun-Hung Chen, Linda G. Shapiro
ICC
2007
IEEE
16 years 26 days ago
Determination of Optimal Distortion-Based Protection in Progressive Image Transmission: a Heuristic Approach
— In this paper a method for the fast determination of distortion-based optimal unequal error protection (UEP) of bitstreams generated by embedded image coders is described. The ...
Alessio Torquati, Maria Fresia, Fabio Lavagetto
MFCS
2007
Springer
16 years 20 days ago
Hardness Results for Tournament Isomorphism and Automorphism
A tournament is a graph in which each pair of distinct vertices is connected by exactly one directed edge. Tournaments are an important graph class, for which isomorphism testing ...
Fabian Wagner
COMPGEOM
2006
ACM
16 years 16 days ago
Minimum weight triangulation is NP-hard
A triangulation of a planar point set S is a maximal plane straight-line graph with vertex set S. In the minimum weight triangulation (MWT) problem, we are looking for a triangula...
Wolfgang Mulzer, Günter Rote