Sciweavers

592 search results - page 98 / 119
» Individual error, group error, and the value of information
Sort
View
ICALP
2009
Springer
14 years 7 months ago
LTL Path Checking Is Efficiently Parallelizable
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
Lars Kuhtz, Bernd Finkbeiner
BMCBI
2006
85views more  BMCBI 2006»
13 years 7 months ago
On single and multiple models of protein families for the detection of remote sequence relationships
Background: The detection of relationships between a protein sequence of unknown function and a sequence whose function has been characterised enables the transfer of functional a...
James A. Casbon, Mansoor A. S. Saqi
TMI
2008
92views more  TMI 2008»
13 years 7 months ago
Using Perturbation Theory to Compute the Morphological Similarity of Diffusion Tensors
Computing the morphological similarity of diffusion tensors (DTs) at neighboring voxels within a DT image, or at corresponding locations across different DT images, is a fundamenta...
Ravi Bansal, Lawrence H. Staib, Dongrong Xu, Andre...
CVPR
2012
IEEE
11 years 9 months ago
Robust late fusion with rank minimization
In this paper, we propose a rank minimization method to fuse the predicted confidence scores of multiple models, each of which is obtained based on a certain kind of feature. Spe...
Guangnan Ye, Dong Liu, I-Hong Jhuo, Shih-Fu Chang
HICSS
2003
IEEE
207views Biometrics» more  HICSS 2003»
14 years 21 days ago
Formalizing Multi-Agent POMDP's in the context of network routing
This paper uses partially observable Markov decision processes (POMDP’s) as a basic framework for MultiAgent planning. We distinguish three perspectives: first one is that of a...
Bharaneedharan Rathnasabapathy, Piotr J. Gmytrasie...