4137 search results - page 598 / 828 » On the number of matchings of a tree |
ASIACRYPT
2007
Springer
14 years 2 months ago
2007
Springer
We show that computing e-th roots modulo n is easier than factoring n with currently known methods, given subexponential access to an oracle outputting the roots of numbers of the ...
CIKM
2005
Springer
14 years 1 months ago
2005
Springer
Peer-to-peer (p2p) systems offer an efficient means of data sharing among a dynamically changing set of a large number of autonomous nodes. Each node in a p2p system is connected...
WEBDB
2005
Springer
14 years 1 months ago
2005
Springer
Recently, there has been increased interest in the retrieval and integration of hidden Web data with a view to leverage high-quality information available in online databases. Alt...
COMPGEOM
2003
ACM
14 years 1 months ago
2003
ACM
We propose a novel type of decomposition for polygonal shapes. It is thought that, for the task of object recognition, the human visual system uses a part-based representation. De...
INFOCOM
2002
IEEE
14 years 1 months ago
2002
IEEE
—In this paper, we present three algorithms that provide performance guarantees for scheduling switches, such as optical switches, with configuration overhead. Each algorithm emu...