3894 search results - page 675 / 779 » Approximation Algorithms for Biclustering Problems |
135
click to vote
COLING
1996
15 years 4 months ago
1996
We address the problem of automatically acquiring case frame patterns (selectional patterns) from large corpus data. In particular, we l)ropose a method of learning dependencies b...
122
click to vote
GECCO
2008
Springer
15 years 4 months ago
2008
Springer
Investors vary with respect to their expected return and aversion to associated risk, and hence also vary in their performance expectations of the stock market portfolios they hol...
121
click to vote
EOR
2008
15 years 3 months ago
2008
We study a queueing network where customers go through several stages of processing, with the class of a customer used to indicate the stage of processing. The customers are servic...
153
click to vote
IJACT
2008
15 years 3 months ago
2008
: In Crypto 1997, Goldreich, Goldwasser and Halevi (GGH) proposed a lattice analogue of McEliece public key cryptosystem, in which security is related to the hardness of approximat...
115
click to vote
SIAMSC
2008
15 years 3 months ago
2008
Abstract. We present a new derivative-free algorithm, ORBIT, for unconstrained local optimization of computationally expensive functions. A trust-region framework using interpolati...