Sciweavers

2397 search results - page 18 / 480
» Applications of integer relation algorithms
Sort
View
CORR
2010
Springer
120views Education» more  CORR 2010»
13 years 4 months ago
LRM-Trees: Compressed Indices, Adaptive Sorting, and Compressed Permutations
LRM-Trees are an elegant way to partition a sequence of values into sorted consecutive blocks, and to express the relative position of the first element of each block within a prev...
Jérémy Barbay, Johannes Fischer
ICSM
2007
IEEE
14 years 4 months ago
Computation of Static Execute After Relation with Applications to Software Maintenance
In this paper, we introduce Static Execute After (SEA) relationship among program components and present an efficient analysis algorithm. Our case studies show that SEA may appro...
Árpád Beszédes, Tamás ...
ESA
1997
Springer
93views Algorithms» more  ESA 1997»
14 years 2 months ago
Quasi-Fully Dynamic Algorithms for Two-Connectivity, Cycle Equivalence and Related Problems
In thispaper we introduce a new class of dynamicgraphalgorithmscalledquasi-fully dynamic algorithms,which are much more general than the backtracking algorithmsand are much simple...
Madhukar R. Korupolu, Vijaya Ramachandran
DIS
2009
Springer
14 years 4 months ago
A Sliding Window Algorithm for Relational Frequent Patterns Mining from Data Streams
Some challenges in frequent pattern mining from data streams are the drift of data distribution and the computational efficiency. In this work an additional challenge is considered...
Fabio Fumarola, Anna Ciampi, Annalisa Appice, Dona...
CCGRID
2007
IEEE
14 years 4 months ago
Relative Performance of Scheduling Algorithms in Grid Environments
Abstract— Effective scheduling is critical for the performance of an application launched onto the Grid environment [11], [12]. Finding effective scheduling algorithms for this...
Yang Zhang, Charles Koelbel, Ken Kennedy