2962 search results - page 171 / 593 » Optimizing Spatial Data Structures For Static Data |
160
Voted
CASES
2003
ACM
15 years 10 months ago
2003
ACM
This paper presents a highly predictable, low overhead and yet dynamic, memory allocation strategy for embedded systems with scratch-pad memory. A scratch-pad is a fast compiler-m...
147
click to vote
AAAI
2006
15 years 6 months ago
2006
Embedding algorithms are a method for revealing low dimensional structure in complex data. Most embedding algorithms are designed to handle objects of a single type for which pair...
123
click to vote
ICWE
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. Current data-intensive Web applications, such as on-line trading, ecommerce, corporate portals and so on, are becoming more and more complex, both in terms of density of ...
131
click to vote
VLDB
2004
ACM
15 years 10 months ago
2004
ACM
We consider the problem of horizontally partitioning a dynamic relation across a large number of disks/nodes by the use of range partitioning. Such partitioning is often desirable...
125
Voted
CDC
2008
IEEE
15 years 7 months ago
2008
IEEE
Prediction error identification requires that data be informative with respect to the chosen model structure. Whereas sufficient conditions for informative experiments have been av...