: Dealing with context information is an important concern for mobile service computing. However, modern frameworks and programming languages do not directly support context-depend...
We prove that Bimatrix, the problem of finding a Nash equilibrium in a two-player game, is complete for the complexity class PPAD (Polynomial Parity Argument, Directed version)
Abstract The most difficult and time consuming activity to perform during view integration is to find correspondences between different view specifications. Such correspondences...
Ernst Ellmer, Christian Huemer, Dieter Merkl, G&uu...
This paper uses Factored Latent Analysis (FLA) to learn a factorized, segmental representation for observations of tracked objects over time. Factored Latent Analysis is latent cl...
This paper addresses the supervised learning in which the class membership of training data are subject to uncertainty. This problem is tackled in the framework of the Dempster-Sha...