653 search results - page 17 / 131 » Factored Planning: How, When, and When Not |
221
click to vote
ICDE
2005
IEEE
16 years 3 months ago
2005
IEEE
Sensor networks and other distributed information systems (such as the Web) must frequently access data that has a high per-attribute acquisition cost, in terms of energy, latency...
115
click to vote
EUROPAR
2003
Springer
15 years 7 months ago
2003
Springer
Abstract. This paper shows how a sparse hypermatrix Cholesky factorization can be improved. This is accomplished by means of efficient codes which operate on very small dense matri...
123
click to vote
IPL
1998
15 years 1 months ago
1998
The k-MST problem requires finding that subset of at least k vertices of a given graph whose Minimum Spanning Tree has least weight amongst all subsets of at least k vertices. Th...
181
click to vote
ICDE
2005
IEEE
16 years 3 months ago
2005
IEEE
The query optimizer of a database system is confronted with two aspects when handling user-defined functions (UDFs) in query predicates: the vast differences in evaluation costs b...
117
Voted
VEE
2006
ACM
15 years 7 months ago
2006
ACM
Many new Java runtime optimizations report relatively small, single-digit performance improvements. On modern virtual and actual hardware, however, the performance impact of an op...