Sciweavers

4137 search results - page 521 / 828
» On the number of matchings of a tree
Sort
View
SIGECOM
2005
ACM
105views ECommerce» more  SIGECOM 2005»
16 years 10 days ago
Communication complexity of common voting rules
We determine the communication complexity of the common voting rules. The rules (sorted by their communication complexity from low to high) are plurality, plurality with runoff, ...
Vincent Conitzer, Tuomas Sandholm
CRYPTO
2005
Springer
116views Cryptology» more  CRYPTO 2005»
16 years 9 days ago
New Monotones and Lower Bounds in Unconditional Two-Party Computation
Since bit and string oblivious transfer and commitment, two primitives of paramount importance in secure two- and multi-party computation, cannot be realized in an unconditionally ...
Stefan Wolf, Jürg Wullschleger
DAWAK
2005
Springer
16 years 9 days ago
Design and Development of a Tool for Integrating Heterogeneous Data Warehouses
In this paper we describe the design of a tool supporting the integration of independently developed data warehouses, a problem that arises in several common scenarios. The basic f...
Riccardo Torlone, Ivan Panella
ICCS
2005
Springer
16 years 9 days ago
Highly Scalable Algorithms for Robust String Barcoding
: String barcoding is a recently introduced technique for genomic based identification of microorganisms. In this paper we describe the engineering of highly scalable algorithms fo...
Bhaskar DasGupta, Kishori M. Konwar, Ion I. Mandoi...
SELMAS
2005
Springer
16 years 8 days ago
Improving Flexibility and Robustness in Agent Interactions: Extending Prometheus with Hermes
Abstract. A crucial part of multi-agent system design is the design of agent interactions. Traditional approaches to designing agent interaction use interaction protocols, which fo...
Christopher Cheong, Michael Winikoff