Sciweavers

61 search results - page 3 / 13
» Some Open Questions Related to Cuckoo Hashing
Sort
View
MFCS
2005
Springer
15 years 3 months ago
Inverse Monoids: Decidability and Complexity of Algebraic Questions
This paper investigates the word problem for inverse monoids generated by a set Γ subject to relations of the form e = f, where e and f are both idempotents in the free inverse m...
Markus Lohrey, Nicole Ondrusch
STOC
2004
ACM
153views Algorithms» more  STOC 2004»
15 years 9 months ago
Quantum and classical query complexities of local search are polynomially related
Let f be an integer valued function on a finite set V . We call an undirected graph G(V, E) a neighborhood structure for f. The problem of finding a local minimum for f can be phr...
Miklos Santha, Mario Szegedy
84
Voted
WCRE
2007
IEEE
15 years 3 months ago
Do Code and Comments Co-Evolve? On the Relation between Source Code and Comment Changes
Comments are valuable especially for program understanding and maintenance, but do developers comment their code? To which extent do they add comments or adapt them when they evol...
Beat Fluri, Michael Würsch, Harald Gall
ASIACRYPT
2000
Springer
15 years 1 months ago
From Fixed-Length to Arbitrary-Length RSA Padding Schemes
A common practice for signing with RSA is to first apply a hash function or a redundancy function to the message, add some padding and exponentiate the resulting padded message us...
Jean-Sébastien Coron, François Koeun...
ICDE
2007
IEEE
125views Database» more  ICDE 2007»
15 years 3 months ago
Analyses and Fundamental ideas for a Relation Extraction Approach
Relation extraction is a difficult open research problem with important applications in several fields such as knowledge management, web mining, ontology building, intelligent sys...
Lobna Karoui, Marie-Aude Aufaure, Nacéra Be...