Sciweavers

7758 search results - page 52 / 1552
» On the Number of Distributive Lattices
Sort
View
CIKM
2008
Springer
15 years 8 months ago
Estimating the number of answers with guarantees for structured queries in p2p databases
Structured P2P overlays supporting standard database functionalities are a popular choice for building large-scale distributed data management systems. In such systems, estimating...
Marcel Karnstedt, Kai-Uwe Sattler, Michael Ha&szli...
COLING
2002
15 years 6 months ago
A Measure of Term Representativeness Based on the Number of Co-occurring Salient Words
We propose a novel measure of the representativeness (i.e., indicativeness or topic specificity) of a term in a given corpus. The measure embodies the idea that the distribution o...
Toru Hisamitsu, Yoshiki Niwa
SPDP
1991
IEEE
15 years 9 months ago
Fault-tolerant meshes with minimal numbers of spares
This paper presents several techniques for adding fault-tolerance to distributed memory parallel computers. More formally, given a target graph with n nodes, we create a fault-tol...
Jehoshua Bruck, Robert Cypher, Ching-Tien Ho
ORDER
2006
97views more  ORDER 2006»
15 years 6 months ago
Chain Dominated Orders
We study finite partial orders which have a chain such that every element of the order either belongs to this chain or has all its covers in this chain. We show that such orders a...
Glen-Brug Guenver, Jimmy Leblet, Jean-Xavier Rampo...
DCC
2003
IEEE
16 years 5 months ago
The Insecurity of the Elliptic Curve Digital Signature Algorithm with Partially Known Nonces
Nguyen and Shparlinski recently presented a polynomial-time algorithm that provably recovers the signer's secret DSA key when a few bits of the random nonces k (used at each s...
Phong Q. Nguyen, Igor Shparlinski