Sciweavers

829 search results - page 60 / 166
» Distance domination-critical graphs
Sort
View
DCC
2008
IEEE
15 years 11 months ago
Edge local complementation and equivalence of binary linear codes
Abstract. Orbits of graphs under the operation edge local complementation (ELC) are defined. We show that the ELC orbit of a bipartite graph corresponds to the equivalence class of...
Lars Eirik Danielsen, Matthew G. Parker
ICPR
2008
IEEE
15 years 6 months ago
Semi-supervised learning by locally linear embedding in kernel space
Graph based semi-supervised learning methods (SSL) implicitly assume that the intrinsic geometry of the data points can be fully specified by an Euclidean distance based local ne...
Rujie Liu, Yuehong Wang, Takayuki Baba, Daiki Masu...
VISSOFT
2002
IEEE
15 years 4 months ago
Metrics-Based 3D Visualization of Large Object-Oriented Programs
In this paper a new approach for a metrics based software visualization is presented which supports an efficient and effective quality assessment of large object-oriented software...
Claus Lewerentz, Frank Simon
DIALM
1999
ACM
98views Algorithms» more  DIALM 1999»
15 years 4 months ago
Routing with guaranteed delivery in ad hoc wireless networks
We consider routing problems in ad hoc wireless networks modeled as unit graphs in which nodes are points in the plane and two nodes can communicate if the distance between them is...
Prosenjit Bose, Pat Morin, Ivan Stojmenovic, Jorge...
ICRA
2010
IEEE
131views Robotics» more  ICRA 2010»
14 years 10 months ago
Optimal coverage of a known arbitrary environment
— The problem of coverage of known space by a mobile robot has many applications. Of particular interest is providing a solution that guarantees the complete coverage of the free...
Raphael Mannadiar, Ioannis M. Rekleitis