Sciweavers

195 search results - page 29 / 39
» Tractable Approximations to Robust Conic Optimization Proble...
Sort
View
CISS
2007
IEEE
14 years 2 months ago
Analog Coding for Delay-Limited Applications
— In this paper, we consider the problem of sending an analog source over an additive white Gaussian noise channel. The traditional analog coding schemes suffer from the threshol...
Mahmoud Taherzadeh, Amir K. Khandani
ICRA
2003
IEEE
130views Robotics» more  ICRA 2003»
14 years 1 months ago
Direct plane tracking in stereo images for mobile navigation
— We present a novel plane tracking algorithm based on the direct update of surface parameters from two stereo images. The plane tracking algorithm is posed as an optimization pr...
Jason J. Corso, Darius Burschka, Gregory D. Hager
TKDE
2012
199views Formal Methods» more  TKDE 2012»
11 years 10 months ago
Subscriber Assignment for Wide-Area Content-Based Publish/Subscribe
— We study the problem of assigning subscribers to brokers in a wide-area content-based publish/subscribe system. A good assignment should consider both subscriber interests in t...
Albert Yu, Pankaj K. Agarwal, Jun Yang
CVPR
2004
IEEE
14 years 10 months ago
Graphical Models for Graph Matching
This paper explores a formulation for attributed graph matching as an inference problem over a hidden Markov Random Field. We approximate the fully connected model with simpler mo...
Dante Augusto Couto Barone, Terry Caelli, Tib&eacu...
TAMC
2009
Springer
14 years 14 days ago
On the Complexity of the Multiple Stack TSP, kSTSP
Given a universal constant k, the multiple Stack Travelling Salesman Problem (kSTSP in short) consists in finding a pickup tour T1 and a delivery tour T2 of n items on two distinc...
Sophie Toulouse, Roberto Wolfler Calvo