Sciweavers

185 search results - page 32 / 37
» Discrete online TSP
Sort
View
WWW
2004
ACM
14 years 8 months ago
Propagation of trust and distrust
A (directed) network of people connected by ratings or trust scores, and a model for propagating those trust scores, is a fundamental building block in many of today's most s...
Ramanathan V. Guha, Ravi Kumar, Prabhakar Raghavan...
CHI
2005
ACM
14 years 7 months ago
Toward subtle intimate interfaces for mobile devices using an EMG controller
Using a mobile device in a social context should not cause embarrassment and disruption to the immediate environment. Interaction with mobile and wearable devices needs to be subt...
Enrico Costanza, Samuel A. Inverso, Rebecca Allen
STOC
2003
ACM
130views Algorithms» more  STOC 2003»
14 years 7 months ago
A tight bound on approximating arbitrary metrics by tree metrics
In this paper, we show that any n point metric space can be embedded into a distribution over dominating tree metrics such that the expected stretch of any edge is O(log n). This ...
Jittat Fakcharoenphol, Satish Rao, Kunal Talwar
OSDI
2008
ACM
14 years 7 months ago
Gadara: Dynamic Deadlock Avoidance for Multithreaded Programs
Deadlock is an increasingly pressing concern as the multicore revolution forces parallel programming upon the average programmer. Existing approaches to deadlock impose onerous bu...
Manjunath Kudlur, Scott A. Mahlke, Stéphane...
SODA
2010
ACM
202views Algorithms» more  SODA 2010»
14 years 4 months ago
Counting Inversions, Offline Orthogonal Range Counting, and Related Problems
We give an O(n lg n)-time algorithm for counting the number of inversions in a permutation on n elements. This improves a long-standing previous bound of O(n lg n/ lg lg n) that ...
Timothy M. Chan, Mihai Patrascu