Sciweavers

355 search results - page 22 / 71
» A New Approximation Technique for Resource-Allocation Proble...
Sort
View
ICML
2009
IEEE
16 years 19 days ago
Polyhedral outer approximations with application to natural language parsing
Recent approaches to learning structured predictors often require approximate inference for tractability; yet its effects on the learned model are unclear. Meanwhile, most learnin...
André F. T. Martins, Noah A. Smith, Eric P....
SODA
1997
ACM
93views Algorithms» more  SODA 1997»
15 years 1 months ago
Fast Approximate Graph Partitioning Algorithms
We study graph partitioning problems on graphs with edge capacities and vertex weights. The problems of b-balanced cuts and k-balanced partitions are unified into a new problem ca...
Guy Even, Joseph Naor, Satish Rao, Baruch Schieber
SODA
2010
ACM
202views Algorithms» more  SODA 2010»
15 years 9 months ago
Counting Inversions, Offline Orthogonal Range Counting, and Related Problems
We give an O(n lg n)-time algorithm for counting the number of inversions in a permutation on n elements. This improves a long-standing previous bound of O(n lg n/ lg lg n) that ...
Timothy M. Chan, Mihai Patrascu
IMR
2003
Springer
15 years 5 months ago
Multilevel Accelerated Optimization for Problems in Grid Generation
The quality of numerical simulations of processes that are modeled by partial differential equations strongly depends on the quality of the mesh that is used for their discretiza...
Markus Berndt, Mikhail J. Shashkov
DAC
2009
ACM
16 years 24 days ago
A fully polynomial time approximation scheme for timing driven minimum cost buffer insertion
As VLSI technology enters the nanoscale regime, interconnect delay has become the bottleneck of the circuit timing. As one of the most powerful techniques for interconnect optimiz...
Shiyan Hu, Zhuo Li, Charles J. Alpert