Sciweavers

803 search results - page 51 / 161
» Independence in Direct-Product Graphs
Sort
View
92
Voted
DM
2006
104views more  DM 2006»
15 years 21 days ago
Construction of trees and graphs with equal domination parameters
We provide a simple constructive characterization for trees with equal domination and independent domination numbers, and for trees with equal domination and total domination numb...
Michael Dorfling, Wayne Goddard, Michael A. Hennin...
DAM
2007
77views more  DAM 2007»
15 years 19 days ago
Decompositions of graphs of functions and fast iterations of lookup tables
We show that every function f implemented as a lookup table can be implemented such that the computational complexity of evaluating f m(x) is small, independently of m and x. The ...
Boaz Tsaban
99
Voted
JLP
2006
81views more  JLP 2006»
15 years 19 days ago
Development graphs - Proof management for structured specifications
Development graphs are a tool for dealing with structured specifications in a formal program development in order to ease the management of change and reusing proofs. In this work...
Till Mossakowski, Serge Autexier, Dieter Hutter
106
Voted
NETWORKS
2006
15 years 19 days ago
A simple algorithm that proves half-integrality of bidirected network programming
In a bidirected graph, each end of each edge is independently oriented. We show how to express any column of the incidence matrix as a half-integral linear combination of any colum...
Ethan D. Bolker, Thomas Zaslavsky
106
Voted
ICCV
2007
IEEE
15 years 7 months ago
Monocular SLAM as a Graph of Coalesced Observations
We present a monocular SLAM system that avoids inconsistency by coalescing observations into independent local coordinate frames, building a graph of the local frames, and optimiz...
Ethan Eade, Tom Drummond