1007 search results - page 140 / 202 » Worst-Case Optimal Algorithms for Parallel Query Processing |
201
click to vote
ICDE
2008
IEEE
16 years 3 months ago
2008
IEEE
A common technique for processing conjunctive queries is to first match each predicate separately using an index lookup, and then compute the intersection of the resulting rowid li...
133
click to vote
CONCUR
2006
Springer
15 years 6 months ago
2006
Springer
A stochastic graph game is played by two players on a game graph with probabilistic transitions. We consider stochastic graph games with -regular winning conditions specified as Ra...
151
click to vote
IPPS
2009
IEEE
15 years 9 months ago
2009
IEEE
Through the algorthmic design patterns of data parallelism and task parallelism, the graphics processing unit (GPU) offers the potential to vastly accelerate discovery and innovat...
125
Voted
GECCO
2007
Springer
15 years 8 months ago
2007
Springer
This paper presents a novel approach to the problem of automatic music transcription using electronic synthesis with genetic algorithms. Although the problem is well known and di�...
105
click to vote
ERSA
2010
14 years 12 months ago
2010
As reconfigurable computing (RC) platforms are becoming increasingly large-scale and heterogeneous, efficiently scheduling and partitioning applications on these platforms is a gro...