Sciweavers

1032 search results - page 149 / 207
» Extended Computation Tree Logic
Sort
View
CVPR
2006
IEEE
15 years 3 months ago
New Method of Probability Density Estimation with Application to Mutual Information Based Image Registration
We present a new, robust and computationally efficient method for estimating the probability density of the intensity values in an image. Our approach makes use of a continuous r...
Ajit Rajwade, Arunava Banerjee, Anand Rangarajan
IPPS
1998
IEEE
15 years 2 months ago
The Effect of the Router Arbitration Policy on the Scalability of ServerNet
In this paper we extend a previously introduced method for optimizing the arbitration policy employed by ServerNet routers and we evaluate the method's effect on scalability....
Vladimir Shurbanov, Dimiter R. Avresky, Robert W. ...

Publication
141views
13 years 8 months ago
Measures of Diversity for Populations and Distances Between Individuals with Highly Reorganizable Genomes
In this paper we address the problem of defining a measure of diversity for a population of individuals whose genome can be subjected to major reorganizations during the evolution...
Claudio Mattiussi, Markus Waibel, Dario Floreano
ESA
2009
Springer
143views Algorithms» more  ESA 2009»
15 years 4 months ago
On Optimally Partitioning a Text to Improve Its Compression
In this paper we investigate the problem of partitioning an input string T in such a way that compressing individually its parts via a basecompressor C gets a compressed output th...
Paolo Ferragina, Igor Nitto, Rossano Venturini
ICALP
1994
Springer
15 years 1 months ago
On the Cost of Recomputing: Tight Bounds on Pebbling with Faults
We introduce a formal framework to study the time and space complexity of computing with faulty memory. For the fault-free case, time and space complexities were studied using the...
Yonatan Aumann, Judit Bar-Ilan, Uriel Feige