Sciweavers

1633 search results - page 164 / 327
» Planar Map Graphs
Sort
View
FCCM
2006
IEEE
113views VLSI» more  FCCM 2006»
14 years 4 months ago
GraphStep: A System Architecture for Sparse-Graph Algorithms
— Many important applications are organized around long-lived, irregular sparse graphs (e.g., data and knowledge bases, CAD optimization, numerical problems, simulations). The gr...
Michael DeLorimier, Nachiket Kapre, Nikil Mehta, D...
CGF
2000
97views more  CGF 2000»
13 years 10 months ago
Collaboration between Heterogeneous Stand-alone 3-D Graphical Applications
We describe the Scene-Graph-As-Bus technique (SGAB), the first step in a staircase of solutions for sharing software components for virtual environments. The goals of SGAB are to ...
Robert C. Zeleznik, Loring Holden, Michael V. Capp...
AAAI
2008
14 years 1 months ago
Efficient Optimization of Information-Theoretic Exploration in SLAM
We present a novel method for information-theoretic exploration, leveraging recent work on mapping and localization. We describe exploration as the constrained optimization proble...
Thomas Kollar, Nicholas Roy
CORR
2011
Springer
215views Education» more  CORR 2011»
13 years 2 months ago
Lasserre Hierarchy, Higher Eigenvalues, and Approximation Schemes for Quadratic Integer Programming with PSD Objectives
We present an approximation scheme for optimizing certain Quadratic Integer Programming problems with positive semidefinite objective functions and global linear constraints. Thi...
Venkatesan Guruswami, Ali Kemal Sinop
DDECS
2008
IEEE
137views Hardware» more  DDECS 2008»
14 years 5 months ago
Cluster-based Simulated Annealing for Mapping Cores onto 2D Mesh Networks on Chip
Abstract—In Network-on-Chip (NoC) application design, coreto-node mapping is an important but intractable optimization problem. In the paper, we use simulated annealing to tackle...
Zhonghai Lu, Lei Xia, Axel Jantsch