Sciweavers

1532 search results - page 254 / 307
» Connection Relations in Mereotopology
Sort
View
BMCBI
2007
150views more  BMCBI 2007»
13 years 9 months ago
Refining intra-protein contact prediction by graph analysis
Background: Accurate prediction of intra-protein residue contacts from sequence information will allow the prediction of protein structures. Basic predictions of such specific con...
Milana Frenkel-Morgenstern, Rachel Magid, Eran Eya...
GC
2006
Springer
13 years 9 months ago
The Semi-Arc Automorphism Group of a Graph with Application to Map Enumeration
A map is a connected topological graph cellularly embedded in a surface. For a given graph , its genus distribution of rooted maps and embeddings on orientable and non-orientable s...
Linfan Mao, Yanpei Liu, Erling Wei
CCR
2007
108views more  CCR 2007»
13 years 9 months ago
Very low-cost internet access using KioskNet
Rural Internet kiosks in developing regions can cost-effectively provide communication and e-governance services to the poorest sections of society. A variety of technical and no...
Shimin Guo, Mohammad Hossein Falaki, Earl A. Olive...
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...
COMBINATORICS
2007
72views more  COMBINATORICS 2007»
13 years 9 months ago
Matrix Partitions with Finitely Many Obstructions
Each m by m symmetric matrix M over 0, 1, ∗, defines a partition problem, in which an input graph G is to be partitioned into m parts with adjacencies governed by M, in the sen...
Tomás Feder, Pavol Hell, Wing Xie