Sciweavers

2440 search results - page 261 / 488
» Data-Intensive Question Answering
Sort
View
ELPUB
2007
ACM
15 years 9 months ago
A Survey on magiran.com: A Database for the Magazines of Iran
This paper present the design and function of magiran.com, a databse of periodicals published in Iran. It also attempts to answer the following questions: How many of the total pe...
Mortaza Kokabi
ANTS
2010
Springer
252views Algorithms» more  ANTS 2010»
15 years 9 months ago
On a Problem of Hajdu and Tengely
Abstract. We answer a question asked by Hajdu and Tengely: The only arithmetic progression in coprime integers of the form (a2 , b2 , c2 , d5 ) is (1, 1, 1, 1). For the proof, we ï...
Samir Siksek, Michael Stoll
WCNC
2010
IEEE
15 years 8 months ago
Throughput Analysis for Cooperation in Random Access Networks
—This paper aims at answering the questions of how to enable cooperative communications in random access networks. And, since cooperation introduces extra transmissions in the ch...
Amr El-Sherif, K. J. Ray Liu
GFKL
2007
Springer
158views Data Mining» more  GFKL 2007»
15 years 8 months ago
Investigating Classifier Learning Behavior with Experiment Databases
Experimental assessment of the performance of classification algorithms is an important aspect of their development and application on real-world problems. To facilitate this analy...
Joaquin Vanschoren, Hendrik Blockeel
151
Voted
CRYPTO
2006
Springer
88views Cryptology» more  CRYPTO 2006»
15 years 8 months ago
On the Impossibility of Efficiently Combining Collision Resistant Hash Functions
Let H1, H2 be two hash functions. We wish to construct a new hash function H that is collision resistant if at least one of H1 or H2 is collision resistant. Concatenating the outpu...
Dan Boneh, Xavier Boyen