Sciweavers

646 search results - page 81 / 130
» Generalized connected domination in graphs
Sort
View
EJC
2007
13 years 8 months ago
Link complexes of subspace arrangements
Abstract. Given a simplicial hyperplane arrangement H and a subspace arrangement A embedded in H, we define a simplicial complex ∆A,H as the subdivision of the link of A induced...
Axel Hultman
CLOUD
2010
ACM
14 years 1 months ago
Hermes: clustering users in large-scale e-mail services
Hermes is an optimization engine for large-scale enterprise e-mail services. Such services could be hosted by a virtualized e-mail service provider, or by dedicated enterprise dat...
Thomas Karagiannis, Christos Gkantsidis, Dushyanth...
IV
2002
IEEE
130views Visualization» more  IV 2002»
14 years 1 months ago
Spring Embedder Preprocessing for WWW Visualization
We present a preprocessor for the spring embedder graph drawing method and show its use in speeding up the automatic layout of three-dimensional visualizations of WWW sites. Sprin...
Paul Mutton, Peter Rodgers
SIROCCO
1997
13 years 10 months ago
Static Frequency Assignment in Cellular Networks
A cellular network is generally modeled as a subgraph of the triangular lattice. In the static frequency assignment problem, each vertex of the graph is a base station in the netw...
Lata Narayanan, Sunil M. Shende
PAMI
2006
156views more  PAMI 2006»
13 years 8 months ago
Robust Point Matching for Nonrigid Shapes by Preserving Local Neighborhood Structures
In previous work on point matching, a set of points is often treated as an instance of a joint distribution to exploit global relationships in the point set. For nonrigid shapes, h...
Yefeng Zheng, David S. Doermann