Sciweavers

1547 search results - page 39 / 310
» Solving Knapsack Problems in a Sticker Based Model
Sort
View
AAAI
2012
11 years 10 months ago
Colorization by Matrix Completion
Given a monochrome image and some manually labeled pixels, the colorization problem is a computer-assisted process of adding color to the monochrome image. This paper proposes a n...
Shusen Wang, Zhihua Zhang
NN
2002
Springer
136views Neural Networks» more  NN 2002»
13 years 7 months ago
Bayesian model search for mixture models based on optimizing variational bounds
When learning a mixture model, we suffer from the local optima and model structure determination problems. In this paper, we present a method for simultaneously solving these prob...
Naonori Ueda, Zoubin Ghahramani
ICECCS
2010
IEEE
161views Hardware» more  ICECCS 2010»
13 years 7 months ago
Model Checking Round-Based Distributed Algorithms
—In the field of distributed computing, there are many round-based algorithms to solve fundamental problems, such as leader election and distributed consensus. Due to the nature...
Xin An, Jun Pang
IROS
2006
IEEE
217views Robotics» more  IROS 2006»
14 years 1 months ago
Active SLAM using Model Predictive Control and Attractor based Exploration
– Active SLAM poses the challenge for an autonomous robot to plan efficient paths simultaneous to the SLAM process. The uncertainties of the robot, map and sensor measurements, a...
Cindy Leung, Shoudong Huang, Gamini Dissanayake
ICDE
2009
IEEE
130views Database» more  ICDE 2009»
14 years 9 months ago
A Latent Topic Model for Complete Entity Resolution
In bibliographies like DBLP and Citeseer, there are three kinds of entity-name problems that need to be solved. First, multiple entities share one name, which is called the name sh...
Liangcai Shu, Bo Long, Weiyi Meng