Sciweavers

2827 search results - page 333 / 566
» Robustness of PSPACE-complete sets
Sort
View
CORR
2008
Springer
82views Education» more  CORR 2008»
15 years 6 months ago
Adaptive Dynamics of Realistic Small-World Networks
Continuing in the steps of Jon Kleinberg's and others celebrated work on decentralized search, we conduct an experimental analysis of destination sampling, a dynamic algorithm...
Olof Mogren, Oskar Sandberg, Vilhelm Verendel, Dev...
CORR
2008
Springer
86views Education» more  CORR 2008»
15 years 6 months ago
Fast computation of the median by successive binning
In many important problems, one uses the median instead of the mean to estimate a population's center, since the former is more robust. But in general, computing the median i...
Ryan J. Tibshirani
CVIU
2008
207views more  CVIU 2008»
15 years 6 months ago
A differential geometric approach to representing the human actions
This paper presents a novel representation for human actions which encodes the variations in the shape and motion of the performing actor. When an actor performs an action, at eac...
Alper Yilmaz, Mubarak Shah
EOR
2010
116views more  EOR 2010»
15 years 6 months ago
Speeding up continuous GRASP
Continuous GRASP (C-GRASP) is a stochastic local search metaheuristic for finding cost-efficient solutions to continuous global optimization problems subject to box constraints (Hi...
Michael J. Hirsch, Panos M. Pardalos, Mauricio G. ...
CN
2006
88views more  CN 2006»
15 years 6 months ago
Relevance of massively distributed explorations of the Internet topology: Qualitative results
Internet maps are generally constructed using the traceroute tool from a few sources to many destinations. It appeared recently that this exploration process gives a partial and bi...
Jean-Loup Guillaume, Matthieu Latapy, Damien Magon...