Sciweavers

389 search results - page 72 / 78
» Computational Alternatives to Random Number Generators
Sort
View
PAMI
2011
13 years 2 months ago
Greedy Learning of Binary Latent Trees
—Inferring latent structures from observations helps to model and possibly also understand underlying data generating processes. A rich class of latent structures are the latent ...
Stefan Harmeling, Christopher K. I. Williams
SPAA
2005
ACM
14 years 1 months ago
Dynamic page migration with stochastic requests
The page migration problem is one of subproblems of data management in networks. It occurs in a distributed network of processors sharing one indivisible memory page of size D. Du...
Marcin Bienkowski
CVPR
2010
IEEE
14 years 1 months ago
ARISTA - Image Search to Annotation on Billions of Web Photos
Though it has cost great research efforts for decades, object recognition is still a challenging problem. Traditional methods based on machine learning or computer vision are stil...
Xin-Jing Wang, Ming Liu, Lei Zhang, Yi Li, Wei-Yin...
CSCLP
2008
Springer
13 years 9 months ago
An Efficient Decision Procedure for Functional Decomposable Theories Based on Dual Constraints
Abstract. Over the last decade, first-order constraints have been efficiently used in the artificial intelligence world to model many kinds of complex problems such as: scheduling,...
Khalil Djelloul
EOR
2007
100views more  EOR 2007»
13 years 7 months ago
Parallel radial basis function methods for the global optimization of expensive functions
We introduce a master–worker framework for parallel global optimization of computationally expensive functions using response surface models. In particular, we parallelize two r...
Rommel G. Regis, Christine A. Shoemaker