16430 search results - page 523 / 3286 » On Computable Tree Functions |
144
click to vote
STACS
2000
Springer
15 years 10 months ago
2000
Springer
The k-server problem is one of the most fundamental online problems. The problem is to schedule k mobile servers to visit a sequence of points in a metric space with minimum total...
167
click to vote
BILDMED
2009
15 years 8 months ago
2009
We present an approach for adapted transfer function (TF) specification to highlight pathologic changes of the coronary artery vessel wall based on contrast medium-enhanced compute...
190
click to vote
CAGD
2005
15 years 7 months ago
2005
Morin and Goldman [Computer Aided Geometric Design 17 (2000) 813] have recently presented a remarkable new framework, based on employing Poisson series, for describing analytic fu...
187
click to vote
CASC
2010
Springer
15 years 6 months ago
2010
Springer
Convexity is an important property in nonlinear optimization since it allows to apply efficient local methods for finding global solutions. We propose to apply symbolic methods t...
171
click to vote
NAACL
2010
15 years 5 months ago
2010
We treat the text summarization problem as maximizing a submodular function under a budget constraint. We show, both theoretically and empirically, a modified greedy algorithm can...