4155 search results - page 90 / 831 » Topic-Specific Optimization and Structuring |
145
Voted
ISSAC
2007
Springer
16 years 16 days ago
2007
Springer
Approximate symbolic computation problems can be formulated as constrained or unconstrained optimization problems, for example: GCD [3, 8, 12, 13, 23], factorization [5, 10], and ...
166
click to vote
BIOINFORMATICS
2008
15 years 6 months ago
2008
Motivation: For many biotechnological purposes, it is desirable to redesign proteins to be more structurally and functionally stable at higher temperatures. For example, chemical ...
139
click to vote
MST
2006
15 years 6 months ago
2006
An array of n distinct keys can be sorted for logarithmic searching or can be organized as a heap for logarithmic updating, but it is unclear how to attain logarithmic time for bo...
157
click to vote
ALGORITHMICA
2005
15 years 6 months ago
2005
A new form of optimality for comparison based static dictionaries is introduced. This type of optimality, keyindependent optimality, is motivated by applications that assign key v...
183
click to vote
ACL
2012
13 years 8 months ago
2012
We present a holistic data-driven approach to image description generation, exploiting the vast amount of (noisy) parallel image data and associated natural language descriptions ...