4377 search results - page 178 / 876 » Mass problems and randomness |
235
click to vote
STACS
2012
Springer
14 years 2 months ago
2012
Springer
We consider the classical rumor spreading problem, where a piece of information must be disseminated from a single node to all n nodes of a given network. We devise two simple pus...
190
click to vote
ICALP
2005
Springer
16 years 2 days ago
2005
Springer
We establish the first polynomial-strength time-space lower bounds for problems in the lineartime hierarchy on randomized machines with two-sided error. We show that for any inte...
187
click to vote
INFOCOM
2010
IEEE
15 years 5 months ago
2010
IEEE
— Random access protocols, such as Aloha, are commonly modeled in wireless ad-hoc networks by using the protocol model. However, it is well-known that the protocol model is not a...
188
click to vote
MIA
2010
15 years 1 months ago
2010
We propose a framework for intensity-based registration of images by linear transformations, based on a discrete Markov Random Field (MRF) formulation. Here, the challenge arises ...
199
click to vote
SIGIR
2009
ACM
16 years 1 months ago
2009
ACM
When search is against structured documents, it is beneficial to extract information from user queries in a format that is consistent with the backend data structure. As one step...