4850 search results - page 162 / 970 » Approximate Data Structures with Applications |
152
Voted
GPC
2007
Springer
15 years 7 months ago
2007
Springer
Sharing huge databases in distributed systems is inherently difficult. As the amount of stored data increases, data localization techniques become no longer sufficient. A more ef...
103
Voted
ICDM
2009
IEEE
15 years 7 months ago
2009
IEEE
Given a data matrix, the problem of finding dense/uniform sub-blocks in the matrix is becoming important in several applications. The problem is inherently combinatorial since th...
115
Voted
SIBGRAPI
2006
IEEE
15 years 7 months ago
2006
IEEE
In this work we propose a method for the polygonization of octree-based reconstructions by dual contouring. Dual contouring is an adaptive method for determining contiguous polygo...
118
Voted
ENTCS
2007
15 years 1 months ago
2007
Program slicing is a method for decomposing programs by analyzing their data and control flow. Slicingbased techniques have many applications in the field of software engineerin...
104
Voted
RIAO
2000
15 years 2 months ago
2000
Traditionally work on multimedia structuring has been centered on the creation of indices and their use for searching. Although searching is important there are many cases where t...