2950 search results - page 411 / 590 » Computing with Infinitely Many Processes |
189
click to vote
PKDD
2010
Springer
15 years 4 months ago
2010
Springer
The goal of graph clustering is to partition objects in a graph database into different clusters based on various criteria such as vertex connectivity, neighborhood similarity or t...
195
Voted
ICCV
2007
IEEE
16 years 8 months ago
2007
IEEE
Many computer vision and image processing tasks require the preservation of local discontinuities, terminations and bifurcations. Denoising with feature preservation is a challeng...
158
click to vote
PPOPP
2010
ACM
16 years 3 months ago
2010
ACM
In LAPACK many matrix operations are cast as block algorithms which iteratively process a panel using an unblocked algorithm and then update a remainder matrix using the high perf...
165
click to vote
CCS
2010
ACM
16 years 1 months ago
2010
ACM
In this paper, we propose a new practical identity-based encryption scheme which is suitable for wireless sensor network (WSN). We call it Receiver-Bounded Online/Offline Identity...
160
click to vote
ICS
2009
Tsinghua U.
16 years 1 months ago
2009
Tsinghua U.
Iterative stencil loops (ISLs) are used in many applications and tiling is a well-known technique to localize their computation. When ISLs are tiled across a parallel architecture...