Sciweavers

3657 search results - page 374 / 732
» A Study of Practical Deduplication
Sort
View
CHI
2001
ACM
16 years 7 months ago
Scale effects in steering law tasks
Interaction tasks on a computer screen can technically be scaled to a much larger or much smaller sized input control area by adjusting the input device's control gain or the...
Johnny Accot, Shumin Zhai
CHI
2001
ACM
16 years 7 months ago
Optimizing search by showing results in context
We developed and evaluated seven interfaces for integrating semantic category information with Web search results. List interfaces were based on the familiar ranked-listing of sea...
Susan T. Dumais, Edward Cutrell, Hao Chen
RECOMB
2005
Springer
16 years 7 months ago
Lower Bounds for Maximum Parsimony with Gene Order Data
Abstract. In this paper, we study lower bound techniques for branchand-bound algorithms for maximum parsimony, with a focus on gene order data. We give a simple O(n3 ) time dynamic...
Abraham Bachrach, Kevin Chen, Chris Harrelson, Rad...
STOC
2003
ACM
95views Algorithms» more  STOC 2003»
16 years 7 months ago
Random knapsack in expected polynomial time
In this paper, we present the first average-case analysis proving an expected polynomial running time for an exact algorithm for the 0/1 knapsack problem. In particular, we prove,...
René Beier, Berthold Vöcking
OSDI
2002
ACM
16 years 7 months ago
TCP Nice: A Mechanism for Background Transfers
Many distributed applications can make use of large background transfers ? transfers of data that humans are not waiting for ? to improve availability, reliability, latency or con...
Arun Venkataramani, Ravi Kokku, Michael Dahlin