Sciweavers

1329 search results - page 34 / 266
» Randomly Sampling Molecules
Sort
View
FOCS
2006
IEEE
14 years 1 months ago
Fast Algorithms for Logconcave Functions: Sampling, Rounding, Integration and Optimization
We prove that the hit-and-run random walk is rapidly mixing for an arbitrary logconcave distribution starting from any point in the support. This extends the work of [26], where t...
László Lovász, Santosh Vempal...
TSP
2010
13 years 2 months ago
On entropy rate for the complex domain and its application to i.i.d. sampling
We derive the entropy rate formula for a complex Gaussian random process by using a widely linear model. The resulting expression is general and applicable to both circular and non...
Wei Xiong, Hualiang Li, Tülay Adali, Yi-Ou Li...
INFOCOM
2011
IEEE
12 years 11 months ago
Modeling residual-geometric flow sampling
Abstract—Traffic monitoring and estimation of flow parameters in high speed routers have recently become challenging as the Internet grew in both scale and complexity. In this ...
Xiaoming Wang, Xiaoyong Li, Dmitri Loguinov
ICRA
2009
IEEE
152views Robotics» more  ICRA 2009»
14 years 2 months ago
Reachability-guided sampling for planning under differential constraints
— Rapidly-exploring Random Trees (RRTs) are widely used to solve large planning problems where the scope prohibits the feasibility of deterministic solvers, but the efficiency o...
Alexander C. Shkolnik, Matthew Walter, Russ Tedrak...
EUROPAR
1997
Springer
13 years 12 months ago
Sample Sort on Meshes
In this paper various algorithms for sorting on processor networks are considered. We focus on meshes, but the results can be generalized easily to other decomposable architecture...
Jop F. Sibeyn