Sciweavers

135 search results - page 15 / 27
» Properties of tree convex constraints
Sort
View
CDC
2010
IEEE
129views Control Systems» more  CDC 2010»
13 years 3 months ago
On parameterized Lyapunov and control Lyapunov functions for discrete-time systems
This paper deals with the existence and synthesis of parameterized-(control) Lyapunov functions (p-(C)LFs) for discrete-time nonlinear systems that are possibly subject to constrai...
Mircea Lazar, Rob H. Gielen
EUSFLAT
2007
152views Fuzzy Logic» more  EUSFLAT 2007»
13 years 10 months ago
The Core of Games on Distributive Lattices
Cooperative games under precedence constraints have been introduced by Faigle and Kern [1] , [4] as a generalization of classical cooperative games. An important notion in coopera...
Lijue Xie, Michel Grabisch
ICIP
1999
IEEE
14 years 10 months ago
Quadtrees for Embedded Surface Visualization: Constraints and Efficient Data Structures
The quadtree data structure is widely used in digital image processing and computer graphics for modeling spatial segmentation of images and surfaces. A quadtree is a tree in whic...
Laurent Balmelli, Jelena Kovacevic, Martin Vetterl...
ICML
2008
IEEE
14 years 9 months ago
Fast nearest neighbor retrieval for bregman divergences
We present a data structure enabling efficient nearest neighbor (NN) retrieval for bregman divergences. The family of bregman divergences includes many popular dissimilarity measu...
Lawrence Cayton
ENDM
2008
142views more  ENDM 2008»
13 years 8 months ago
Augmenting the Connectivity of Planar and Geometric Graphs
In this paper we study some connectivity augmentation problems. Given a connected graph G with some desirable property, we want to make G 2-vertex connected (or 2-edge connected) ...
Ignaz Rutter, Alexander Wolff