Sciweavers

4541 search results - page 439 / 909
» Cache-Oblivious Algorithms and Data Structures
Sort
View
IFM
2010
Springer
183views Formal Methods» more  IFM 2010»
15 years 2 months ago
Certified Absence of Dangling Pointers in a Language with Explicit Deallocation
Safe is a first-order eager functional language with facilities for programmer controlled destruction and copying of data structures. It provides also regions, i.e. disjoint parts...
Javier de Dios, Manuel Montenegro, Ricardo Pe&ntil...
ICDE
2006
IEEE
167views Database» more  ICDE 2006»
16 years 6 months ago
Better Burst Detection
A burst is a large number of events occurring within a certain time window. As an unusual activity, it's a noteworthy phenomenon in many natural and social processes. Many da...
Xin Zhang, Dennis Shasha
VLDB
2005
ACM
397views Database» more  VLDB 2005»
16 years 5 months ago
Concurrency control and recovery for balanced B-link trees
Abstract. In this paper we present new concurrent and recoverable B-link-tree algorithms. Unlike previous algorithms, ours maintain the balance of the B-link tree at all times, so ...
Ibrahim Jaluta, Seppo Sippu, Eljas Soisalon-Soinin...
CORR
2010
Springer
209views Education» more  CORR 2010»
15 years 1 months ago
Generalized Tree-Based Wavelet Transform
In this paper we propose a new wavelet transform applicable to functions defined on graphs, high dimensional data and networks. The proposed method generalizes the Haar-like transf...
Idan Ram, Michael Elad, Israel Cohen
CVPR
2011
IEEE
15 years 1 months ago
From Region Similarity to Category Discovery
The goal of object category discovery is to automatically identify groups of image regions which belong to some new, previously unseen category. This task is typically performed i...
Carolina Galleguillos, Brian McFee, Serge Belongie...