Education | Sciweavers

25

CORR
2006
Springer

68views Education» more CORR 2006»

A rigorous proof of the cavity method for counting matchings

13 years 8 months ago

In this paper we rigorously prove the validity of the cavity method for the problem of counting the number of matchings in graphs with large girth. Cavity method is an important he...

Mohsen Bayati, Chandra Nair

claim paper

Read More »

18

click to vote

CORR
2006
Springer

98views Education» more CORR 2006»

Fusion of qualitative beliefs using DSmT

13 years 8 months ago

Download fs.gallup.unm.edu

Florentin Smarandache, Jean Dezert

claim paper

Read More »

25

click to vote

CORR
2006
Springer

104views Education» more CORR 2006»

Modeling Adversaries in a Logic for Security Protocol Analysis

13 years 8 months ago

Download www.cs.cornell.edu

Logics for security protocol analysis require the formalization of an adversary model that specifies the capabilities of adversaries. A common model is the Dolev-Yao model, which c...

Joseph Y. Halpern, Riccardo Pucella

claim paper

Read More »

8

click to vote

CORR
2006
Springer

79views Education» more CORR 2006»

Geometric definition of a new skeletonization concept

13 years 8 months ago

Download www.math.upatras.gr

Yannis Bakopoulos, Theophanis Raptis, Doxaras Ioan...

claim paper

Read More »

22

click to vote

CORR
2006
Springer

105views Education» more CORR 2006»

Employing Trusted Computing for the forward pricing of pseudonyms in reputation systems

13 years 8 months ago

Download andreas.schmidt.novalyst.de

Reputation and recommendation systems are fundamental for the formation of community market places. Yet, they are easy targets for attacks which disturb a market's equilibriu...

Nicolai Kuntze, Dominique Maehler, Andreas U. Schm...

claim paper

Read More »

20

click to vote

CORR
2006
Springer

80views Education» more CORR 2006»

A polynomial-time approximation algorithm for the number of k-matchings in bipartite graphs

13 years 8 months ago

Download www.math.uic.edu

We show that the number of k-matching in a given undirected graph G is equal to the number of perfect matching of the corresponding graph Gk on an even number of vertices divided ...

Shmuel Friedland, Daniel Levy

claim paper

Read More »

19

click to vote

CORR
2006
Springer

86views Education» more CORR 2006»

Integrating Enterprise Software Applications with Web Portal Technology

13 years 8 months ago