We discuss the privacy issues related to the design of systems that disclose information about emotions to remote acquaintances, without simultaneous communication: users do not ch...
Hartigan's method for k-means clustering is the following greedy heuristic: select a point, and optimally reassign it. This paper develops two other formulations of the heuri...
We study a general online convex optimization problem. We have a convex set S and an unknown sequence of cost functions c1, c2, . . . , and in each period, we choose a feasible po...
Abraham Flaxman, Adam Tauman Kalai, H. Brendan McM...
High quality, artifact-free fitting a bathymetry (sea-floor) surface to very unevenly spaced depth data from ship tracklines is possible with ODETLAP (Overdetermined Laplacian Par...
Tsz-Yam Lau, W. Randolph Franklin, You Li, Zhongyi...
Werner A. K?nig HCI-Group, University of Konstanz Box-D73, Universit?t Konstanz 78457 Konstanz, Germany werner.koenig@uni-konstanz.de Jens Gerken HCI-Group, University of Konstanz ...
Harald Reiterer, Jens Gerken, Stefan Dierdorf, Wer...