927 search results - page 139 / 186 » A Data Abstraction Alternative to Data Structure Algorithm M... |
111
Voted
LFCS
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. Balanced search trees provide guaranteed worst-case time performance and hence they form a very important class of data structures. However, the self-balancing ability co...
101
Voted
ICFP
2010
ACM
15 years 1 months ago
2010
ACM
We present a novel approach to regular, multi-dimensional arrays in Haskell. The main highlights of our approach are that it (1) is purely functional, (2) supports reuse through s...
113
click to vote
DAC
1997
ACM
15 years 4 months ago
1997
ACM
The design process for xed-point implementations either in software or in hardware requires a bit-true speci cation of the algorithm in order to analyze quantization e ects on an...
175
Voted
VLDB
2004
ACM
16 years 24 days ago
2004
ACM
Abstract. In dynamic environments like the Web, data sources may change not only their data but also their schemas, their semantics, and their query capabilities.When a mapping is ...
119
Voted
PVLDB
2008
15 years 1 days ago
2008
Many commercial RDBMSs employ cost-based query optimization exploiting dynamic programming (DP) to efficiently generate the optimal query execution plan. However, optimization tim...