Sciweavers

8780 search results - page 1661 / 1756
» On the Feasibility of Consistent Computations
Sort
View
PODC
2009
ACM
15 years 10 months ago
Simple and efficient asynchronous byzantine agreement with optimal resilience
Consider a completely asynchronous network consisting of n parties where every two parties are connected by a private channel. An adversary At with unbounded computing power activ...
Arpita Patra, Ashish Choudhary, C. Pandu Rangan
COMPGEOM
2007
ACM
14 years 11 months ago
Between umbra and penumbra
Computing shadow boundaries is a difficult problem in the case of non-point light sources. A point is in the umbra if it does not see any part of any light source; it is in full l...
Julien Demouth, Olivier Devillers, Hazel Everett, ...
BMCBI
2007
226views more  BMCBI 2007»
14 years 10 months ago
MiRFinder: an improved approach and software implementation for genome-wide fast microRNA precursor scans
Background: MicroRNAs (miRNAs) are recognized as one of the most important families of noncoding RNAs that serve as important sequence-specific post-transcriptional regulators of ...
Ting-Hua Huang, Bin Fan, Max F. Rothschild, Zhi-Li...
IJCV
2008
282views more  IJCV 2008»
16 years 2 months ago
Stereo Matching Using Population-Based MCMC
In this paper, we propose a new stereo matching method using the population-based Markov Chain Monte Carlo (Pop-MCMC), which belongs to the sampling-based methods. Since the previo...
Wonsik Kim (Seoul National University), Joonyoung ...

Publication
118views
15 years 11 months ago
The Minimum Circuity Frontier and the Journey to Work
People travel between places of residence and work destinations via transportation net- works. The relation between selection of home and work locations has been heavily debated ...
Levinson, D. and El-Geneidy A.
« Prev « First page 1661 / 1756 Last » Next »