Sciweavers

3937 search results - page 630 / 788
» Questioning Ubiquitous Computing
Sort
View
SAGT
2010
Springer
160views Game Theory» more  SAGT 2010»
13 years 8 months ago
How Do You Like Your Equilibrium Selection Problems? Hard, or Very Hard?
The PPAD-completeness of Nash equilibrium computation is taken as evidence that the problem is computationally hard in the worst case. This evidence is necessarily rather weak, in ...
Paul W. Goldberg
MICCAI
2003
Springer
14 years 10 months ago
Medially Based Meshing with Finite Element Analysis of Prostate Deformation
The finite element method (FEM) is well suited for use in the non-rigid registration of magnetic resonance spectroscopy images (MRSI) with intraoperative ultrasound images of the p...
Jessica R. Crouch, Stephen M. Pizer, Edward L. Cha...
CADE
2009
Springer
14 years 10 months ago
Complexity of Fractran and Productivity
Abstract. In functional programming languages the use of infinite structures is common practice. For total correctness of programs dealing with infinite structures one must guarant...
Clemens Grabmayer, Dimitri Hendriks, Jörg End...
TCC
2009
Springer
146views Cryptology» more  TCC 2009»
14 years 10 months ago
An Optimally Fair Coin Toss
We address one of the foundational problems in cryptography: the bias of coin-flipping protocols. Coin-flipping protocols allow mutually distrustful parties to generate a common u...
Tal Moran, Moni Naor, Gil Segev
KDD
2009
ACM
153views Data Mining» more  KDD 2009»
14 years 10 months ago
Predicting bounce rates in sponsored search advertisements
This paper explores an important and relatively unstudied quality measure of a sponsored search advertisement: bounce rate. The bounce rate of an ad can be informally defined as t...
D. Sculley, Robert G. Malkin, Sugato Basu, Roberto...