Sciweavers

2374 search results - page 386 / 475
» Fast Distributed Algorithms for Computing Separable Function...
Sort
View
AUTOMATICA
1999
122views more  AUTOMATICA 1999»
14 years 9 months ago
Set-valued methods for linear parameter varying systems,
We consider stability analysis and state feedback synthesis for Linear Parameter Varying (LPV) systems. LPV systems are de"ned as linear systems whose dynamics depend on exog...
Jeff S. Shamma, Dapeng Xiong
CIKM
2006
Springer
14 years 11 months ago
Efficiently clustering transactional data with weighted coverage density
In this paper, we propose a fast, memory-efficient, and scalable clustering algorithm for analyzing transactional data. Our approach has three unique features. First, we use the c...
Hua Yan, Keke Chen, Ling Liu
SIGECOM
2008
ACM
155views ECommerce» more  SIGECOM 2008»
14 years 9 months ago
Tight information-theoretic lower bounds for welfare maximization in combinatorial auctions
We provide tight information-theoretic lower bounds for the welfare maximization problem in combinatorial auctions. In this problem, the goal is to partition m items among k bidde...
Vahab S. Mirrokni, Michael Schapira, Jan Vondr&aac...
ICFP
1999
ACM
15 years 2 months ago
Type Inference Builds a Short Cut to Deforestation
Deforestation optimises a functional program by transforming it into another one that does not create certain intermediate data structures. Short cut deforestation is a deforestat...
Olaf Chitil
ICAI
2004
14 years 11 months ago
A Comparison of Resampling Methods for Clustering Ensembles
-- Combination of multiple clusterings is an important task in the area of unsupervised learning. Inspired by the success of supervised bagging algorithms, we propose a resampling ...
Behrouz Minaei-Bidgoli, Alexander P. Topchy, Willi...