Sciweavers

4212 search results - page 541 / 843
» On Compressible Pairings and Their Computation
Sort
View
165
Voted
CORR
2008
Springer
115views Education» more  CORR 2008»
15 years 8 months ago
Playing With Population Protocols
Population protocols have been introduced as a model of sensor networks consisting of very limited mobile agents with no control over their own movement: A collection of anonymous ...
Olivier Bournez, Jérémie Chalopin, J...
ACCV
2010
Springer
15 years 7 months ago
Efficient Large-Scale Stereo Matching
ACCV In this paper we propose a novel approach to binocular stereo for fast matching of high-resolution images. Our approach builds a prior on the disparities by forming a ...
Andreas Geiger, Martin Roser and Raquel Urtasun
ALGORITHMICA
2010
137views more  ALGORITHMICA 2010»
15 years 7 months ago
Understanding the Generalized Median Stable Matchings
Let I be a stable matching instance with N stable matchings. For each man m, order his (not necessarily distinct) N partners from his most preferred to his least preferred. Denote...
Christine T. Cheng
BIOINFORMATICS
2006
130views more  BIOINFORMATICS 2006»
15 years 6 months ago
Memory efficient folding algorithms for circular RNA secondary structures
A small class of RNA molecules, in particular the tiny genomes of viroids, are circular. Yet most structure prediction algorithms handle only linear RNAs. The most straightforward ...
Ivo L. Hofacker, Peter F. Stadler
DSS
2006
116views more  DSS 2006»
15 years 6 months ago
Matching knowledge elements in concept maps using a similarity flooding algorithm
Concept mapping systems used in education and knowledge management emphasize flexibility of representation to enhance learning and facilitate knowledge capture. Collections of con...
Byron Marshall, Hsinchun Chen, Therani Madhusudan