Sciweavers

679 search results - page 100 / 136
» Using decision problems in public key cryptography
Sort
View
NAACL
1994
15 years 2 months ago
Tree-Based State Tying for High Accuracy Modelling
The key problem to be faced when building a HMM-based continuous speech recogniser is maintaining the balance between model complexity and available training data. For large vocab...
S. J. Young, J. J. Odell, Philip C. Woodland
IPPS
2009
IEEE
15 years 8 months ago
Using a market economy to provision compute resources across planet-wide clusters
—We present a practical, market-based solution to the resource provisioning problem in a set of heterogeneous resource clusters. We focus on provisioning rather than immediate sc...
Murray Stokely, Jim Winget, E. Keyes, C. Grimes, B...
KDD
2008
ACM
211views Data Mining» more  KDD 2008»
16 years 1 months ago
ArnetMiner: extraction and mining of academic social networks
This paper addresses several key issues in the ArnetMiner system, which aims at extracting and mining academic social networks. Specifically, the system focuses on: 1) Extracting ...
Jie Tang, Jing Zhang, Limin Yao, Juanzi Li, Li Zha...
CHES
2005
Springer
155views Cryptology» more  CHES 2005»
15 years 6 months ago
Scalable Hardware for Sparse Systems of Linear Equations, with Applications to Integer Factorization
Motivated by the goal of factoring large integers using the Number Field Sieve, several special-purpose hardware designs have been recently proposed for solving large sparse system...
Willi Geiselmann, Adi Shamir, Rainer Steinwandt, E...
PLDI
2004
ACM
15 years 6 months ago
Jedd: a BDD-based relational extension of Java
In this paper we present Jedd, a language extension to Java that supports a convenient way of programming with Binary Decision Diagrams (BDDs). The Jedd language abstracts BDDs as...
Ondrej Lhoták, Laurie J. Hendren