Sciweavers

2040 search results - page 242 / 408
» Approximate Expectation Maximization
Sort
View
110
Voted
SIAMJO
2010
136views more  SIAMJO 2010»
14 years 10 months ago
A New Exchange Method for Convex Semi-Infinite Programming
In this paper we propose a new exchange method for solving convex semi-infinite programming (CSIP) problems. We introduce a new dropping-rule in the proposed exchange algorithm, wh...
Liping Zhang, Soon-Yi Wu, Marco A. López
137
Voted
DCOSS
2011
Springer
14 years 3 months ago
On sensor selection in linked information networks
—Sensor networks are often redundant by design; this is often done in order to achieve reliability in information processing. In many cases, the redundancy relationships between ...
Charu C. Aggarwal, Amotz Bar-Noy, Simon Shamoun
137
Voted
KDD
2009
ACM
156views Data Mining» more  KDD 2009»
16 years 4 months ago
Effective multi-label active learning for text classification
Labeling text data is quite time-consuming but essential for automatic text classification. Especially, manually creating multiple labels for each document may become impractical ...
Bishan Yang, Jian-Tao Sun, Tengjiao Wang, Zheng Ch...
WSC
2000
15 years 5 months ago
Analyzing transformation-based simulation metamodels
We present a technique for analyzing a simulation metamodel that has been constructed using a variancestabilizing transformation. To compute a valid confidence interval for the ex...
Maria de los A. Irizarry, Michael E. Kuhl, Emily K...
142
Voted
ALGORITHMICA
2000
161views more  ALGORITHMICA 2000»
15 years 3 months ago
Binary Searching with Nonuniform Costs and Its Application to Text Retrieval
We study the problem of minimizing the expected cost of binary searching for data where the access cost is not fixed and depends on the last accessed element, such as data stored i...
Gonzalo Navarro, Ricardo A. Baeza-Yates, Eduardo F...