Sciweavers

1986 search results - page 270 / 398
» Path Separability of Graphs
Sort
View
SIGGRAPH
1998
ACM
15 years 6 months ago
A Beam Tracing Approach to Acoustic Modeling for Interactive Virtual Environments
Virtual environment research has focused on interactive image generation and has largely ignored acoustic modeling for spatialization of sound. Yet, realistic auditory cues can co...
Thomas A. Funkhouser, Ingrid Carlbom, Gary Elko, G...
120
Voted
TON
2008
119views more  TON 2008»
15 years 2 months ago
Polynomial time approximation algorithms for multi-constrained QoS routing
We study the multi-constrained Quality-of-Service (QoS) routing problem where one seeks to find a path from a source to a destination in the presence of K 2 additive end-to-end Qo...
Guoliang Xue, Weiyi Zhang, Jian Tang, Krishnaiyan ...
151
Voted
ECCB
2005
IEEE
15 years 8 months ago
A query language for biological networks
Many areas of modern biology are concerned with the management, storage, visualization, comparison, and analysis of networks. For instance, networks are used to model signal trans...
Ulf Leser
AAMAS
2005
Springer
15 years 8 months ago
Towards Adaptive Role Selection for Behavior-Based Agents
This paper presents a model for adaptive agents. The model describes the behavior of an agent as a graph of roles, in short a behavior graph. Links between roles provide conditions...
Danny Weyns, Kurt Schelfthout, Tom Holvoet, Olivie...
APPROX
2004
Springer
135views Algorithms» more  APPROX 2004»
15 years 8 months ago
The Diameter of Randomly Perturbed Digraphs and Some Applications.
The central observation of this paper is that if ǫn random arcs are added to any n-node strongly connected digraph with bounded degree then the resulting graph has diameter O(ln ...
Abraham Flaxman, Alan M. Frieze