Sciweavers

2080 search results - page 90 / 416
» Measuring empirical computational complexity
Sort
View
INTERACTION
2009
ACM
15 years 6 months ago
A binary method for fast computation of inter and intra cluster similarities for combining multiple clusterings
In this paper, we introduce a novel binary method for fast computation of an objective function to measure inter and intra class similarities, which is used for combining multiple...
Selim Mimaroglu, A. Murat Yagci
IJCAI
2003
15 years 1 months ago
Taming Decentralized POMDPs: Towards Efficient Policy Computation for Multiagent Settings
The problem of deriving joint policies for a group of agents that maximize some joint reward function can be modeled as a decentralized partially observable Markov decision proces...
Ranjit Nair, Milind Tambe, Makoto Yokoo, David V. ...
AIHC
2007
Springer
15 years 3 months ago
Foundations of Human Computing: Facial Expression and Emotion
Many people believe that emotions and subjective feelings are one and the same and that a goal of human-centered computing is emotion recognition. The first belief is outdated; the...
Jeffrey F. Cohn
CMG
2008
15 years 1 months ago
Computing Missing Service Demand Parameters for Performance Models
One of the challenges in building analytic performance models such as queuing network models is obtaining service demands for the various workloads and various devices. While some...
Daniel A. Menascé
IPPS
2009
IEEE
15 years 6 months ago
On the complexity of mapping pipelined filtering services on heterogeneous platforms
In this paper, we explore the problem of mapping filtering services on large-scale heterogeneous platforms. Two important optimization criteria should be considered in such a fra...
Anne Benoit, Fanny Dufossé, Yves Robert