Sciweavers

6740 search results - page 77 / 1348
» An s -Hamiltonian Line Graph Problem
Sort
View
COMBINATORICS
2006
107views more  COMBINATORICS 2006»
13 years 10 months ago
On the Symmetry of the Distribution of k-Crossings and k-Nestings in Graphs
This note contains two results on the distribution of k-crossings and k-nestings in graphs. On the positive side, we exhibit a class of graphs for which there are as many k-noncro...
Anna de Mier
CPM
2008
Springer
148views Combinatorics» more  CPM 2008»
13 years 12 months ago
On-Line Approximate String Matching with Bounded Errors
We introduce a new dimension to the widely studied on-line approximate string matching problem, by introducing an error threshold parameter so that the algorithm is allowed to mis...
Marcos A. Kiwi, Gonzalo Navarro, Claudio Telha
ICRA
2005
IEEE
108views Robotics» more  ICRA 2005»
14 years 3 months ago
Visual Servoing: Reaching the Desired Location Following a Straight Line via Polynomial Parameterizations
— The problem of establishing if it is possible to reach the desired location keeping all features in the field of view and following a straight line is considered. The proposed...
Graziano Chesi, Domenico Prattichizzo, Antonio Vic...
DCC
2007
IEEE
14 years 9 months ago
Structure induction by lossless graph compression
This work is motivated by the necessity to automate the discovery of structure in vast and evergrowing collection of relational data commonly represented as graphs, for example ge...
Leonid Peshkin
COCOON
2009
Springer
14 years 4 months ago
Convex Partitions with 2-Edge Connected Dual Graphs
It is shown that for every finite set of disjoint convex polygonal obstacles in the plane, with a total of n vertices, the free space around the obstacles can be partitioned into ...
Marwan Al-Jubeh, Michael Hoffmann, Mashhood Ishaqu...