Sciweavers

6129 search results - page 1074 / 1226
» A parallel LLL algorithm
Sort
View
EOR
2007
104views more  EOR 2007»
13 years 9 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
CORR
2010
Springer
58views Education» more  CORR 2010»
13 years 8 months ago
Realizable Paths and the NL vs L Problem
A celebrated theorem of Savitch [Sav70] states that NSPACE(S) ⊆ DSPACE(S2 ). In particular, Savitch gave a deterministic algorithm to solve ST-CONNECTIVITY (an NL-complete probl...
Shiva Kintali
TPDS
2010
256views more  TPDS 2010»
13 years 8 months ago
Privacy-Conscious Location-Based Queries in Mobile Environments
— In location-based services, users with location-aware mobile devices are able to make queries about their surroundings anywhere and at any time. While this ubiquitous computing...
Jianliang Xu, Xueyan Tang, Haibo Hu, Jing Du
WWW
2005
ACM
14 years 10 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
14 years 10 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...
« Prev « First page 1074 / 1226 Last » Next »