Sciweavers

7006 search results - page 1193 / 1402
» Approximation Algorithms
Sort
View
JGO
2010
100views more  JGO 2010»
15 years 1 months ago
On convex relaxations of quadrilinear terms
The best known method to find exact or at least -approximate solutions to polynomial programming problems is the spatial Branch-and-Bound algorithm, which rests on computing lower...
Sonia Cafieri, Jon Lee, Leo Liberti
CVPR
2006
IEEE
16 years 8 months ago
Shape Guided Object Segmentation
We construct a Bayesian model that integrates topdown with bottom-up criteria, capitalizing on their relative merits to obtain figure-ground segmentation that is shape-specific an...
Eran Borenstein, Jitendra Malik
ICCV
2001
IEEE
16 years 8 months ago
Determining Reflectance Parameters and Illumination Distribution from a Sparse Set of Images for View-dependent Image Synthesis
A framework for photo-realistic view-dependent image synthesis of a shiny object from a sparse set of images and a geometric model is proposed. Each image is aligned with the 3D m...
Ko Nishino, Zhengyou Zhang, Katsushi Ikeuchi
ICPR
2008
IEEE
16 years 29 days ago
A novel method for real-time multiple moving targets detection from moving IR camera
This paper presents a novel method for detecting multiple moving targets in real-time from infrared (IR) image sequences collected by an airborne IR camera. This novel method is b...
Fenghui Yao, Ali Sekmen, Mohan Malkani
IPPS
2006
IEEE
16 years 16 days ago
Design and analysis of a multi-dimensional data sampling service for large scale data analysis applications
Sampling is a widely used technique to increase efficiency in database and data mining applications operating on large dataset. In this paper we present a scalable sampling imple...
Xi Zhang, Tahsin M. Kurç, Joel H. Saltz, Sr...
« Prev « First page 1193 / 1402 Last » Next »