4332 search results - page 622 / 867 » A Probabilistic Identification Result |
137
Voted
EJC
2006
15 years 4 months ago
2006
We find the asymptotic number of connected graphs with k vertices and k - 1 + l edges when k, l approach infinity, reproving a result of Bender, Canfield and McKay. We use the pro...
146
click to vote
ENTCS
2006
15 years 4 months ago
2006
We present the first cryptographically sound security proof of the well-known Otway-Rees protocol. More precisely, we show that the protocol is secure against arbitrary active att...
128
click to vote
INFFUS
2008
15 years 4 months ago
2008
act 11 We describe an ensemble approach to learning from arbitrarily partitioned data. The partitioning comes from the distributed process12 ing requirements of a large scale simul...
IPM
2008
15 years 4 months ago
2008
This paper reports on the underlying IR problems encountered when dealing with the complex morphology and compound constructions found in the Hungarian language. It describes evalu...
174
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
Information integration applications, such as mediators or mashups, that require access to information resources currently rely on users manually discovering and integrating them ...