Sciweavers

5550 search results - page 1019 / 1110
» Different Approaches to Proof Systems
Sort
View
JSA
2000
115views more  JSA 2000»
15 years 6 months ago
Scheduling optimization through iterative refinement
Scheduling DAGs with communication times is the theoretical basis for achieving efficient parallelism on distributed memory systems. We generalize Graham's task-level in a ma...
Mayez A. Al-Mouhamed, Adel Al-Massarani
IJAR
2002
102views more  IJAR 2002»
15 years 6 months ago
Networks of probabilistic events in discrete time
The usual methods of applying Bayesian networks to the modeling of temporal processes, such as Dean and Kanazawa's dynamic Bayesian networks (DBNs), consist in discretizing t...
Severino F. Galán, Francisco Javier D&iacut...
KI
2002
Springer
15 years 6 months ago
Formal Properties of Constraint Calculi for Qualitative Spatial Reasoning
In the previous two decades, a number of qualitative constraint calculi have been developed, which are used to represent and reason about spatial configurations. A common property...
Bernhard Nebel, Alexander Scivos
ICMLA
2009
15 years 4 months ago
Regularizing the Local Similarity Discriminant Analysis Classifier
Abstract--We investigate parameter-based and distributionbased approaches to regularizing the generative, similarity-based classifier called local similarity discriminant analysis ...
Luca Cazzanti, Maya R. Gupta
CVPR
2007
IEEE
16 years 8 months ago
Beyond bottom-up: Incorporating task-dependent influences into a computational model of spatial attention
A critical function in both machine vision and biological vision systems is attentional selection of scene regions worthy of further analysis by higher-level processes such as obj...
Robert J. Peters, Laurent Itti
« Prev « First page 1019 / 1110 Last » Next »