Sciweavers

6142 search results - page 501 / 1229
» The Complexity of Partition Functions
Sort
View
CVPR
2012
IEEE
13 years 9 months ago
Unsupervised co-segmentation through region matching
Co-segmentation is defined as jointly partitioning multiple images depicting the same or similar object, into foreground and background. Our method consists of a multiplescale mu...
José C. Rubio, Joan Serrat, Antonio M. L&oa...
CDC
2008
IEEE
228views Control Systems» more  CDC 2008»
16 years 1 months ago
Stability analysis for neural networks with time-varying delay
— This paper studies the problem of stability analysis for neural networks (NNs) with a time-varying delay. The activation functions are assumed to be neither monotonic, nor diff...
Xun-Lin Zhu, Guang-Hong Yang
ISVC
2007
Springer
16 years 1 months ago
A New Set of Normalized Geometric Moments Based on Schlick's Approximation
Schlick’s approximation of the term xp is used primarily to reduce the complexity of specular lighting calculations in graphics applications. Since moment functions have a kernel...
Ramakrishnan Mukundan
IAT
2006
IEEE
16 years 29 days ago
Dynamic Service Composition and Selection through an Agent Interaction Protocol
This paper addresses the dynamic service selection and composition issues for the satisfaction of user requirements. We propose an approach in which agents perform service composi...
Yasmine Charif-Djebbar, Nicolas Sabouret
ICWE
2005
Springer
16 years 13 days ago
Modelling Adaptivity with Aspects
Modelling adaptive Web applications is a difficult and complex task. Usually, the development of general system functionality and context adaptation is intertwined. However, adapt...
Hubert Baumeister, Alexander Knapp, Nora Koch, Gef...