Sciweavers

5100 search results - page 544 / 1020
» The Linear Complexity of a Graph
Sort
View
148
Voted
SODA
2008
ACM
93views Algorithms» more  SODA 2008»
15 years 8 months ago
Fast load balancing via bounded best response
It is known that the dynamics of best response in an environment of non-cooperative users may converge to a good solution when users play sequentially, but may cycle far away from...
Baruch Awerbuch, Yossi Azar, Rohit Khandekar
UAI
2008
15 years 8 months ago
On Identifying Total Effects in the Presence of Latent Variables and Selection bias
Assume that cause-effect relationships between variables can be described as a directed acyclic graph and the corresponding linear structural equation model We consider the identi...
Manabu Kuroki, Zhihong Cai
AAAI
2006
15 years 8 months ago
Improved Bounds for Computing Kemeny Rankings
Voting (or rank aggregation) is a general method for aggregating the preferences of multiple agents. One voting rule of particular interest is the Kemeny rule, which minimizes the...
Vincent Conitzer, Andrew J. Davenport, Jayant Kala...
214
Voted
NIPS
2004
15 years 8 months ago
Triangle Fixing Algorithms for the Metric Nearness Problem
Various problems in machine learning, databases, and statistics involve pairwise distances among a set of objects. It is often desirable for these distances to satisfy the propert...
Inderjit S. Dhillon, Suvrit Sra, Joel A. Tropp
194
Voted
SPLST
2003
15 years 8 months ago
How to Draw a Sequence Diagram
Abstract. In this paper, we consider the aesthetic criteria and constraints related to the layouts of UML sequence diagrams. We consider the applicability of the traditional graph ...
Timo Poranen, Erkki Mäkinen, Jyrki Nummenmaa