Sciweavers

672 search results - page 54 / 135
» A General Solution to the Graph History Interaction Problem
Sort
View
DAM
2008
84views more  DAM 2008»
13 years 7 months ago
Edge-splittings preserving local edge-connectivity of graphs
Let G = (V + s, E) be a 2-edge-connected graph with a designated vertex s. A pair of edges rs, st is called admissible if splitting off these edges (replacing rs and st by rt) pre...
Zoltán Szigeti
ACMACE
2007
ACM
13 years 9 months ago
Transmedial interactions and digital games
As virtual worlds and games grow in both personal and cultural importance, present limitations in access to them is increasingly limiting their ability to achieve their potential....
Shaowen Bardzell, Vicky Wu, Jeffrey Bardzell, Nick...
ATAL
2005
Springer
14 years 1 months ago
Modeling complex multi-issue negotiations using utility graphs
This paper presents an agent strategy for complex bilateral negotiations over many issues with inter-dependent valuations. We use ideas inspired by graph theory and probabilistic ...
Valentin Robu, D. J. A. Somefun, Johannes A. La Po...
MM
2010
ACM
174views Multimedia» more  MM 2010»
13 years 7 months ago
Image classification using the web graph
Image classification is a well-studied and hard problem in computer vision. We extend a proven solution for classifying web spam to handle images. We exploit the link structure of...
Dhruv Kumar Mahajan, Malcolm Slaney
CN
2008
126views more  CN 2008»
13 years 7 months ago
Graph transformation approaches for diverse routing in shared risk resource group (SRRG) failures
Failure resilience is a desired feature of the Internet. Most traditional restoration architectures assume single-failure assumption, which is not adequate in present day WDM opti...
Pallab Datta, Arun K. Somani