Sciweavers

13784 search results - page 51 / 2757
» On Computing Functions with Uncertainty
Sort
View
CVPR
2012
IEEE
11 years 11 months ago
Seeded watershed cut uncertainty estimators for guided interactive segmentation
Watershed cuts are among the fastest segmentation algorithms and therefore well suited for interactive segmentation of very large 3D data sets. To minimize the number of user inte...
Christoph N. Straehle, Ullrich Köthe, Graham ...
ICCV
2003
IEEE
14 years 10 months ago
Bayesian Clustering of Optical Flow Fields
We present a method for unsupervised learning of classes of motions in video. We project optical flow fields to a complete, orthogonal, a-priori set of basis functions in a probab...
Jesse Hoey, James J. Little
CPAIOR
2007
Springer
14 years 3 months ago
Replenishment Planning for Stochastic Inventory Systems with Shortage Cost
One of the most important policies adopted in inventory control is the (R,S) policy (also known as the “replenishment cycle” policy). Under the non-stationary demand assumption...
Roberto Rossi, Armagan Tarim, Brahim Hnich, Steven...
MHCI
2005
Springer
14 years 2 months ago
GpsTunes: controlling navigation via audio feedback
We combine the functionality of a mobile Global Positioning System (GPS) with that of an MP3 player, implemented on a PocketPC, to produce a handheld system capable of guiding a u...
Steven Strachan, Parisa Eslambolchilar, Roderick M...
GECCO
2004
Springer
118views Optimization» more  GECCO 2004»
14 years 2 months ago
Adaptive Sampling for Noisy Problems
Abstract. The usual approach to deal with noise present in many realworld optimization problems is to take an arbitrary number of samples of the objective function and use the samp...
Erick Cantú-Paz