Sciweavers

248 search results - page 39 / 50
» On the Cayley isomorphism problem
Sort
View
CISS
2008
IEEE
14 years 4 months ago
A genetic algorithm for designing constellations with low error floors
—The error floor of bit-interleaved coded modulation with iterative decoding (BICM-ID) can be minimized for a particular constellation by maximizing the harmonic mean of the squ...
Matthew C. Valenti, Raghu Doppalapudi, Don J. Torr...
DIS
2007
Springer
14 years 1 months ago
Time and Space Efficient Discovery of Maximal Geometric Graphs
A geometric graph is a labeled graph whose vertices are points in the 2D plane with an isomorphism invariant under geometric transformations such as translation, rotation, and scal...
Hiroki Arimura, Takeaki Uno, Shinichi Shimozono
IJRR
2008
98views more  IJRR 2008»
13 years 9 months ago
Automatic Configuration Recognition Methods in Modular Robots
Recognizing useful modular robot configurations composed of hundreds of modules is a significant challenge. Matching a new modular robot configuration to a library of known configu...
Michael Park, Sachin Chitta, Alex Teichman, Mark Y...
SIGCOMM
2010
ACM
13 years 10 months ago
Generic and automatic address configuration for data center networks
Data center networks encode locality and topology information into their server and switch addresses for performance and routing purposes. For this reason, the traditional address...
Kai Chen, Chuanxiong Guo, Haitao Wu, Jing Yuan, Zh...
SSDBM
2010
IEEE
133views Database» more  SSDBM 2010»
13 years 7 months ago
PrefIndex: An Efficient Supergraph Containment Search Technique
Graphs are prevailingly used in many applications to model complex data structures. In this paper, we study the problem of supergraph containment search. To avoid the NP-complete s...
Gaoping Zhu, Xuemin Lin, Wenjie Zhang, Wei Wang, H...