Sciweavers

3874 search results - page 668 / 775
» Approximation Algorithms for k-hurdle Problems
Sort
View
WSCG
2003
177views more  WSCG 2003»
15 years 4 months ago
Efficient NURBS Rendering using View-Dependent LOD and Normal Maps
Rendering large trimmed NURBS models with high quality at interactive frame rates is of great interest for industry, since nearly all their models are designed on the basis of thi...
Michael Guthe, Reinhard Klein
139
Voted
COLING
1996
15 years 4 months ago
Learning Dependencies between Case Frame Slots
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...
Hang Li, Naoki Abe
124
Voted
GECCO
2008
Springer
192views Optimization» more  GECCO 2008»
15 years 4 months ago
Non-linear factor model for asset selection using multi objective genetic programming
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...
Ghada Hassan
EOR
2008
78views more  EOR 2008»
15 years 3 months ago
Maximizing throughput in queueing networks with limited flexibility
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...
Douglas G. Down, George Karakostas
155
Voted
IJACT
2008
158views more  IJACT 2008»
15 years 3 months ago
Efficient lattice-based signature scheme
: 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...
Thomas Plantard, Willy Susilo, Khin Than Win, Qion...