Sciweavers

1538 search results - page 60 / 308
» Relative Randomness and Cardinality
Sort
View
STOC
1998
ACM
96views Algorithms» more  STOC 1998»
15 years 2 months ago
Randomized Protocols for Low Congestion Circuit Routing in Multistage Interconnection Networks
In this paper we study randomized algorithms for circuit switching on multistage networks related to the butterfly. We devise algorithms that route messages by constructing circu...
Richard Cole, Bruce M. Maggs, Friedhelm Meyer auf ...
CMSB
2006
Springer
15 years 1 months ago
Randomization and Feedback Properties of Directed Graphs Inspired by Gene Networks
Having in mind the large-scale analysis of gene regulatory networks, we review a graph decimation algorithm, called "leaf-removal", which can be used to evaluate the feed...
M. Cosentino Lagomarsino, P. Jona, B. Bassetti
ACL
2004
14 years 11 months ago
Discriminative Language Modeling with Conditional Random Fields and the Perceptron Algorithm
This paper describes discriminative language modeling for a large vocabulary speech recognition task. We contrast two parameter estimation methods: the perceptron algorithm, and a...
Brian Roark, Murat Saraclar, Michael Collins, Mark...
DM
2008
104views more  DM 2008»
14 years 9 months ago
On edge-weighted recursive trees and inversions in random permutations
We introduce random recursive trees, where deterministically weights are attached to the edges according to the labeling of the trees. We will give a bijection between recursive t...
Markus Kuba, Alois Panholzer
IJSN
2006
96views more  IJSN 2006»
14 years 9 months ago
A new signature scheme without random oracles
In this paper, we propose a new signature scheme that is existentially unforgeable under a chosen message attack without random oracle. The security of our scheme depends on a new ...
Chik How Tan