2374 search results - page 247 / 475 » Fast Distributed Algorithms for Computing Separable Function... |
155
click to vote
ICPPW
2005
IEEE
15 years 8 months ago
2005
IEEE
Abstract— In the sporadic task model, a task is characterized by three parameters — an execution requirement, a relative deadline, and a period parameter — and has the interp...
297
click to vote
CVPR
2010
IEEE
15 years 11 months ago
2010
IEEE
We introduce a morphological approach to curve evolution. The
differential operators used in the standard PDE snake models can be
approached using morphological operations...
126
click to vote
VISSYM
2003
15 years 4 months ago
2003
We present a fast method that adaptively approximates large-scale functional scattered data sets with hierarchical B-splines. The scheme is memory efficient, easy to implement an...
129
click to vote
SAC
2010
ACM
15 years 10 months ago
2010
ACM
This work proposes and evaluates a sampling algorithm based on wavelet transforms with Coiflets basis to reduce the data sensed in wireless sensor networks applications. The Coi...
124
click to vote
SC
2009
ACM
15 years 10 months ago
2009
ACM
This paper presents a dynamic task scheduling approach to executing dense linear algebra algorithms on multicore systems (either shared-memory or distributed-memory). We use a tas...