Sciweavers

3360 search results - page 83 / 672
» Opportunistic Data Structures with Applications
Sort
View
MICRO
1994
IEEE
99views Hardware» more  MICRO 1994»
15 years 7 months ago
Data relocation and prefetching for programs with large data sets
Numerical applications frequently contain nested loop structures that process large arrays of data. The execution of these loop structures often produces memory preference pattern...
Yoji Yamada, John Gyllenhall, Grant Haab, Wen-mei ...
119
Voted
LREC
2008
98views Education» more  LREC 2008»
15 years 4 months ago
Deriving Rhetorical Complexity Data from the RST-DT Corpus
This paper describes a study of the levels at which different rhetorical relations occur in rhetorical structure trees. In a previous empirical study (Williams and Reiter, 2003) o...
Sandra Williams, Richard Power
129
Voted
ICWE
2010
Springer
15 years 5 months ago
Designing Service Marts for Engineering Search Computing Applications
: The use of patterns in data management is not new: in data warehousing, data marts are simple conceptual schemas with exactly one core entity, describing facts, surrounded by mul...
Alessandro Campi, Stefano Ceri, Andrea Maesani, St...

Publication
217views
17 years 3 months ago
Towards Efficient Search on Unstructured Data: An Intelligent-Storage Approach
Applications that create and consume unstructured data have grown both in scale of storage requirements and complexity of search primitives. We consider two such applications: exha...
Aravindan Raghuveer, Biplob K. Debnath, David Hung...
P2P
2007
IEEE
156views Communications» more  P2P 2007»
15 years 9 months ago
Completeness Estimation of Range Queries in Structured Overlays
Range queries are a very powerful tool in a wide range of data management systems and are vital to a multitude of applications. The hierarchy of structured overlay systems can be ...
Marcel Karnstedt, Kai-Uwe Sattler, Roman Schmidt