Sciweavers

3265 search results - page 245 / 653
» Representing Groups on Graphs
Sort
View
170
Voted
JOIN
2007
91views more  JOIN 2007»
15 years 6 months ago
An Optimal Rebuilding Strategy for an Incremental Tree Problem
This paper is devoted to the following incremental problem. Initially, a graph and a distinguished subset of vertices, called initial group, are given. This group is connected by ...
Nicolas Thibault, Christian Laforest
CLOUD
2010
ACM
15 years 11 months ago
G-Store: a scalable data store for transactional multi key access in the cloud
Cloud computing has emerged as a preferred platform for deploying scalable web-applications. With the growing scale of these applications and the data associated with them, scalab...
Sudipto Das, Divyakant Agrawal, Amr El Abbadi
SIAMCOMP
2010
100views more  SIAMCOMP 2010»
15 years 5 months ago
Algorithmic Enumeration of Ideal Classes for Quaternion Orders
We provide algorithms to count and enumerate representatives of the (right) ideal classes of an Eichler order in a quaternion algebra defined over a number field. We analyze the ...
Markus Kirschmer, John Voight
ICSE
2008
IEEE-ACM
16 years 6 months ago
CCVisu: automatic visual software decomposition
Understanding the structure of large existing (and evolving) software systems is a major challenge for software engineers. In reverse engineering, we aim to compute, for a given s...
Dirk Beyer
ISAAC
2005
Springer
111views Algorithms» more  ISAAC 2005»
16 years 4 days ago
Boosting Spectral Partitioning by Sampling and Iteration
A partition of a set of n items is a grouping of the items into k disjoint classes of equal size. Any partition can be modeled as a graph: the items become the vertices of the grap...
Joachim Giesen, Dieter Mitsche