672 search results - page 54 / 135 » A General Solution to the Graph History Interaction Problem |
105
Voted
DAM
2008
15 years 21 days ago
2008
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...
ACMACE
2007
ACM
15 years 2 months ago
2007
ACM
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....
75
Voted
ATAL
2005
Springer
15 years 6 months ago
2005
Springer
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 ...
88
Voted
MM
2010
ACM
15 years 25 days ago
2010
ACM
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...
110
click to vote
CN
2008
15 years 21 days ago
2008
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...