Sciweavers

2542 search results - page 9 / 509
» Computing Cartograms with Optimal Complexity
Sort
View
NAACL
2010
13 years 5 months ago
Optimal Parsing Strategies for Linear Context-Free Rewriting Systems
Factorization is the operation of transforming a production in a Linear Context-Free Rewriting System (LCFRS) into two simpler productions by factoring out a subset of the nonterm...
Daniel Gildea
DLT
2009
13 years 5 months ago
Tight Bounds on the Descriptional Complexity of Regular Expressions
Abstract. We improve on some recent results on lower bounds for conversion problems for regular expressions. In particular we consider the conversion of planar deterministic finite...
Hermann Gruber, Markus Holzer
SAC
2006
ACM
14 years 1 months ago
Service-oriented grid computation for large-scale parameter estimation in complex environmental modeling
Complex environmental modeling often involves a large number of unknown physical and ecological parameters. Parameter estimation is one of the most difficult steps in many modelin...
Kejing He, Shoubin Dong, Li Zheng
MP
2006
101views more  MP 2006»
13 years 7 months ago
Computational complexity of stochastic programming problems
Stochastic programming is the subfield of mathematical programming that considers optimization in the presence of uncertainty. During the last four decades a vast amount of litera...
Martin E. Dyer, Leen Stougie
STACS
2001
Springer
14 years 1 days ago
On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs
We consider the problem of computing an optimal range assignment in a wireless network which allows a specified source station to perform a broadcast operation. In particular, we ...
Andrea E. F. Clementi, Pierluigi Crescenzi, Paolo ...