3625 search results - page 253 / 725 » On choosing |
215
click to vote
SIGMOD
2003
ACM
16 years 7 months ago
2003
ACM
Most relational query optimizers make use of information about the costs of accessing tuples and data structures on various storage devices. This information can at times be off b...
247
click to vote
PODS
2002
ACM
16 years 7 months ago
2002
ACM
We consider the fundamental operation of applying a conjunction of selection conditions to a set of records. With large main memories available cheaply, systems may choose to keep...
194
click to vote
MOBIHOC
2007
ACM
16 years 7 months ago
2007
ACM
Recently, there has been substantial interest in the design of crosslayer protocols for wireless networks. These protocols optimize certain performance metric(s) of interest (e.g....
138
click to vote
ALT
2007
Springer
16 years 4 months ago
2007
Springer
Abstract. This work extends studies of Angluin, Lange and Zeugmann on the dependence of learning on the hypotheses space chosen for the class. In subsequent investigations, uniform...
189
click to vote
PLDI
2009
ACM
16 years 2 months ago
2009
ACM
It is often impossible to obtain a one-size-fits-all solution for high performance algorithms when considering different choices for data distributions, parallelism, transformati...