Sciweavers

6105 search results - page 1083 / 1221
» A Parallel Algorithm for Bound-Smoothing
Sort
View
EOR
2007
104views more  EOR 2007»
15 years 6 months ago
A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem
The two-dimensional orthogonal non-guillotine cutting problem (NGCP) appears in many industries (like wood and steel industries) and consists in cutting a rectangular master surfa...
Roberto Baldacci, Marco A. Boschetti
WWW
2005
ACM
16 years 6 months ago
LSH forest: self-tuning indexes for similarity search
We consider the problem of indexing high-dimensional data for answering (approximate) similarity-search queries. Similarity indexes prove to be important in a wide variety of sett...
Mayank Bawa, Tyson Condie, Prasanna Ganesan
POPL
2009
ACM
16 years 6 months ago
The theory of deadlock avoidance via discrete control
Deadlock in multithreaded programs is an increasingly important problem as ubiquitous multicore architectures force parallelization upon an ever wider range of software. This pape...
Manjunath Kudlur, Scott A. Mahlke, Stéphane...
POPL
2006
ACM
16 years 6 months ago
Autolocker: synchronization inference for atomic sections
The movement to multi-core processors increases the need for simpler, more robust parallel programming models. Atomic sections have been widely recognized for their ease of use. T...
Bill McCloskey, Feng Zhou, David Gay, Eric A. Brew...
ICDE
2010
IEEE
248views Database» more  ICDE 2010»
16 years 5 months ago
FPGA Acceleration for the Frequent Item Problem
Abstract-- Field-programmable gate arrays (FPGAs) can provide performance advantages with a lower resource consumption (e.g., energy) than conventional CPUs. In this paper, we show...
Gustavo Alonso, Jens Teubner, René Mül...
« Prev « First page 1083 / 1221 Last » Next »