Sciweavers

1066 search results - page 61 / 214
» Computing Private Set Operations with Linear Complexities
Sort
View
ICCS
2001
Springer
15 years 2 months ago
Optimizing Sparse Matrix Computations for Register Reuse in SPARSITY
Abstract. Sparse matrix-vector multiplication is an important computational kernel that tends to perform poorly on modern processors, largely because of its high ratio of memory op...
Eun-Jin Im, Katherine A. Yelick
PLDI
2003
ACM
15 years 3 months ago
Linear analysis and optimization of stream programs
As more complex DSP algorithms are realized in practice, an increasing need for high-level stream abstractions that can be compiled without sacrificing efficiency. Toward this en...
Andrew A. Lamb, William Thies, Saman P. Amarasingh...
STOC
2005
ACM
113views Algorithms» more  STOC 2005»
15 years 10 months ago
Efficient testing of groups
We construct an efficient probabilistic algorithm that, given a finite set with a binary operation, tests if it is an abelian group. The distance used is an analogue of the edit d...
Katalin Friedl, Gábor Ivanyos, Miklos Santh...
ISBI
2004
IEEE
15 years 10 months ago
Combining Fuzzy Logic and Level Set Methods for 3D MRI Brain Segmentation
We propose to segment volumetric brain structures with a level set method including a fuzzy decision in the design of the evolution force. The role of fuzzy logic is to fuse gradi...
Christian Barillot, Cybèle Ciofolo, Pierre ...
MOBIHOC
2002
ACM
15 years 9 months ago
Path set selection in mobile ad hoc networks
Topological changes in mobile ad hoc networks frequently render routing paths unusable. Such recurrent path failures have detrimental effects on the network ability to support QoS...
Emin Gün Sirer, Panagiotis Papadimitratos, Zy...