Sciweavers

5889 search results - page 782 / 1178
» Graph Layout Problems
Sort
View
STOC
2007
ACM
181views Algorithms» more  STOC 2007»
16 years 7 months ago
How to rank with few errors
We present a polynomial time approximation scheme (PTAS) for the minimum feedback arc set problem on tournaments. A simple weighted generalization gives a PTAS for KemenyYoung ran...
Claire Kenyon-Mathieu, Warren Schudy
STACS
2010
Springer
16 years 1 months ago
On Iterated Dominance, Matrix Elimination, and Matched Paths
We study computational problems that arise in the context of iterated dominance in anonymous games, and show that deciding whether a game can be solved by means of iterated weak d...
Felix Brandt, Felix A. Fischer, Markus Holzer
WEA
2009
Springer
111views Algorithms» more  WEA 2009»
16 years 1 months ago
A Heuristic for Fair Correlation-Aware Resource Placement
Abstract. The configuration of network resources greatly impacts the communication overhead for data intensive tasks and constitutes a critical problem in the design and maintenan...
Raouf Boutaba, Martin Karsten, Maxwell Young
RECSYS
2009
ACM
16 years 1 months ago
Recommendations with prerequisites
We consider the problem of recommending the best set of k items when there is an inherent ordering between items, expressed as a set of prerequisites (e.g., the course ‘Real Ana...
Aditya G. Parameswaran, Hector Garcia-Molina
IROS
2008
IEEE
125views Robotics» more  IROS 2008»
16 years 1 months ago
Neighborhood denoising for learning high-dimensional grasping manifolds
— Human control of high degree-of-freedom robotic systems, e.g. anthropomorphic robot hands, is often difficult due to the overwhelming number of variables that need to be speci...
Aggeliki Tsoli, Odest Chadwicke Jenkins