Sciweavers

921 search results - page 19 / 185
» New Data Structures for Orthogonal Range Searching
Sort
View
SWAT
2004
Springer
146views Algorithms» more  SWAT 2004»
15 years 9 months ago
Cache-Oblivious Data Structures and Algorithms for Undirected Breadth-First Search and Shortest Paths
We present improved cache-oblivious data structures and algorithms for breadth-first search and the single-source shortest path problem on undirected graphs with non-negative edge...
Gerth Stølting Brodal, Rolf Fagerberg, Ulri...
VLDB
2000
ACM
163views Database» more  VLDB 2000»
15 years 7 months ago
Hierarchical Compact Cube for Range-Max Queries
A range-max query finds the maximum value over all selected cells of an on-line analytical processing (OLAP) data cube where the selection is specified by ranges of contiguous val...
Sin Yeung Lee, Tok Wang Ling, Hua-Gang Li
HPDC
2010
IEEE
15 years 4 months ago
New caching techniques for web search engines
This paper proposes a cache hierarchy that enables Web search engines to efficiently process user queries. The different caches in the hierarchy are used to store pieces of data w...
Mauricio Marín, Veronica Gil Costa, Carlos ...
NAR
2008
101views more  NAR 2008»
15 years 2 months ago
RNALogo: a new approach to display structural RNA alignment
Regulatory RNAs play essential roles in many essential biological processes, ranging from gene regulation to protein synthesis. This work presents a web-based tool, RNALogo, to cr...
Tzu-Hao Chang, Jorng-Tzong Horng, Hsien-Da Huang
INFSOF
2007
98views more  INFSOF 2007»
15 years 3 months ago
Indexing range sum queries in spatio-temporal databases
Although spatio-temporal databases have received considerable attention recently, there has been little work on processing range sum queries on the historical records of moving ob...
Hyung-Ju Cho, Chin-Wan Chung