Sciweavers

1105 search results - page 153 / 221
» Linear choosability of graphs
Sort
View
IPPS
2005
IEEE
15 years 11 months ago
Optimal Channel Assignments for Lattices with Conditions at Distance Two
The problem of radio channel assignments with multiple levels of interference can be modeled using graph theory. Given a graph G, possibly infinite, and real numbers k1, k2, . . ...
Jerrold R. Griggs, Xiaohua Teresa Jin
ICAT
2003
IEEE
15 years 11 months ago
A Formalism and a Tool for Diverging Requirements in VR Scenario Modeling
Any VR scenario should offer a certain degree of nonlinearity or openness regarding the story progress as a consequence of the interaction with the user. In this paper we propose ...
Richard Wages, Benno Grützmacher, Georg Troge...
SI3D
2003
ACM
15 years 11 months ago
Interactive navigation in complex environments using path planning
We present a novel approach for interactive navigation in complex 3D synthetic environments using path planning. Our algorithm precomputes a global roadmap of the environment by u...
Brian Salomon, Maxim Garber, Ming C. Lin, Dinesh M...
ADBIS
2003
Springer
95views Database» more  ADBIS 2003»
15 years 11 months ago
Distance Join Queries of Multiple Inputs in Spatial Databases
Let a tuple of n objects obeying a query graph (QG) be called the n-tuple. The “Ddistance-value” of this n-tuple is the value of a linear function of distances of the n objects...
Antonio Corral, Yannis Manolopoulos, Yannis Theodo...
ECCV
2010
Springer
15 years 11 months ago
Weakly Supervised Shape Based Object Detection with Particle Filter
Abstract. We describe an efficient approach to construct shape models composed of contour parts with partially-supervised learning. The proposed approach can easily transfer parts ...