Sciweavers

774 search results - page 60 / 155
» A subdivision-based algorithm for the sparse resultant
Sort
View
ICASSP
2010
IEEE
15 years 1 months ago
Semi-Supervised Hyperspectral Unmixing via the Weighted Lasso
In this paper a novel approach for semi-supervised hyperspectral unmixing is presented. First, it is shown that this problem inherently accepts a sparse solution. Then, based on t...
Konstantinos Themelis, Athanasios A. Rontogiannis,...
CORR
2010
Springer
100views Education» more  CORR 2010»
15 years 1 months ago
Convex Relaxations for Subset Selection
We use convex relaxation techniques to produce lower bounds on the optimal value of subset selection problems and generate good approximate solutions. We then explicitly bound the...
Francis Bach, Selin Damla Ahipasaoglu, Alexandre d...
EUROGRAPHICS
2010
Eurographics
15 years 10 months ago
Adding Depth to Cartoons Using Sparse Depth (In)equalities
This paper presents a novel interactive approach for adding depth information into hand-drawn cartoon images and animations. In comparison to previous depth assignment techniques ...
Daniel Sýkora, David Sedlacek, Sun Jinchao, John ...
IJCNN
2006
IEEE
15 years 7 months ago
Sparse Bayesian Models: Bankruptcy-Predictors of Choice?
Abstract— Making inferences and choosing appropriate responses based on incomplete, uncertainty and noisy data is challenging in financial settings particularly in bankruptcy de...
Bernardete Ribeiro, Armando Vieira, João Ca...
MOBIHOC
2004
ACM
15 years 6 months ago
A message ferrying approach for data delivery in sparse mobile ad hoc networks
Mobile Ad Hoc Networks (MANETs) provide rapidly deployable and self-configuring network capacity required in many critical applications, e.g., battlefields, disaster relief and ...
Wenrui Zhao, Mostafa H. Ammar, Ellen W. Zegura