Sciweavers

1380 search results - page 251 / 276
» Computing the optimal strategy to commit to
Sort
View
PC
2010
196views Management» more  PC 2010»
13 years 6 months ago
Solving path problems on the GPU
We consider the computation of shortest paths on Graphic Processing Units (GPUs). The blocked recursive elimination strategy we use is applicable to a class of algorithms (such as...
Aydin Buluç, John R. Gilbert, Ceren Budak
CVPR
2009
IEEE
15 years 3 months ago
A Revisit of Generative Model for Automatic Image Annotation using Markov Random Fields
Much research effort on Automatic Image Annotation (AIA) has been focused on Generative Model, due to its well formed theory and competitive performance as compared with many we...
Yu Xiang (Fudan University), Xiangdong Zhou (Fudan...
VIS
2004
IEEE
222views Visualization» more  VIS 2004»
14 years 9 months ago
Non-Linear Model Fitting to Parameterize Diseased Blood Vessels
Accurate estimation of vessel parameters is a prerequisite for automated visualization and analysis of healthy and diseased blood vessels. The objective of this research is to est...
Alexandra La Cruz, Matús Straka, Arnold K&o...
MOBIHOC
2008
ACM
14 years 7 months ago
Delegation forwarding
Mobile opportunistic networks are characterized by unpredictable mobility, heterogeneity of contact rates and lack of global information. Successful delivery of messages at low co...
Vijay Erramilli, Mark Crovella, Augustin Chaintrea...
ICS
2010
Tsinghua U.
14 years 5 months ago
Distribution-Specific Agnostic Boosting
We consider the problem of boosting the accuracy of weak learning algorithms in the agnostic learning framework of Haussler (1992) and Kearns et al. (1992). Known algorithms for t...
Vitaly Feldman