3223 search results - page 499 / 645 » The Scaling of Search Cost |
172
click to vote
SIGMOD
2004
ACM
16 years 6 months ago
2004
ACM
The rich dependency structure found in the columns of real-world relational databases can be exploited to great advantage, but can also cause query optimizers--which usually assum...
183
click to vote
ICDE
2010
IEEE
16 years 6 months ago
2010
IEEE
Abstract-- Mapping mashups are emerging Web 2.0 applications in which data objects such as blogs, photos and videos from different sources are combined and marked in a map using AP...
154
click to vote
SC
2009
ACM
16 years 1 months ago
2009
ACM
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 ...
155
click to vote
ATAL
2009
Springer
16 years 1 months ago
2009
Springer
Recent scaling up of decentralized partially observable Markov decision process (DEC-POMDP) solvers towards realistic applications is mainly due to approximate methods. Of this fa...
186
click to vote
ICC
2007
IEEE
16 years 21 days ago
2007
IEEE
—In this paper, a lattice-reduction-aided (LRA) With such an approximation, the complexity of VP is greatly minimum mean square error (MMSE) vector precoding (VP) is reduced. pro...