Sciweavers

1115 search results - page 127 / 223
» Separating Shape Graphs
Sort
View
129
Voted
IAT
2005
IEEE
15 years 8 months ago
Decomposition Techniques for a Loosely-Coupled Resource Allocation Problem
We are interested by contributing to stochastic problems of which the main distinction is that some tasks may create other tasks. In particular, we present a first approach which...
Pierrick Plamondon, Brahim Chaib-draa, Abder Rezak...
119
Voted
FCT
1995
Springer
15 years 6 months ago
Fast Algorithms for Maintaining Shortest Paths in Outerplanar and Planar Digraphs
Abstract. We present algorithms for maintaining shortest path information in dynamic outerplanar digraphs with sublogarithmic query time. By choosing appropriate parameters we achi...
Hristo Djidjev, Grammati E. Pantziou, Christos D. ...
SIAMDM
2008
50views more  SIAMDM 2008»
15 years 2 months ago
Real Number Channel Assignments for Lattices
We consider the problem of assigning a numerical channel to each transmitter in a large regular array such that multiple levels of interference, which depend on the distance betwe...
Jerrold R. Griggs, Xiaohua Teresa Jin
CORR
2011
Springer
165views Education» more  CORR 2011»
14 years 6 months ago
Data Base Mappings and Theory of Sketches
In this paper we will present the two basic operations for database schemas used in database mapping systems (separation and Data Federation), and we will explain why the functoria...
Zoran Majkic
CVPR
2006
IEEE
16 years 4 months ago
Modeling Age Progression in Young Faces
We propose a craniofacial growth model that characterizes growth related shape variations observed in human faces during formative years. The model draws inspiration from the `rev...
Narayanan Ramanathan, Rama Chellappa