Sciweavers

6365 search results - page 1221 / 1273
» Fast Local Computation Algorithms
Sort
View
ICCV
2003
IEEE
16 years 2 months ago
Feature Selection for Unsupervised and Supervised Inference: the Emergence of Sparsity in a Weighted-based Approach
The problem of selecting a subset of relevant features in a potentially overwhelming quantity of data is classic and found in many branches of science. Examples in computer vision...
Lior Wolf, Amnon Shashua
ICDE
2009
IEEE
159views Database» more  ICDE 2009»
15 years 7 months ago
ApproxRank: Estimating Rank for a Subgraph
Abstract— Customized semantic query answering, personalized search, focused crawlers and localized search engines frequently focus on ranking the pages contained within a subgrap...
Yao Wu, Louiqa Raschid
108
Voted
EMSOFT
2004
Springer
15 years 6 months ago
Approximation of the worst-case execution time using structural analysis
We present a technique to approximate the worst-case execution time that combines structural analysis with a loop-bounding algorithm based on local induction variable analysis. St...
Matteo Corti, Thomas R. Gross
212
Voted
TCSV
2011
14 years 7 months ago
Integrating Spatio-Temporal Context With Multiview Representation for Object Recognition in Visual Surveillance
—We present in this paper an integrated solution to rapidly recognizing dynamic objects in surveillance videos by exploring various contextual information. This solution consists...
Xiaobai Liu, Liang Lin, Shuicheng Yan, Hai Jin, We...
CVPR
2011
IEEE
14 years 4 months ago
Topologically-Robust 3D Shape Matching Based on Diffusion Geometry and Seed Growing
3D Shape matching is an important problem in computer vision. One of the major difficulties in finding dense correspondences between 3D shapes is related to the topological disc...
Avinash Sharma, Radu Horaud, Jan Cech, Edmond Boye...
« Prev « First page 1221 / 1273 Last » Next »