Sciweavers

2869 search results - page 279 / 574
» Metropolis-Hastings algorithms with adaptive proposals
Sort
View
CGF
2006
177views more  CGF 2006»
15 years 6 months ago
Direct (Re)Meshing for Efficient Surface Processing
We propose a novel surface remeshing algorithm. While many remeshing algorithms are based on global parametrization or local mesh optimization, our algorithm is closely related to...
John M. Schreiner, Carlos Eduardo Scheidegger, Sha...
ICC
2011
IEEE
272views Communications» more  ICC 2011»
14 years 6 months ago
Dynamic Anycast Routing and Wavelength Assignment in WDM Networks Using Ant Colony Optimization (ACO)
—Ant colony optimization (ACO) is a probabilistic technique used for solving complex computational problems, such as finding optimal routes in networks. It has been proved to pe...
Kavitha Bhaskaran, Joan Triay, Vinod Vokkarane
SIGIR
2010
ACM
15 years 4 months ago
DivQ: diversification for keyword search over structured databases
Keyword queries over structured databases are notoriously ambiguous. No single interpretation of a keyword query can satisfy all users, and multiple interpretations may yield over...
Elena Demidova, Peter Fankhauser, Xuan Zhou, Wolfg...
ICCV
2009
IEEE
15 years 4 months ago
Realtime background subtraction from dynamic scenes
This paper examines the problem of moving object detection. More precisely, it addresses the difficult scenarios where background scene textures in the video might change over tim...
Li Cheng, Minglun Gong
CVPR
2011
IEEE
15 years 4 months ago
Dynamic Batch Mode Active Learning
Active learning techniques have gained popularity in reducing human effort to annotate data instances for inducing a classifier. When faced with large quantities of unlabeled dat...
Shayok Chakraborty, Vineeth Balasubramanian, Sethu...