Sciweavers

102 search results - page 16 / 21
» Improved Bounds for Geometric Permutations
Sort
View
WADS
2009
Springer
378views Algorithms» more  WADS 2009»
15 years 4 months ago
Two for One: Tight Approximation of 2D Bin Packing
In this paper, we study the two-dimensional geometrical bin packing problem (2DBP): given a list of rectangles, provide a packing of all these into the smallest possible number of ...
Klaus Jansen, Lars Prädel, Ulrich M. Schwarz
ICML
2009
IEEE
15 years 10 months 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....
92
Voted
IPPS
1999
IEEE
15 years 1 months ago
Reducing I/O Complexity by Simulating Coarse Grained Parallel Algorithms
Block-wise access to data is a central theme in the design of efficient external memory (EM) algorithms. A second important issue, when more than one disk is present, is fully par...
Frank K. H. A. Dehne, David A. Hutchinson, Anil Ma...
CASES
2004
ACM
15 years 2 months ago
Safely exploiting multithreaded processors to tolerate memory latency in real-time systems
A coarse-grain multithreaded processor can effectively hide long memory latencies by quickly switching to an alternate task when the active task issues a memory request, improving...
Ali El-Haj-Mahmoud, Eric Rotenberg
99
Voted
CVPR
2008
IEEE
15 years 11 months ago
Motion estimation for multi-camera systems using global optimization
We present a motion estimation algorithm for multicamera systems consisting of more than one calibrated camera securely attached on a moving object. So, they move all together, bu...
Hongdong Li, Jae-Hak Kim, Richard I. Hartley