Sciweavers

158 search results - page 12 / 32
» Some counting problems related to permutation groups
Sort
View
106
Voted
ACL
1992
15 years 27 days ago
SEXTANT: Exploring Unexplored Contexts for Semantic Extraction from Syntactic Analysis
For a very long time, it has been considered that the only way of automatically extracting similar groups of words from a text collection for which no semantic information exists ...
Gregory Grefenstette
ICS
2010
Tsinghua U.
15 years 9 months ago
On the Construction of One-Way Functions from Average Case Hardness
In this paper we study the possibility of proving the existence of one-way functions based on average case hardness. It is well-known that if there exists a polynomial-time sample...
Noam Livne
CORR
2007
Springer
104views Education» more  CORR 2007»
14 years 11 months ago
Sorting and Selection in Posets
Classical problems of sorting and searching assume an underlying linear ordering of the objects being compared. In this paper, we study a more general setting, in which some pairs...
Constantinos Daskalakis, Richard M. Karp, Elchanan...
BMCBI
2010
80views more  BMCBI 2010»
14 years 12 months ago
Power and sample size estimation in microarray studies
Background: Before conducting a microarray experiment, one important issue that needs to be determined is the number of arrays required in order to have adequate power to identify...
Wei-Jiun Lin, Huey-miin Hsueh, James J. Chen
ASIACRYPT
2004
Springer
15 years 5 months ago
Generic Homomorphic Undeniable Signatures
We introduce a new computational problem related to the interpolation of group homomorphisms which generalizes many famous cryptographic problems including discrete logarithm, Diļ¬...
Jean Monnerat, Serge Vaudenay