Sciweavers

587 search results - page 95 / 118
» Compactness of Loeb Spaces
Sort
View
LCTRTS
2005
Springer
14 years 26 days ago
Upper bound for defragmenting buddy heaps
Knuth’s buddy system is an attractive algorithm for managing storage allocation, and it can be made to operate in real-time. At some point, storage-management systems must eithe...
Delvin C. Defoe, Sharath R. Cholleti, Ron Cytron
WEBI
2005
Springer
14 years 25 days ago
Efficient Extraction of Closed Motivic Patterns in Multi-Dimensional Symbolic Representations of Music
In this paper, we present an efficient model for discovering repeated patterns in symbolic representations of music. Combinatorial redundancy inherent to the pattern discovery pa...
Olivier Lartillot
APPROX
2004
Springer
113views Algorithms» more  APPROX 2004»
14 years 23 days ago
Computationally-Feasible Truthful Auctions for Convex Bundles
In many economic settings, convex figures on the plane are for sale. For example, one might want to sell advertising space on a newspaper page. Selfish agents must be motivated ...
Moshe Babaioff, Liad Blumrosen
CDB
2004
Springer
143views Database» more  CDB 2004»
14 years 23 days ago
Constraint Processing Techniques for Improving Join Computation: A Proof of Concept
Constraint Processing and Database techniques overlap significantly. We discuss here the application of a constraint satisfaction technique, called dynamic bundling, to databases....
Anagh Lal, Berthe Y. Choueiry
SSDBM
2003
IEEE
95views Database» more  SSDBM 2003»
14 years 19 days ago
A Quad-Tree Based Multiresolution Approach for Two-dimensional Summary Data
In many application contexts, like statistical databases, scientific databases, query optimizers, OLAP, and so on, data are often summarized into synopses of aggregate values. Su...
Francesco Buccafurri, Filippo Furfaro, Domenico Sa...