Sciweavers

16430 search results - page 787 / 3286
» On Computable Tree Functions
Sort
View
MICCAI
2005
Springer
16 years 8 months ago
A Physical Model for DT-MRI Based Connectivity Map Computation
In this study we address the problem of extracting a robust connectivity metric for brain white matter. We defined the connectivity problem as an energy minimization task, by assoc...
Burak Acar, Erdem Yörük, Roland Bammer
ASIACRYPT
2005
Springer
16 years 1 months ago
Gate Evaluation Secret Sharing and Secure One-Round Two-Party Computation
We propose Gate Evaluation Secret Sharing (GESS) – a new kind of secret sharing, designed for use in secure function evaluation (SFE) with minimal interaction. The resulting simp...
Vladimir Kolesnikov
ISSAC
2005
Springer
101views Mathematics» more  ISSAC 2005»
16 years 1 months ago
Adherence is better than adjacency: computing the Riemann index using CAD
Given an elementary function with algebraic branch cuts, we show how to decide which sheet of the associated Riemann surface we are on at any given point. We do this by establishi...
James C. Beaumont, Russell J. Bradford, James H. D...
SIGOPSE
1994
ACM
15 years 11 months ago
Application-Aware Adaptation for Mobile Computing
This paper identifies application-aware adaptation as an essential capability of mobile clients, and provides an overview of Odyssey, an architecture that supports this capability...
Mahadev Satyanarayanan, Brian Noble, Puneet Kumar,...
HCI
2007
15 years 9 months ago
Kalman Filtering in the Design of Eye-Gaze-Guided Computer Interfaces
Abstract. In this paper, we design an Attention Focus Kalman Filter (AFKF) a framework that offers interaction capabilities by constructing an eyemovement language, provides real-t...
Oleg Komogortsev, Javed I. Khan