1802 search results - page 230 / 361 » Sparse Computations with PEI |
108
click to vote
CORR
2006
Springer
15 years 1 months ago
2006
Springer
We consider the problem of constructing an erasure code for storage over a network when the data sources are distributed. Specifically, we assume that there are n storage nodes wit...
109
Voted
DM
2006
15 years 1 months ago
2006
Any given graph can be embedded in a chordal graph by adding edges, and the resulting chordal graph is called a triangulation of the input graph. In this paper we study minimal tr...
103
Voted
CGF
2007
15 years 1 months ago
2007
Geometric constraints have proved to be efficient for enhancing the realism of shape animation. The present paper addresses the computation and the preservation of the volume enc...
106
click to vote
JCP
2008
15 years 1 months ago
2008
Finding clusters with widely differing sizes, shapes and densities in presence of noise and outliers is a challenging job. The DBSCAN is a versatile clustering algorithm that can f...
135
click to vote
JCP
2008
15 years 1 months ago
2008
Existing frequent subgraph mining algorithms can operate efficiently on graphs that are sparse, have vertices with low and bounded degrees, and contain welllabeled vertices and edg...