Sciweavers

1089 search results - page 98 / 218
» Bounds on generalized Frobenius numbers
Sort
View
ICECCS
2010
IEEE
161views Hardware» more  ICECCS 2010»
13 years 9 months ago
Model Checking Round-Based Distributed Algorithms
—In the field of distributed computing, there are many round-based algorithms to solve fundamental problems, such as leader election and distributed consensus. Due to the nature...
Xin An, Jun Pang
JOC
2006
71views more  JOC 2006»
13 years 9 months ago
Private Computation: k-Connected versus 1-Connected Networks
We study the role of connectivity of communication networks in private computations under information theoretic settings. It will be shown that some functions can be computed by pr...
Markus Bläser, Andreas Jakoby, Maciej Liskiew...
TIT
2002
82views more  TIT 2002»
13 years 8 months ago
Order estimation for a special class of hidden Markov sources and binary renewal processes
We consider the estimation of the order, i.e., the number of hidden states, of a special class of discrete-time finite-alphabet hidden Markov sources. This class can be characteriz...
Sanjeev Khudanpur, Prakash Narayan
GC
2010
Springer
13 years 7 months ago
Integer Functions on the Cycle Space and Edges of a Graph
A directed graph has a natural Z-module homomorphism from the underlying graph’s cycle space to Z where the image of an oriented cycle is the number of forward edges minus the n...
Daniel C. Slilaty
STOC
2010
ACM
228views Algorithms» more  STOC 2010»
14 years 1 months ago
On the searchability of small-world networks with arbitrary underlying structure
Revisiting the “small-world” experiments of the ’60s, Kleinberg observed that individuals are very effective at constructing short chains of acquaintances between any two p...
Pierre Fraigniaud and George Giakkoupis