Sciweavers

282 search results - page 11 / 57
» Efficient bundle sorting
Sort
View
SWAT
2000
Springer
97views Algorithms» more  SWAT 2000»
13 years 11 months ago
I/O-Space Trade-Offs
We define external memory (or I/O) models which capture space complexity and develop a general technique for deriving I/O-space trade-offs in these models from internal memory mode...
Lars Arge, Jakob Pagter
SSDBM
1998
IEEE
95views Database» more  SSDBM 1998»
13 years 11 months ago
SRQL: Sorted Relational Query Language
A relation is an unordered collection of records. Often, however, there is an underlying order (e.g., a sequence of stock prices), and users want to pose queries that reflect this...
Raghu Ramakrishnan, Donko Donjerkovic, Arvind Rang...
DCC
1998
IEEE
13 years 11 months ago
The Context Trees of Block Sorting Compression
Abstract. The Burrows-Wheeler transform (BWT) and block sorting compression are closely related to the context trees of PPM. The usual approach of treating BWT as merely a permutat...
N. Jesper Larsson
ISCC
2006
IEEE
14 years 1 months ago
SASA: A Synthesis Scheduling Algorithm with Prediction and Sorting Features
We present a new scheduling algorithm, which is a synthesis of all the remarkable features of pretransmission coordination-based protocols for broadcast and select star networks. ...
Panagiotis G. Sarigiannidis, Georgios I. Papadimit...
MCFNS
2010
104views more  MCFNS 2010»
13 years 2 months ago
ECOSEL: An Auction Mechanism for Forest Ecosystem Services
This paper describes the foundations of a market mechanism that was designed to stimulate more efficient provisions of forest ecosystem services to society. The proposed tool is a ...
Sándor F. Tóth, Gregory J. Ettl, Ser...