Sciweavers

359 search results - page 51 / 72
» Solving Geometric Covering Problems by Data Reduction
Sort
View
78
Voted
ICPR
2006
IEEE
16 years 25 days ago
Competitive Mixtures of Simple Neurons
We propose a competitive finite mixture of neurons (or perceptrons) for solving binary classification problems. Our classifier includes a prior for the weights between different n...
Karthik Sridharan, Matthew J. Beal, Venu Govindara...
CVPR
2010
IEEE
1135views Computer Vision» more  CVPR 2010»
15 years 7 months ago
Towards Weakly Supervised Semantic Segmentation by Means of Multiple Instance and Multitask Learning.
We address the task of learning a semantic segmentation from weakly supervised data. Our aim is to devise a system that predicts an object label for each pixel by making use of on...
Alexander Vezhnevets, Joachim Buhmann
DATE
2009
IEEE
131views Hardware» more  DATE 2009»
15 years 6 months ago
Communication minimization for in-network processing in body sensor networks: A buffer assignment technique
—Body sensor networks are emerging as a promising platform for healthcare monitoring. These systems are composed of battery-operated embedded devices which process physiological ...
Hassan Ghasemzadeh, Nisha Jain, Marco Sgroi, Roozb...
SIPS
2008
IEEE
15 years 6 months ago
Analysis of belief propagation for hardware realization
Belief propagation has become a popular technique for solving computer vision problems, such as stereo estimation and image denoising. However, it requires large memory and bandwi...
Chao-Chung Cheng, Chia-Kai Liang, Yen-Chieh Lai, H...
87
Voted
EOR
2006
80views more  EOR 2006»
14 years 11 months ago
Vehicle routing and crew scheduling for metropolitan mail distribution at Australia Post
This paper presents a new multi-depot combined vehicle and crew scheduling algorithm, and uses it, in conjunction with a heuristic vehicle routing algorithm, to solve the intra-ci...
B. L. Hollis, M. A. Forbes, B. E. Douglas