Sciweavers

2489 search results - page 26 / 498
» On the Subgroup Distance Problem
Sort
View
IPL
2002
110views more  IPL 2002»
13 years 7 months ago
New bounds on a hypercube coloring problem
In studying the scalability of optical networks, one problem which arises involves coloring the vertices of the n-cube with as few colors as possible such that any two vertices wh...
Hung Q. Ngo, Ding-Zhu Du, Ronald L. Graham
BMCBI
2008
125views more  BMCBI 2008»
13 years 7 months ago
A fast algorithm for the multiple genome rearrangement problem with weighted reversals and transpositions
Background: Due to recent progress in genome sequencing, more and more data for phylogenetic reconstruction based on rearrangement distances between genomes become available. Howe...
Martin Bader, Mohamed Ibrahim Abouelhoda, Enno Ohl...
CORR
2008
Springer
93views Education» more  CORR 2008»
13 years 7 months ago
An optimization problem on the sphere
We prove existence and uniqueness of the minimizer for the average geodesic distance to the points of a geodesically convex set on the sphere. This implies a corresponding existen...
Andreas Maurer
ICALT
2006
IEEE
14 years 1 months ago
Plagiarism in e-Learning Systems: Identifying and Solving the Problem for Practical Assignments
A big part of life long learning is the move from residential lectures to distance education. Distance education falls under the multi-modal policy of the teaching institution and...
Emil Marais, Ursula Minnaar, David Argles
STACS
2001
Springer
13 years 12 months ago
Approximation Algorithms for the Bottleneck Stretch Factor Problem
The stretch factor of a Euclidean graph is the maximum ratio of the distance in the graph between any two points and their Euclidean distance. Given a set S of n points in Rd, we ...
Giri Narasimhan, Michiel H. M. Smid