Sciweavers

8413 search results - page 1087 / 1683
» Ordering Problem Subgoals
Sort
View
STOC
2007
ACM
100views Algorithms» more  STOC 2007»
16 years 7 months ago
Reordering buffers for general metric spaces
In the reordering buffer problem, we are given an input sequence of requests for service each of which corresponds to a point in a metric space. The cost of serving the requests h...
Matthias Englert, Harald Räcke, Matthias West...
SIGMOD
2009
ACM
137views Database» more  SIGMOD 2009»
16 years 7 months ago
Robust and efficient algorithms for rank join evaluation
In the rank join problem we are given a relational join R1 1 R2 and a function that assigns numeric scores to the join tuples, and the goal is to return the tuples with the highes...
Jonathan Finger, Neoklis Polyzotis
MOBIHOC
2003
ACM
16 years 6 months ago
Energy-efficient caching strategies in ad hoc wireless networks
In this paper, we address the problem of energy-conscious cache placement in wireless ad hoc networks. We consider a network comprising a server with an interface to the wired net...
Pavan Nuggehalli, Vikram Srinivasan, Carla-Fabiana...
ECIR
2009
Springer
16 years 4 months ago
Investigating Learning Approaches for Blog Post Opinion Retrieval
Blog post opinion retrieval is the problem of identifying posts which express an opinion about a particular topic. Usually the problem is solved using a 3 step process in which rel...
Shima Gerani, Mark James Carman, Fabio Crestani
SC
2009
ACM
16 years 2 months ago
Autotuning multigrid with PetaBricks
Algorithmic choice is essential in any problem domain to realizing optimal computational performance. Multigrid is a prime example: not only is it possible to make choices at the ...
Cy P. Chan, Jason Ansel, Yee Lok Wong, Saman P. Am...
« Prev « First page 1087 / 1683 Last » Next »