29 search results - page 4 / 6 » Edge maps: Representing flow with bounded error |
120
click to vote
ACSC
2010
IEEE
14 years 4 months ago
2010
IEEE
Terrains are an essential part of outdoor environments. Terrain models are important for computer games and applications in architecture, urban design and archaeology. A popular a...
102
click to vote
PG
2007
IEEE
15 years 3 months ago
2007
IEEE
We introduce an algorithm for approximating a 2manifold 3D mesh by a set of developable surfaces. Each developable surface is a generalized cylinder represented as a strip of tria...
IPPS
2010
IEEE
14 years 7 months ago
2010
IEEE
Abstract--NABBIT is a work-stealing library for execution of task graphs with arbitrary dependencies which is implemented as a library for the multithreaded programming language Ci...
124
click to vote
ICALP
2001
Springer
15 years 1 months ago
2001
Springer
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...
157
click to vote
PODS
2009
ACM
15 years 10 months ago
2009
ACM
We study privacy-preserving query answering over data containing relationships. A social network is a prime example of such data, where the nodes represent individuals and edges r...