Sciweavers

1986 search results - page 242 / 398
» Path Separability of Graphs
Sort
View
128
Voted
TVCG
2012
185views Hardware» more  TVCG 2012»
13 years 6 months ago
Interest Driven Navigation in Visualization
—This paper describes a new method to explore and discover within a large data set. We apply techniques from preference elicitation to automatically identify data elements that a...
Christopher G. Healey, Brent M. Dennis
124
Voted
TAP
2008
Springer
102views Hardware» more  TAP 2008»
15 years 3 months ago
Visualizing graphs in three dimensions
It has been known for some time that larger graphs can be interpreted if laid out in 3D and displayed with stereo and/or motion depth cues to support spatial perception. However, ...
Colin Ware, Peter Mitchell
138
Voted
IAT
2005
IEEE
15 years 9 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...
SIAMDM
2008
50views more  SIAMDM 2008»
15 years 3 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
114
Voted
CORR
2011
Springer
165views Education» more  CORR 2011»
14 years 7 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