Sciweavers

17 search results - page 2 / 4
» Explicit construction of a small epsilon-net for linear thre...
Sort
View
CDC
2008
IEEE
147views Control Systems» more  CDC 2008»
13 years 11 months ago
Applications of the general Lyapunov ISS small-gain theorem for networks
Abstract— In the framework of the ISS Lyapunov formulation a small gain theorem has recently been proved which allows the explicit construction of Lyapunov functions for intercon...
Sergey Dashkovskiy, Björn Rüffer, Fabian...
ICPR
2006
IEEE
14 years 5 months ago
A Minimum Sphere Covering Approach to Pattern Classification
In this paper we present a minimum sphere covering approach to pattern classification that seeks to construct a minimum number of spheres to represent the training data and formul...
Jigang Wang, Predrag Neskovic, Leon N. Cooper
RSA
2008
81views more  RSA 2008»
13 years 4 months ago
Analyzing linear mergers
Mergers are functions that transform k (possibly dependent) random sources into a single random source, in a way that ensures that if one of the input sources has minentropy rate ...
Zeev Dvir, Ran Raz
KDD
2006
ACM
213views Data Mining» more  KDD 2006»
14 years 5 months ago
Learning sparse metrics via linear programming
Calculation of object similarity, for example through a distance function, is a common part of data mining and machine learning algorithms. This calculation is crucial for efficie...
Glenn Fung, Rómer Rosales
WSDM
2012
ACM
254views Data Mining» more  WSDM 2012»
12 years 11 days ago
Maximizing product adoption in social networks
One of the key objectives of viral marketing is to identify a small set of users in a social network, who when convinced to adopt a product will influence others in the network l...
Smriti Bhagat, Amit Goyal 0002, Laks V. S. Lakshma...