Sciweavers

3265 search results - page 53 / 653
» Representing Groups on Graphs
Sort
View
121
Voted
ARSCOM
2006
91views more  ARSCOM 2006»
15 years 3 months ago
Binary codes from graphs on triples and permutation decoding
We show that permutation decoding can be used, and give explicit PD-sets in the symmetric group, for some of the binary codes obtained from the adjacency matrices of the graphs on...
Jennifer D. Key, Jamshid Moori, Bernardo Gabriel R...
102
Voted
AAAI
2007
15 years 5 months ago
Discovering Near Symmetry in Graphs
Symmetry is a widespread phenomenon that can offer opportunities for powerful exploitation in areas as diverse as molecular chemistry, pure mathematics, circuit design, biology an...
Maria Fox, Derek Long, Julie Porteous
108
Voted
MOBICOM
2004
ACM
15 years 9 months ago
A structured group mobility model for the simulation of mobile ad hoc networks
Realistic models for node movement are essential in simulating mobile ad hoc networks. Many MANET scenarios are most realistically represented using group movement, but existing g...
Ken Blakely, Bruce Lowekamp
128
Voted
CN
2010
164views more  CN 2010»
15 years 3 months ago
Attribute-based on-demand multicast group setup with membership anonymity
In many applications, it is desired to dynamically establish temporary multicast groups for secure message delivery. It is also often the case that the group membership informatio...
Shucheng Yu, Kui Ren, Wenjing Lou
ICPR
2002
IEEE
16 years 4 months ago
GraphGrep: A Fast and Universal Method for Querying Graphs
GraphGrep is an application-independent method for querying graphs, finding all the occurrences of a subgraph in a database of graphs. The interface to GraphGrep is a regular expr...
Rosalba Giugno, Dennis Shasha