1243 search results - page 226 / 249 » On the locality of bounded growth |
107
click to vote
IPSN
2004
Springer
15 years 5 months ago
2004
Springer
Wireless sensor networks are capable of collecting an enormous amount of data over space and time. Often, the ultimate objective is to derive an estimate of a parameter or functio...
121
click to vote
SI3D
2003
ACM
15 years 5 months ago
2003
ACM
We present a new algorithm for best-effort simplification of polygonal meshes based on principles of visual perception. Building on previous work, we use a simple model of low-lev...
101
click to vote
IMR
2003
Springer
15 years 5 months ago
2003
Springer
We present a new mesh warping algorithm for tetrahedral meshes based upon weighted laplacian smoothing. We start with a 3D domain which is bounded by a triangulated surface mesh a...
IEEEPACT
1998
IEEE
15 years 4 months ago
1998
IEEE
Compile-time scheduling is one approach to extract parallelism which has proved effective when the execution behavior is predictable. Unfortunately, the performance of most priori...
104
click to vote
ISPD
1998
ACM
15 years 4 months ago
1998
ACM
In very deep-submicron VLSI, certain manufacturing steps – notably optical exposure, resist development and etch, chemical vapor deposition and chemical-mechanical polishing (CM...