Sciweavers

1439 search results - page 85 / 288
» Fast approximation of centrality
Sort
View
ICIP
1995
IEEE
15 years 1 months ago
Fast image search using a multiscale stochastic model
Searching an image for the occurrence of a pattern or a template is an essential step in a number of image processing applications. We propose a new multiresolution matching crite...
S. Sista, Charles A. Bouman, Jan P. Allebach
NIPS
2008
14 years 11 months ago
Fast Rates for Regularized Objectives
We study convergence properties of empirical minimization of a stochastic strongly convex objective, where the stochastic component is linear. We show that the value attained by t...
Karthik Sridharan, Shai Shalev-Shwartz, Nathan Sre...
RSS
2007
134views Robotics» more  RSS 2007»
14 years 11 months ago
A Fast and Practical Algorithm for Generalized Penetration Depth Computation
— We present an efficient algorithm to compute the generalized penetration depth (PDg) between rigid models. Given two overlapping objects, our algorithm attempts to compute the...
Liangjun Zhang, Young J. Kim, Dinesh Manocha
VMV
2008
165views Visualization» more  VMV 2008»
14 years 11 months ago
Fast Global Labeling for Real-Time Stereo Using Multiple Plane Sweeps
This work presents a real-time, data-parallel approach for global label assignment on regular grids. The labels are selected according to a Markov random field energy with a Potts...
Christopher Zach, David Gallup, Jan-Michael Frahm,...
BMCBI
2008
121views more  BMCBI 2008»
14 years 10 months ago
A simple and fast heuristic for protein structure comparison
Background: Protein structure comparison is a key problem in bioinformatics. There exist several methods for doing protein comparison, being the solution of the Maximum Contact Ma...
David A. Pelta, Juan Ramón González,...