Sciweavers

526 search results - page 61 / 106
» Increments of Random Partitions
Sort
View
ICRA
2000
IEEE
176views Robotics» more  ICRA 2000»
14 years 3 days ago
RRT-Connect: An Efficient Approach to Single-Query Path Planning
A simple and efficient randomized algorithm is presented for solving single-query path planning problems in high-dimensional configuration spaces. The method works by incrementall...
James J. Kuffner Jr., Steven M. LaValle
IMAMS
2003
125views Mathematics» more  IMAMS 2003»
13 years 10 months ago
A Graph-Spectral Method for Surface Height Recovery
This paper describes a graph-spectral method for 3D surface integration. The algorithm takes as its input a 2D field of surface normal estimates, delivered, for instance, by a sh...
Antonio Robles-Kelly, Edwin R. Hancock
FS
2011
168views more  FS 2011»
12 years 12 months ago
Gamma expansion of the Heston stochastic volatility model
Abstract We derive an explicit representation of the transitions of the Heston stochastic volatility model and use it for fast and accurate simulation of the model. Of particular i...
Paul Glasserman, Kyoung-Kuk Kim
ICDE
2010
IEEE
244views Database» more  ICDE 2010»
14 years 8 months ago
Reliable Storage and Querying for Collaborative Data Sharing Systems
The sciences, business confederations, and medicine urgently need infrastructure for sharing data and updates among collaborators' constantly changing, heterogeneous databases...
Nicholas E. Taylor, Zachary G. Ives
KDD
2004
ACM
132views Data Mining» more  KDD 2004»
14 years 9 months ago
A probabilistic framework for semi-supervised clustering
Unsupervised clustering can be significantly improved using supervision in the form of pairwise constraints, i.e., pairs of instances labeled as belonging to same or different clu...
Sugato Basu, Mikhail Bilenko, Raymond J. Mooney