Sciweavers

8838 search results - page 84 / 1768
» Generalizing Domain Theory
Sort
View
NETWORKS
2006
15 years 3 months ago
A bidirected generalization of network matrices
We define binet matrices, which furnish a direct generalization of totally unimodular network matrices and arise from the node-edge incidence matrices of bidirected graphs in the ...
Gautam Appa, Balázs Kotnyek
MIR
2010
ACM
179views Multimedia» more  MIR 2010»
15 years 2 months ago
Speculation on the generality of the backward stepwise view of PCA
A novel backwards viewpoint of Principal Component Analysis is proposed. In a wide variety of cases, that fall into the area of Object Oriented Data Analysis, this viewpoint is se...
J. S. Marron, Sungkyu Jung, Ian L. Dryden
JUCS
2010
133views more  JUCS 2010»
14 years 10 months ago
From Computing Sets of Optima, Pareto Sets, and Sets of Nash Equilibria to General Decision-Related Set Computations
: Several algorithms have been proposed to compute sets of optima, Pareto sets, and sets of Nash equilibria. In this paper, we present a general algorithm for decision-related set ...
Vladik Kreinovich, Bartlomiej Jacek Kubica
FORMATS
2006
Springer
15 years 7 months ago
Concurrent Semantics Without the Notions of State or State Transitions
This paper argues that basing the semantics of concurrent systems on the notions of state and state transitions is neither advisable nor necessary. The tendency to do this is deepl...
Edward A. Lee
ISIPTA
2005
IEEE
130views Mathematics» more  ISIPTA 2005»
15 years 9 months ago
No Double Counting Semantics for Conditional Independence
The main goal of this paper is to describe a new semantic for conditional independence in terms of no double counting of uncertain evidence. For ease of exposition, we use probabi...
Prakash P. Shenoy