Sciweavers

2925 search results - page 131 / 585
» Information Complexity of Online Problems
Sort
View
FOCS
2007
IEEE
16 years 23 days ago
On the Hardness and Smoothed Complexity of Quasi-Concave Minimization
In this paper, we resolve the smoothed and approximative complexity of low-rank quasi-concave minimization, providing both upper and lower bounds. As an upper bound, we provide th...
Jonathan A. Kelner, Evdokia Nikolova
JSAC
2011
116views more  JSAC 2011»
15 years 1 months ago
Low Complexity Outage Optimal Distributed Channel Allocation for Vehicle-to-Vehicle Communications
—Due to the potential of enhancing traffic safety, protecting environment, and enabling new applications, vehicular communications, especially vehicle-to-vehicle (V2V) communica...
Bo Bai, Wei Chen, Khaled Ben Letaief, Zhigang Cao
CHI
1996
ACM
15 years 10 months ago
Email Overload: Exploring Personal Information Management of Email
Email is one of the most successful computer applications yet devised. Our empirical data show however, that although email was originally designed as a communications application...
Steve Whittaker, Candace L. Sidner
ICCV
2007
IEEE
16 years 8 months ago
Learning priors for calibrating families of stereo cameras
Online camera recalibration is necessary for long-term deployment of computer vision systems. Existing algorithms assume that the source of recalibration information is a set of f...
Andrew W. Fitzgibbon, Duncan P. Robertson, Antonio...
SIGDOC
2006
ACM
16 years 12 days ago
Why don't people read the manual?
Few users of computer applications seek help from the documentation. This paper reports the results of an empirical study of why this is so and examines how, in real work, users s...
David G. Novick, Karen Ward