Sciweavers

1730 search results - page 268 / 346
» Shimura Curve Computations
Sort
View
106
Voted
SAC
2009
ACM
15 years 7 months ago
Applying latent dirichlet allocation to group discovery in large graphs
This paper introduces LDA-G, a scalable Bayesian approach to finding latent group structures in large real-world graph data. Existing Bayesian approaches for group discovery (suc...
Keith Henderson, Tina Eliassi-Rad
99
Voted
SIBGRAPI
2006
IEEE
15 years 6 months ago
Non-Extensive Entropy for CAD Systems of Breast Cancer Images
Recent statistics show that breast cancer is a major cause of death among women in all of the world. Hence, early diagnostic with Computer Aided Diagnosis (CAD) systems is a very ...
Paulo S. Rodrigues, Ruey-Feng Chang, Jasjit S. Sur...
EGC
2005
Springer
15 years 6 months ago
HotGrid: Graduated Access to Grid-Based Science Gateways
Abstract. We describe the idea of a Science Gateway, an applicationspecific task wrapped as a web service, and some examples of these that are being implemented on the US TeraGrid...
Roy Williams, Conrad Steenberg, Julian J. Bunn
CRYPTO
2004
Springer
111views Cryptology» more  CRYPTO 2004»
15 years 6 months ago
Signed Binary Representations Revisited
The most common method for computing exponentiation of random elements in Abelian groups are sliding window schemes, which enhance the efficiency of the binary method at the expens...
Katsuyuki Okeya, Katja Schmidt-Samoa, Christian Sp...
MMB
2010
Springer
194views Communications» more  MMB 2010»
15 years 5 months ago
Searching for Tight Performance Bounds in Feed-Forward Networks
Abstract. Computing tight performance bounds in feed-forward networks under general assumptions about arrival and server models has turned out to be a challenging problem. Recently...
Andreas Kiefer, Nicos Gollan, Jens B. Schmitt