Sciweavers

696 search results - page 38 / 140
» A class of combinatorial identities
Sort
View
ATAL
2010
Springer
15 years 3 months ago
False-name-proofness with bid withdrawal
We study a more powerful variant of false-name manipulation in Internet auctions: an agent can submit multiple false-name bids, but then, once the allocation and payments have bee...
Mingyu Guo, Vincent Conitzer
PAIRING
2010
Springer
133views Cryptology» more  PAIRING 2010»
14 years 12 months ago
Pairing Computation on Elliptic Curves with Efficiently Computable Endomorphism and Small Embedding Degree
Scott uses an efficiently computable isomorphism in order to optimize pairing computation on a particular class of curves with embedding degree 2. He points out that pairing implem...
Sorina Ionica, Antoine Joux
WIA
2005
Springer
15 years 7 months ago
Tree Automata and XPath on Compressed Trees
The complexity of various membership problems for tree automata on compressed trees is analyzed. Two compressed representations are considered: dags, which allow to share identical...
Markus Lohrey, Sebastian Maneth
AVBPA
2003
Springer
152views Biometrics» more  AVBPA 2003»
15 years 7 months ago
Experimental Results on Fusion of Multiple Fingerprint Matchers
Fingerprints are widely used in automatic identity verification systems. The core of such systems is the verification algorithm to match two fingerprints. So far, various method fo...
Gian Luca Marcialis, Fabio Roli
IPPS
1996
IEEE
15 years 6 months ago
Partitionability of the Multistage Interconnection Networks
- Partitionability allows the creation of many physically independent subsystems, each of which retains an identical functionality as its parent network and has no communication in...
Yeimkuan Chang