Sciweavers

620 search results - page 33 / 124
» A Simple and Fast Min-cut Algorithm
Sort
View
AAAI
1998
15 years 3 months ago
Fast Transformation of Temporal Plans for Efficient Execution
Temporal plans permit significant flexibility in specifying the occurrence time of events. Plan execution can make good use of that flexibility. However, the advantage of executio...
Ioannis Tsamardinos, Nicola Muscettola, Paul H. Mo...
CVPR
2007
IEEE
16 years 4 months ago
Fast Keypoint Recognition in Ten Lines of Code
While feature point recognition is a key component of modern approaches to object detection, existing approaches require computationally expensive patch preprocessing to handle pe...
Mustafa Özuysal, Pascal Fua, Vincent Lepetit
PERCOM
2004
ACM
16 years 1 months ago
Employing User Feedback for Fast, Accurate, Low-Maintenance Geolocationing
One way to improve inferences on sensor data is to tune the algorithms through a time-consuming offline procedure. A less expensive, and potentially more accurate method is to use...
Ezekiel S. Bhasker, Steven W. Brown, William G. Gr...
ICML
2008
IEEE
16 years 2 months ago
Training restricted Boltzmann machines using approximations to the likelihood gradient
A new algorithm for training Restricted Boltzmann Machines is introduced. The algorithm, named Persistent Contrastive Divergence, is different from the standard Contrastive Diverg...
Tijmen Tieleman
CGF
1999
159views more  CGF 1999»
15 years 1 months ago
Fast Polyhedral Cell Sorting for Interactive Rendering of Unstructured Grids
Direct volume rendering based on projective methods works by projecting, in visibility order, the polyhedral cells of a mesh onto the image plane, and incrementally compositing th...
João Comba, James T. Klosowski, Nelson L. M...