Sciweavers

7648 search results - page 347 / 1530
» A Data Locality Optimizing Algorithm
Sort
View
CPM
2000
Springer
141views Combinatorics» more  CPM 2000»
15 years 7 months ago
A Lower Bound for the Breakpoint Phylogeny Problem
Breakpoint phylogenies methods have been shown to be an effective way to extract phylogenetic information from gene order data. Currently, the only practical breakpoint phylogeny a...
David Bryant
IM
2007
15 years 4 months ago
Approximating Personalized PageRank with Minimal Use of Web Graph Data
Abstract. In this paper, we consider the problem of calculating fast and accurate approximations to the personalized PageRank score of a webpage. We focus on techniques to improve ...
David Gleich, Marzia Polito
128
Voted
IVC
2007
142views more  IVC 2007»
15 years 4 months ago
Fast stochastic optimization for articulated structure tracking
Recently, an optimization approach for fast visual tracking of articulated structures based on Stochastic Meta-Descent (SMD) [7] has been presented. SMD is a gradient descent with...
Matthieu Bray, Esther Koller-Meier, Nicol N. Schra...
ICCV
2011
IEEE
14 years 4 months ago
Optimal Landmark Detection using Shape Models and Branch and Bound
Fitting statistical 2D and 3D shape models to images is necessary for a variety of tasks, such as video editing and face recognition. Much progress has been made on local fitting...
Brian Amberg, Thomas Vetter
ICMCS
2006
IEEE
119views Multimedia» more  ICMCS 2006»
15 years 10 months ago
Optimal Error Protection of Progressively Compressed 3D Meshes
Given a number of available layers of source data and a transmission bit budget, we propose an algorithm that determines how many layers should be sent and how many protection bit...
Shakeel Ahmad, Raouf Hamzaoui