Sciweavers

281 search results - page 49 / 57
» On Embedding a Graph on Two Sets of Points
Sort
View
ATMOS
2007
119views Optimization» more  ATMOS 2007»
14 years 11 months ago
Models for Railway Track Allocation
The optimal track allocation problem (OPTRA) is to find, in a given railway network, a conflict free set of train routes of maximum value. We study two types of integer programmi...
Ralf Borndörfer, Thomas Schlechte
IVS
2006
127views more  IVS 2006»
14 years 9 months ago
Feature hiding in 3D human body scans
In this paper, we explore a privacy algorithm that detects human private parts in a 3D scan data set. The analogia graph is introduced to study the proportion of structures. The i...
Joseph Laws, Nathaniel Bauernfeind, Yang Cai 0002
CPC
2010
117views more  CPC 2010»
14 years 7 months ago
On the Number of Perfect Matchings in Random Lifts
Let G be a fixed connected multigraph with no loops. A random n-lift of G is obtained by replacing each vertex of G by a set of n vertices (where these sets are pairwise disjoint)...
Catherine S. Greenhill, Svante Janson, Andrzej Ruc...
WADS
2001
Springer
182views Algorithms» more  WADS 2001»
15 years 2 months ago
On the Complexity of Scheduling Conditional Real-Time Code
Abstract. Many real-time embedded systems involve a collection of independently executing event-driven code blocks, having hard real-time constraints. Portions of such codes when t...
Samarjit Chakraborty, Thomas Erlebach, Lothar Thie...
CVPR
2011
IEEE
14 years 1 months ago
Topologically-Robust 3D Shape Matching Based on Diffusion Geometry and Seed Growing
3D Shape matching is an important problem in computer vision. One of the major difficulties in finding dense correspondences between 3D shapes is related to the topological disc...
Avinash Sharma, Radu Horaud, Jan Cech, Edmond Boye...