Sciweavers

2312 search results - page 217 / 463
» The complexity of estimating min-entropy
Sort
View
ICCV
1999
IEEE
16 years 8 months ago
Fluid Motion Recovery by Coupling Dense and Parametric Vector Fields
In this paper we address the problem of estimating and analyzing the motion in image sequences that involve fluid phenomena. In this context standard motion estimation techniques ...
Étienne Mémin, Patrick Pérez
IMC
2007
ACM
15 years 8 months ago
Compressed network monitoring for ip and all-optical networks
We address the problem of efficient end-to-end network monitoring of path metrics in communication networks. Our goal is to minimize the number of measurements or monitors requir...
Mark Coates, Yvan Pointurier, Michael Rabbat
BMCBI
2008
134views more  BMCBI 2008»
15 years 6 months ago
Stability analysis of mixtures of mutagenetic trees
Background: Mixture models of mutagenetic trees are evolutionary models that capture several pathways of ordered accumulation of genetic events observed in different subsets of pa...
Jasmina Bogojeska, Thomas Lengauer, Jörg Rahn...
ICDE
2012
IEEE
240views Database» more  ICDE 2012»
13 years 9 months ago
Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme
—Shortest distance query between two nodes is a fundamental operation in large-scale networks. Most existing methods in the literature take a landmark embedding approach, which s...
Miao Qiao, Hong Cheng, Lijun Chang, Jeffrey Xu Yu
163
Voted
GPEM
2000
121views more  GPEM 2000»
15 years 6 months ago
Bayesian Methods for Efficient Genetic Programming
ct. A Bayesian framework for genetic programming GP is presented. This is motivated by the observation that genetic programming iteratively searches populations of fitter programs ...
Byoung-Tak Zhang