Sciweavers

7015 search results - page 271 / 1403
» Approximation algorithms for co-clustering
Sort
View
JAT
2010
71views more  JAT 2010»
15 years 5 months ago
Functions with prescribed best linear approximations
A common problem in applied mathematics is that of finding a function in a Hilbert space with prescribed best approximations from a finite number of closed vector subspaces. In ...
Patrick L. Combettes, Noli N. Reyes
ASPDAC
2010
ACM
119views Hardware» more  ASPDAC 2010»
15 years 4 months ago
VISA: versatile impulse structure approximation for time-domain linear macromodeling
Abstract-- We develop a rational function macromodeling algorithm named VISA (Versatile Impulse Structure Approximation) for macromodeling of system responses with (discrete) time-...
Chi-Un Lei, Ngai Wong
AMC
2011
14 years 10 months ago
Ruin theory with excess of loss reinsurance and reinstatements
The present paper studies the probability of ruin of an insurer, if excess of loss reinsurance with reinstatements is applied. In the setting of the classical CramerLundberg risk ...
Hansjörg Albrecher, Sandra Haas
FTDB
2011
98views more  FTDB 2011»
14 years 10 months ago
Secure Distributed Data Aggregation
We present a survey of the various families of approaches to secure aggregation in distributed networks such as sensor networks. In our survey, we focus on the important algorithm...
Haowen Chan, Hsu-Chun Hsiao, Adrian Perrig, Dawn S...
JMLR
2012
13 years 9 months ago
Detecting Network Cliques with Radon Basis Pursuit
In this paper, we propose a novel formulation of the network clique detection problem by introducing a general network data representation framework. We show connections between o...
Xiaoye Jiang, Yuan Yao, Han Liu, Leonidas J. Guiba...