Sciweavers

15375 search results - page 75 / 3075
» cans 2008
Sort
View
CONNECTION
2006
117views more  CONNECTION 2006»
13 years 7 months ago
Bootstrap learning of foundational representations
To be autonomous, intelligent robots must learn the foundations of commonsense knowledge from their own sensorimotor experience in the world. We describe four recent research resu...
Benjamin Kuipers, Patrick Beeson, Joseph Modayil, ...
DAM
2006
91views more  DAM 2006»
13 years 7 months ago
Precoloring extension on unit interval graphs
In the precoloring extension problem we are given a graph with some of the vertices having a preassigned color and it has to be decided whether this coloring can be extended to a ...
Dániel Marx
DAM
2006
66views more  DAM 2006»
13 years 7 months ago
On the structure of the adjacency matrix of the line digraph of a regular digraph
We show that the adjacency matrix M of the line digraph of a d-regular digraph D on n vertices can be written as M = AB, where the matrix A is the Kronecker product of the all-one...
Simone Severini
DCG
2006
96views more  DCG 2006»
13 years 7 months ago
Elementary Moves on Triangulations
It is proved that a triangulation of a polyhedron can always be transformed into any other triangulation of the polyhedron using only elementary moves. One consequence is that an ...
Monika Ludwig, Matthias Reitzner
DM
2006
108views more  DM 2006»
13 years 7 months ago
Optimal broadcast domination in polynomial time
Broadcast domination was introduced by Erwin in 2002, and it is a variant of the standard dominating set problem, such that different vertices can be assigned different domination...
Pinar Heggernes, Daniel Lokshtanov