Sciweavers

1633 search results - page 210 / 327
» Planar Map Graphs
Sort
View
ICRA
2005
IEEE
116views Robotics» more  ICRA 2005»
14 years 4 months ago
Using Hierarchical EM to Extract Planes from 3D Range Scans
— Recently, the acquisition of three-dimensional maps has become more and more popular. This is motivated by the fact that robots act in the three-dimensional world and several t...
Rudolph Triebel, Wolfram Burgard, Frank Dellaert
GD
2005
Springer
14 years 3 months ago
Odd Crossing Number Is Not Crossing Number
The crossing number of a graph is the minimum number of edge intersections in a plane drawing of a graph, where each intersection is counted separately. If instead we count the nu...
Michael J. Pelsmajer, Marcus Schaefer, Daniel Stef...
DM
2008
89views more  DM 2008»
13 years 10 months ago
Combinatorics of sequential dynamical systems
In this paper we study sequential dynamical systems (SDS) over words. Our main result is the classification of SDS over words for fixed graphY and family of local maps (Fvi ) by m...
Christian M. Reidys
JSA
2007
191views more  JSA 2007»
13 years 10 months ago
Automated memory-aware application distribution for Multi-processor System-on-Chips
Mapping of applications on a Multiprocessor System-on-Chip (MP-SoC) is a crucial step to optimize performance, energy and memory constraints at the same time. The problem is formu...
Heikki Orsila, Tero Kangas, Erno Salminen, Timo D....
NIPS
2003
13 years 11 months ago
Minimax Embeddings
Spectral methods for nonlinear dimensionality reduction (NLDR) impose a neighborhood graph on point data and compute eigenfunctions of a quadratic form generated from the graph. W...
Matthew Brand