Sciweavers

2239 search results - page 204 / 448
» Computing with abstract matrix structures
Sort
View
108
Voted
MP
2010
135views more  MP 2010»
15 years 2 months ago
An inexact Newton method for nonconvex equality constrained optimization
Abstract We present a matrix-free line search algorithm for large-scale equality constrained optimization that allows for inexact step computations. For sufficiently convex problem...
Richard H. Byrd, Frank E. Curtis, Jorge Nocedal
129
Voted
EGC
2009
Springer
15 years 1 months ago
Discrepancy Analysis of Complex Objects Using Dissimilarities
Abstract. In this article we consider objects for which we have a matrix of dissimilarities and we are interested in their links with covariates. We focus on state sequences for wh...
Matthias Studer, Gilbert Ritschard, Alexis Gabadin...
109
Voted
IFIPTCS
2000
15 years 7 months ago
Open Ended Systems, Dynamic Bisimulation and Tile Logic
Abstract The sos formats ensuring that bisimilarity is a congruence often fail in the presence of structural axioms on the algebra of states. Dynamic bisimulation, introduced to ch...
Roberto Bruni, Ugo Montanari, Vladimiro Sassone
128
Voted
ECCV
2010
Springer
15 years 7 months ago
Visual Tracking using a Pixelwise Spatiotemporal Oriented Energy Representation
Abstract. This paper presents a novel pixelwise representation for visual tracking that models both the spatial structure and dynamics of a target in a unified fashion. The represe...
151
Voted
BIRTHDAY
2008
Springer
15 years 4 months ago
Selection and Uniformization Problems in the Monadic Theory of Ordinals: A Survey
Abstract. A formula ψ(Y ) is a selector for a formula ϕ(Y ) in a structure M if there exists a unique Y that satisfies ψ in M and this Y also satisfies ϕ. A formula ψ(X, Y )...
Alexander Rabinovich, Amit Shomrat