Sciweavers

1819 search results - page 14 / 364
» Computability and Representations of the Zero Set
Sort
View
JUCS
2006
87views more  JUCS 2006»
13 years 8 months ago
Eliminating Redundant Join-Set Computations in Static Single Assignment
: The seminal algorithm developed by Ron Cytron, Jeanne Ferrante and colleagues in 1989 for the placement of -nodes in a control flow graph is still widely used in commercial compi...
Angela French, José Nelson Amaral
IJCV
2006
164views more  IJCV 2006»
13 years 8 months ago
Stochastic Motion and the Level Set Method in Computer Vision: Stochastic Active Contours
Based on recent work on Stochastic Partial Differential Equations (SPDEs), this paper presents a simple and well-founded method to implement the stochastic evolution of a curve. F...
Olivier Juan, Renaud Keriven, Gheorghe Postelnicu
BMVC
2010
13 years 6 months ago
Recognition from Appearance Subspaces across Image Sets of Variable Scale
Linear subspace representations of appearance variation are pervasive in computer vision. In this paper we address the problem of robustly matching them (computing the similarity ...
Ognjen Arandjelovic
TRS
2008
13 years 8 months ago
The Neurophysiological Bases of Cognitive Computation Using Rough Set Theory
A popular view is that the brain works in a similar way to a digital computer or a Universal Turing Machine by processing symbols. Psychophysical experiments and our amazing capabi...
Andrzej W. Przybyszewski
LPNMR
1997
Springer
14 years 26 days ago
Computing Non-Ground Representations of Stable Models
Turi [20] introduced the important notion of a constrained atom: an atom with associated equality and disequality constraints on its arguments. A set of constrained atoms is a cons...
Thomas Eiter, James J. Lu, V. S. Subrahmanian