Sciweavers

712 search results - page 2 / 143
» Sorting and selection on dynamic data
Sort
View
ATVA
2009
Springer
125views Hardware» more  ATVA 2009»
13 years 11 months ago
Automated Analysis of Data-Dependent Programs with Dynamic Memory
We present a new approach for automatic verification of data-dependent programs manipulating dynamic heaps. A heap is encoded by a graph where the nodes represent the cells, and t...
Parosh Aziz Abdulla, Muhsin Atto, Jonathan Cederbe...
IAJIT
2010
96views more  IAJIT 2010»
13 years 3 months ago
A Data Mashup for Dynamic Composition of Adaptive Courses
: This paper presents a novel adaptive course composition system that based on mashing up learning content in a web application. The system includes three major components, static ...
Mohammed Al-Zoube, Baha Khasawneh
PVLDB
2010
112views more  PVLDB 2010»
13 years 2 months ago
Two-way Replacement Selection
The performance of external sorting using merge sort is highly dependent on the length of the runs generated. One of the most commonly used run generation strategies is Replacemen...
Xavier Martinez-Palau, David Dominguez-Sal, Josep-...
ALENEX
2003
144views Algorithms» more  ALENEX 2003»
13 years 6 months ago
Cache-Conscious Sorting of Large Sets of Strings with Dynamic Tries
Ongoing changes in computer performance are affecting the efficiency of string sorting algorithms. The size of main memory in typical computers continues to grow, but memory acce...
Ranjan Sinha, Justin Zobel
TSP
2008
167views more  TSP 2008»
13 years 3 months ago
Multi-Task Learning for Analyzing and Sorting Large Databases of Sequential Data
A new hierarchical nonparametric Bayesian framework is proposed for the problem of multi-task learning (MTL) with sequential data. The models for multiple tasks, each characterize...
Kai Ni, John William Paisley, Lawrence Carin, Davi...