Sciweavers

1084 search results - page 91 / 217
» Optimal worm-scanning method using vulnerable-host distribut...
Sort
View
MOR
2007
149views more  MOR 2007»
15 years 3 months ago
LP Rounding Approximation Algorithms for Stochastic Network Design
Real-world networks often need to be designed under uncertainty, with only partial information and predictions of demand available at the outset of the design process. The field ...
Anupam Gupta, R. Ravi, Amitabh Sinha
GECCO
2007
Springer
200views Optimization» more  GECCO 2007»
15 years 10 months ago
Adaptive variance scaling in continuous multi-objective estimation-of-distribution algorithms
Recent research into single–objective continuous Estimation– of–Distribution Algorithms (EDAs) has shown that when maximum–likelihood estimations are used for parametric d...
Peter A. N. Bosman, Dirk Thierens
ACCV
2010
Springer
14 years 11 months ago
Towards Full 3D Helmholtz Stereovision Algorithms
Helmholtz stereovision methods are limited to binocular stereovision or depth maps reconstruction. In this paper, we extend these methods to recover the full 3D shape of the object...
Amaël Delaunoy, Emmanuel Prados, Peter N. Bel...
VLDB
1998
ACM
101views Database» more  VLDB 1998»
15 years 8 months ago
On Optimal Node Splitting for R-trees
The problem of finding an optimal bipartition of a rectangle set has a direct impact on query performance of dynamic R-trees. During update operations, overflowed nodes need to be...
Yván J. García, Mario A. Lopez, Scot...
CVPR
2012
IEEE
13 years 6 months ago
See all by looking at a few: Sparse modeling for finding representative objects
We consider the problem of finding a few representatives for a dataset, i.e., a subset of data points that efficiently describes the entire dataset. We assume that each data poi...
Ehsan Elhamifar, Guillermo Sapiro, René Vid...