Sciweavers

562 search results - page 78 / 113
» Simple Randomized Algorithms for Closest Pair Problems
Sort
View
TPDS
2008
136views more  TPDS 2008»
14 years 9 months ago
Data Gathering with Tunable Compression in Sensor Networks
We study the problem of constructing a data gathering tree over a wireless sensor network in order to minimize the total energy for compressing and transporting information from a ...
Yang Yu, Bhaskar Krishnamachari, Viktor K. Prasann...
ICPR
2010
IEEE
15 years 4 months ago
A Unified Probabilistic Approach to Feature Matching and Object Segmentation
This paper deals with feature matching and segmentation of common objects in a pair of images, simultaneously. For the feature matching problem, the matching likelihoods of all fea...
Tae Hoon Kim (Seoul National University), Kyoung M...
COLT
2007
Springer
15 years 3 months ago
Multi-view Regression Via Canonical Correlation Analysis
In the multi-view regression problem, we have a regression problem where the input variable (which is a real vector) can be partitioned into two different views, where it is assum...
Sham M. Kakade, Dean P. Foster
ECCV
2008
Springer
15 years 8 months ago
Toward Global Minimum through Combined Local Minima
There are many local and greedy algorithms for energy minimization over Markov Random Field (MRF) such as iterated condition mode (ICM) and various gradient descent methods. Local ...
Ho Yub Jung, Kyoung Mu Lee, Sang Uk Lee
EOR
2007
88views more  EOR 2007»
14 years 9 months ago
The stochastic location model with risk pooling
In this paper, we present a stochastic version of the Location Model with Risk Pooling (LMRP) that optimizes location, inventory, and allocation decisions under random parameters ...
Lawrence V. Snyder, Mark S. Daskin, Chung-Piaw Teo