CONFIDENTIAL. Limited circulation. For review only. Handling shape and contact location uncertainty in grasping two-dimensional planar objects Vassilios N. Christopoulos and Paul Schrater Abstract— This paper addresse

Source URL: gandalf.psych.umn.edu

Microsoft Word - FinalProg.doc

Source URL: www.rvg.ua.es

• Planar graph
• Mathematics
• Applied mathematics
• Cluster analysis
• Consensus clustering
• Neighbourhood

Treewidth and graph minors Lectures 9 and 10, December 29, 2011, January 5, 2012 We shall touch upon the theory of Graph Minors by Robertson and Seymour. This theory gives a very general condition under which a graph pro

Source URL: www.wisdom.weizmann.ac.il

• Tree decomposition
• Graph coloring
• Minor
• Tree
• Robertson–Seymour theorem
• Clique
• Neighbourhood
• Graph
• Bipartite graph
• Graph theory
• Graph operations
• Planar graphs

CCCG 2013, Waterloo, Ontario, August 8–10, 2013 Counting Triangulations Approximately Victor Alvarez∗ Karl Bringmann†

Source URL: cccg.ca

• Analysis of algorithms
• Triangulation
• Computational complexity theory
• Time complexity
• Algorithm
• Randomized algorithm
• Big O notation
• Delaunay triangulation
• Planar separator theorem
• Theoretical computer science
• Mathematics
• Applied mathematics

Desktop Monitors Desktop Monitors for Any Application Planar’s comprehensive desktop monitor lines are designed to meet a wide range of performance requirements.

Source URL: www.planar.com

• Television technology
• Video signal
• VESA
• DisplayPort
• Digital Visual Interface
• HDMI
• TFT LCD
• Nvidia Ion
• Video Graphics Array
• Computer hardware
• Computer display standards
• High-definition television

KaHIP v0.71 – Karlsruhe High Quality Partitioning User Guide Peter Sanders and Christian Schulz Karlsruhe Institute of Technology (KIT), Karlsruhe, Germany Email: {sanders, christian.schulz}@kit.edu

Source URL: algo2.iti.kit.edu

• Graph
• Graph coloring
• Planar separator theorem
• Path decomposition
• Graph theory
• NP-complete problems
• Graph partition

Vertex Separators and low tree-width k-coloring Lectures 11 and 12, January 12 and 19, A theorem about vertex separators

Source URL: www.wisdom.weizmann.ac.il

• Outerplanar graph
• Tree decomposition
• Minor
• Graph coloring
• Graph
• Tree
• Path decomposition
• Degeneracy
• Graph theory
• Planar graphs
• Graph operations

MODELING OF KINETICS OF MACROCHANNELING OF FAST ELECTRONS AND IONS IN PLANAR GAP COLLIMATORS S.V. Dyuldya∗, M.I. Bratchenko, M.A. Skorobogatov National Science Center ”Kharkov Institute of Physics and Technology”,

Source URL: vant.kipt.kharkov.ua

• Electron
• Scattering
• Reflection
• Backscatter
• Transparency and translucency
• Rutherford scattering
• Angle of incidence
• Specular reflection
• Quantum reflection
• Physics
• Optics
• Geometrical optics

On Touching Triangle Graphs Emden R. Gansner1 , Yifan Hu1 , and Stephen G. Kobourov2 1 AT&T Labs - Research, Florham Park, NJ 2

Source URL: www.research.att.com

• Neighbourhood
• Chordal graph
• Graph
• Path decomposition
• Pancyclic graph
• Graph theory
• Planar graphs
• Outerplanar graph

6.889 — Lecture 15: Traveling Salesman (TSP) Christian Sommer (figures by Philip Klein) November 2, 2011 Traveling Salesman Problem (TSP) given G = (V, E) find a tour visiting each1 node v ∈ V . NP–har

Source URL: courses.csail.mit.edu

• Spanning tree
• NP-complete problems
• Operations research
• Travelling salesman problem
• Graph operations
• Minimum spanning tree
• Graph
• Planar graph
• Eulerian path
• Graph theory
• Theoretical computer science
• Mathematics