Sciweavers

499 search results - page 17 / 100
» Why neighbor-joining works
Sort
View
CSCW
2008
ACM
13 years 11 months ago
The computational geowiki: what, why, and how
Google Maps and its spin-offs are highly successful, but they have a major limitation: users see only pictures of geographic data. These data are inaccessible except by limited ve...
Reid Priedhorsky, Loren G. Terveen
MANSCI
2010
104views more  MANSCI 2010»
13 years 8 months ago
Valuing Money and Things: Why a $20 Item Can Be Worth More and Less Than $20
The study of risky decision-making has long used monetary gambles to study choice, but many everyday decisions do not involve the prospect of winning or losing money. Monetary gam...
A. Peter McGraw, Eldar Shafir, Alexander Todorov
MST
2010
98views more  MST 2010»
13 years 8 months ago
Why Almost All k-Colorable Graphs Are Easy to Color
Coloring a k-colorable graph using k colors (k ≥ 3) is a notoriously hard problem. Considering average case analysis allows for better results. In this work we consider the unif...
Amin Coja-Oghlan, Michael Krivelevich, Dan Vilench...
QUESTA
2010
107views more  QUESTA 2010»
13 years 8 months ago
On the inapproximability of M/G/K: why two moments of job size distribution are not enough
The M/G/K queueing system is one of the oldest model for multi-server systems, and has been the topic of performance papers for almost half a century. However, even now, only coar...
Varun Gupta, Mor Harchol-Balter, J. G. Dai, Bert Z...
SIGOPS
2010
91views more  SIGOPS 2010»
13 years 8 months ago
Why panic()?: improving reliability with restartable file systems
The file system is one of the most critical components of the operating system. Almost all applications running in the operating system require file systems to be available for ...
Swaminathan Sundararaman, Sriram Subramanian, Abhi...