Sciweavers

607 search results - page 5 / 122
» Unifying Exact Completions
Sort
View
101
Voted
ICCV
2005
IEEE
15 years 7 months ago
A Unifying Approach to Hard and Probabilistic Clustering
We derive the clustering problem from first principles showing that the goal of achieving a probabilistic, or ”hard”, multi class clustering result is equivalent to the algeb...
Ron Zass, Amnon Shashua
143
Voted
VL
2000
IEEE
115views Visual Languages» more  VL 2000»
15 years 6 months ago
SD2: A Sound and Complete Diagrammatic Reasoning System
SD2 is a system of Venn-type diagrams that can be used to reason diagrammatically about sets, their cardinalities and their relationships. They augment the systems of Venn-Peirce ...
John Howse, Fernando Molina, John Taylor
TASLP
2010
138views more  TASLP 2010»
14 years 8 months ago
Glimpsing IVA: A Framework for Overcomplete/Complete/Undercomplete Convolutive Source Separation
Abstract--Independent vector analysis (IVA) is a method for separating convolutedly mixed signals that significantly reduces the occurrence of the well-known permutation problem in...
Alireza Masnadi-Shirazi, Wenyi Zhang, Bhaskar D. R...
112
Voted
POS
2000
Springer
15 years 5 months ago
Hyper-Code Revisited: Unifying Program Source, Executable, and Data
Abstract. The technique of hyper-programming allows program representations held in a persistent store to contain embedded links to persistent code and data. In 1994, Connor et al ...
Evangelos Zirintsis, Graham N. C. Kirby, Ronald Mo...
146
Voted
LICS
2012
IEEE
13 years 4 months ago
The Complete Proof Theory of Hybrid Systems
—Hybrid systems are a fusion of continuous dynamical systems and discrete dynamical systems. They freely combine dynamical features from both worlds. For that reason, it has ofte...
André Platzer