Sciweavers

650 search results - page 49 / 130
» Positive graphs
Sort
View
WWW
2009
ACM
14 years 12 months ago
Fast dynamic reranking in large graphs
In this paper we consider the problem of re-ranking search results by incorporating user feedback. We present a graph theoretic measure for discriminating irrelevant results from ...
Purnamrita Sarkar, Andrew W. Moore
TVCG
2011
171views more  TVCG 2011»
13 years 6 months ago
Animation, Small Multiples, and the Effect of Mental Map Preservation in Dynamic Graphs
—In this paper, we present the results of a human computer interaction experiment that compared the performance of the animation of dynamic graphs to the presentation of small mu...
Daniel Archambault, Helen C. Purchase, Bruno Pinau...
SIGECOM
2005
ACM
92views ECommerce» more  SIGECOM 2005»
14 years 4 months ago
True costs of cheap labor are hard to measure: edge deletion and VCG payments in graphs
We address the problem of lowering the buyer’s expected payments in shortest path auctions, where the buyer’s goal is to purchase a path in a graph in which edges are owned by...
Edith Elkind
CORR
2008
Springer
154views Education» more  CORR 2008»
13 years 11 months ago
Best-Effort Strategies for Losing States
We consider games played on finite graphs, whose goal is to obtain a trace belonging to a given set of winning traces. We focus on those states from which Player 1 cannot force a w...
Marco Faella
OSDI
2006
ACM
14 years 11 months ago
Securing Software by Enforcing Data-flow Integrity
Software attacks often subvert the intended data-flow in a vulnerable program. For example, attackers exploit buffer overflows and format string vulnerabilities to write data to u...
Manuel Costa, Miguel Castro, Timothy L. Harris