Sciweavers

613 search results - page 112 / 123
» Generalized Traveling Salesman Problem Reduction Algorithms
Sort
View
CASES
2004
ACM
14 years 2 months ago
Reducing both dynamic and leakage energy consumption for hard real-time systems
While the dynamic voltage scaling (DVS) techniques are efficient in reducing the dynamic energy consumption for the processor, varying voltage alone becomes less effective for t...
Linwei Niu, Gang Quan
KDD
2007
ACM
276views Data Mining» more  KDD 2007»
14 years 9 months ago
Nonlinear adaptive distance metric learning for clustering
A good distance metric is crucial for many data mining tasks. To learn a metric in the unsupervised setting, most metric learning algorithms project observed data to a lowdimensio...
Jianhui Chen, Zheng Zhao, Jieping Ye, Huan Liu
BMCBI
2010
224views more  BMCBI 2010»
13 years 8 months ago
An adaptive optimal ensemble classifier via bagging and rank aggregation with applications to high dimensional data
Background: Generally speaking, different classifiers tend to work well for certain types of data and conversely, it is usually not known a priori which algorithm will be optimal ...
Susmita Datta, Vasyl Pihur, Somnath Datta
TSP
2008
179views more  TSP 2008»
13 years 8 months ago
Estimation in Gaussian Graphical Models Using Tractable Subgraphs: A Walk-Sum Analysis
Graphical models provide a powerful formalism for statistical signal processing. Due to their sophisticated modeling capabilities, they have found applications in a variety of fie...
V. Chandrasekaran, Jason K. Johnson, Alan S. Wills...
STOC
2000
ACM
137views Algorithms» more  STOC 2000»
14 years 6 days ago
On the complexity of verifiable secret sharing and multiparty computation
We first study the problem of doing Verifiable Secret Sharing (VSS) information theoretically secure for a general access structure. We do it in the model where private channels b...
Ronald Cramer, Ivan Damgård, Stefan Dziembow...