Sciweavers

6102 search results - page 321 / 1221
» Generating Optimizing Specializers
Sort
View
133
Voted
COLT
2005
Springer
15 years 9 months ago
General Polynomial Time Decomposition Algorithms
We present a general decomposition algorithm that is uniformly applicable to every (suitably normalized) instance of Convex Quadratic Optimization and efficiently approaches an o...
Nikolas List, Hans-Ulrich Simon
118
Voted
SIGMOD
2003
ACM
105views Database» more  SIGMOD 2003»
16 years 3 months ago
Factorizing Complex Predicates in Queries to Exploit Indexes
Decision-support applications generate queries with complex predicates. We show how the factorization of complex query expressions exposes significant opportunities for exploiting...
Surajit Chaudhuri, Prasanna Ganesan, Sunita Sarawa...
152
Voted
LION
2009
Springer
152views Optimization» more  LION 2009»
15 years 10 months ago
Comparison of Coarsening Schemes for Multilevel Graph Partitioning
Graph partitioning is a well-known optimization problem of great interest in theoretical and applied studies. Since the 1990s, many multilevel schemes have been introduced as a pra...
Cédric Chevalier, Ilya Safro
104
Voted
GECCO
1999
Springer
105views Optimization» more  GECCO 1999»
15 years 7 months ago
Linkage Information Processing In Distribution Estimation Algorithms
The last few years there has been an increasing amount of interest in the eld of distribution estimation optimization algorithms. As more techniques are introduced, the variety in...
Peter A. N. Bosman, Dirk Thierens
141
Voted
JAIR
2008
136views more  JAIR 2008»
15 years 3 months ago
Global Inference for Sentence Compression: An Integer Linear Programming Approach
Sentence compression holds promise for many applications ranging from summarization to subtitle generation. Our work views sentence compression as an optimization problem and uses...
James Clarke, Mirella Lapata