Sciweavers

12950 search results - page 2296 / 2590
» On Optimal Timed Strategies
Sort
View
CIKM
2004
Springer
15 years 10 months ago
Approximating the top-m passages in a parallel question answering system
We examine the problem of retrieving the top-m ranked items from a large collection, randomly distributed across an n-node system. In order to retrieve the top m overall, we must ...
Charles L. A. Clarke, Egidio L. Terra
CRYPTO
2004
Springer
205views Cryptology» more  CRYPTO 2004»
15 years 10 months ago
Constant-Round Resettable Zero Knowledge with Concurrent Soundness in the Bare Public-Key Model
In the bare public-key model (BPK in short), each verifier is assumed to have deposited a public key in a file that is accessible by all users at all times. In this model, intro...
Giovanni Di Crescenzo, Giuseppe Persiano, Ivan Vis...
CSEE
2004
Springer
15 years 10 months ago
On Pair Rotation in the Computer Science Course
In a course environment, pairing a student with one partner for the entire semester is beneficial, but may not be optimal. The authors conducted a study in two undergraduate level...
Hema Srikanth, Laurie A. Williams, Eric Wiebe, Car...
146
Voted
ECAI
2004
Springer
15 years 10 months ago
Towards Efficient Learning of Neural Network Ensembles from Arbitrarily Large Datasets
Advances in data collection technologies allow accumulation of large and high dimensional datasets and provide opportunities for learning high quality classification and regression...
Kang Peng, Zoran Obradovic, Slobodan Vucetic
ECOOP
2004
Springer
15 years 10 months ago
Pointer Analysis in the Presence of Dynamic Class Loading
Many compiler optimizations and software engineering tools need precise pointer analyses to be effective. Unfortunately, many Java features, such as dynamic class loading, refle...
Martin Hirzel, Amer Diwan, Michael Hind
« Prev « First page 2296 / 2590 Last » Next »