2366 search results - page 414 / 474 » Mapping time |
NPAR
2004
ACM
14 years 3 months ago
2004
ACM
Algorithms that detect silhouettes, creases, and other edge based features often perform per-edge and per-face mesh computations using global adjacency information. These are unsu...
VLDB
2004
ACM
14 years 3 months ago
2004
ACM
Declarative queries are proving to be an attractive paradigm for interacting with networks of wireless sensors. The metaphor that “the sensornet is a database” is problematic,...
RTAS
2003
IEEE
14 years 3 months ago
2003
IEEE
Most research on QoS-aware computing considers systems where code is generally partitioned into separately schedulable tasks with associated timing constraints. In sharp contrast ...
GD
2003
Springer
14 years 3 months ago
2003
Springer
In this paper we consider the problem of drawing a planar graph using circular arcs as edges, given a one-to-one mapping between the vertices of the graph and a set of points in t...
CLOUD
2010
ACM
14 years 3 months ago
2010
ACM
This work addresses the need for stateful dataflow programs that can rapidly sift through huge, evolving data sets. These data-intensive applications perform complex multi-step c...