Sciweavers

761 search results - page 56 / 153
» Efficient Approximation Algorithms for the Subset-Sums Equal...
Sort
View
KDD
2008
ACM
104views Data Mining» more  KDD 2008»
16 years 3 months ago
Succinct summarization of transactional databases: an overlapped hyperrectangle scheme
Transactional data are ubiquitous. Several methods, including frequent itemsets mining and co-clustering, have been proposed to analyze transactional databases. In this work, we p...
Yang Xiang, Ruoming Jin, David Fuhry, Feodor F. Dr...
SPAA
2009
ACM
16 years 4 months ago
Brief announcement: parameterized maximum and average degree approximation in topic-based publish-subscribe overlay network desi
Designing an overlay network for publish/subscribe communication in a system where nodes may subscribe to many different topics of interest is of fundamental importance. For scala...
Melih Onus, Andréa W. Richa
123
Voted
HEURISTICS
2008
124views more  HEURISTICS 2008»
15 years 3 months ago
A variable neighborhood search for the capacitated arc routing problem with intermediate facilities
In this talk we present a unified Variable Neighborhood Search (VNS) algorithm for the Capacitated Arc Routing Problem (CARP) and some of its variants - the Capacitated Arc Routin...
Michael Polacek, Karl F. Doerner, Richard F. Hartl...
147
Voted
DAC
2008
ACM
15 years 5 months ago
DeMOR: decentralized model order reduction of linear networks with massive ports
Model order reduction is an efficient technique to reduce the system complexity while producing a good approximation of the input-output behavior. However, the efficiency of reduc...
Boyuan Yan, Lingfei Zhou, Sheldon X.-D. Tan, Jie C...
IOR
2010
71views more  IOR 2010»
15 years 22 days ago
Stochastic Root Finding and Efficient Estimation of Convex Risk Measures
Reliable risk measurement is a key problem for financial institutions and regulatory authorities. The current industry standard Value-at-Risk has several deficiencies. Improved ri...
Jörn Dunkel, Stefan Weber