Sciweavers

2693 search results - page 15 / 539
» On Computing Complex Navigation Functions
Sort
View
CCA
2005
Springer
13 years 11 months ago
Computable Versions of Basic Theorems in Functional Analysis
If one wishes to find out whether a computational problem over discrete data is solvable or how complex it is, the classical approach is to represent the discrete objects in quest...
Atsushi Yoshikawa, Mariko Yasugi
FSTTCS
2009
Springer
14 years 4 months ago
Non-Local Box Complexity and Secure Function Evaluation
ABSTRACT. A non-local box is an abstract device into which Alice and Bob input bits x and y respectively and receive outputs a and b respectively, where a, b are uniformly distribu...
Marc Kaplan, Iordanis Kerenidis, Sophie Laplante, ...
COSIT
2003
Springer
132views GIS» more  COSIT 2003»
14 years 3 months ago
"Simplest" Paths: Automated Route Selection for Navigation
Numerous cognitive studies have indicated that the form and complexity of route instructions may be as important to human navigators as the overall length of route. Most automated ...
Matt Duckham, Lars Kulik
ECCV
2010
Springer
14 years 3 months ago
Optimizing Complex Loss Functions in Structured Prediction
Abstract. In this paper we develop an algorithm for structured prediction that optimizes against complex performance measures, those which are a function of false positive and fals...
IPPS
2002
IEEE
14 years 2 months ago
A Framework for Using Benefit Functions In Complex Real Time Systems
Researchers are currently investigating applying benefit, or utility functions for allocating resources in limited, soft real time systems [1,2,3]. While the future of real -time ...
David L. Andrews, Lonnie R. Welch, David M. Chelbe...