Sciweavers

258 search results - page 40 / 52
» Weak Bisimulation Approximants
Sort
View
113
Voted
COCOS
2003
Springer
148views Optimization» more  COCOS 2003»
15 years 2 months ago
Convex Programming Methods for Global Optimization
We investigate some approaches to solving nonconvex global optimization problems by convex nonlinear programming methods. We assume that the problem becomes convex when selected va...
John N. Hooker
ECCV
2004
Springer
15 years 11 months ago
Unifying Approaches and Removing Unrealistic Assumptions in Shape from Shading: Mathematics Can Help
This article proposes a solution of the Lambertian Shape From Shading (SFS) problem by designing a new mathematical framework based on the notion of viscosity solutions. The power ...
Emmanuel Prados, Olivier D. Faugeras
CORR
2008
Springer
150views Education» more  CORR 2008»
14 years 9 months ago
A Local Mean Field Analysis of Security Investments in Networks
Getting agents in the Internet, and in networks in general, to invest in and deploy security features and protocols is a challenge, in particular because of economic reasons arisi...
Marc Lelarge, Jean Bolot
CORR
2007
Springer
124views Education» more  CORR 2007»
14 years 9 months ago
An exploratory study of Google Scholar
Purpose – This paper2 discusses the new scientific search service Google Scholar (GS). This search engine, intended for searching exclusively scholarly documents, will be descri...
Philipp Mayr, Anne-Kathrin Walter
SIAMCO
2008
108views more  SIAMCO 2008»
14 years 9 months ago
A Viability Theorem for Morphological Inclusions
The aim of this paper is to adapt the Viability Theorem from differential inclusions (governing the evolution of vectors in a finite dimensional space) to so-called morphological i...
Thomas Lorenz