727 search results - page 123 / 146 » Private approximation of search problems |
CIKM
2010
Springer
14 years 7 months ago
2010
Springer
In this paper, we study a novel problem Collective Active Learning, in which we aim to select a batch set of "informative" instances from a networking data set to query ...
168
click to vote
FCCM
2011
IEEE
14 years 1 months ago
2011
IEEE
—String matching is a ubiquitous problem that arises in a wide range of applications in computing, e.g., packet routing, intrusion detection, web querying, and genome analysis. D...
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
We introduce the Line Search A-Function (LSAF) technique that generalizes the Extended-Baum Welch technique in order to provide an effective optimization technique for a broader s...
86
Voted
IJON
2011
14 years 28 days ago
2011
, Yunde Jia Model structure selection is currently an open problem in modeling data via Gaussian Mixture Models (GMM). This paper proposes a discriminative method to select GMM st...
88
Voted
CEC
2007
IEEE
15 years 3 months ago
2007
IEEE
Abstract— Target shape design optimization problem (TSDOP) is a miniature model for real world design optimization problems. It is proposed as a test bed to design and analyze op...