Sciweavers

TKDE
2008
126views more  TKDE 2008»
13 years 4 months ago
The Discrete Basis Problem
Matrix decomposition methods represent a data matrix as a product of two smaller matrices: one containing basis vectors that represent meaningful concepts in the data, and another ...
Pauli Miettinen, Taneli Mielikäinen, Aristide...
TIP
2008
131views more  TIP 2008»
13 years 4 months ago
Hyperspectral Image Compression: Adapting SPIHT and EZW to Anisotropic 3-D Wavelet Coding
Abstract--Hyperspectral images present some specific characteristics that should be used by an efficient compression system. In compression, wavelets have shown a good adaptability...
Emmanuel Christophe, Corinne Mailhes, Pierre Duham...
IPL
2007
130views more  IPL 2007»
13 years 4 months ago
Linear structure of bipartite permutation graphs and the longest path problem
The class of bipartite permutation graphs is the intersection of two well known graph classes: bipartite graphs and permutation graphs. A complete bipartite decomposition of a bip...
Ryuhei Uehara, Gabriel Valiente
INFORMATICALT
2007
80views more  INFORMATICALT 2007»
13 years 5 months ago
Recognition Algorithm for Diamond-Free Graphs
In this paper we recall the notion of weakly decomposition, we recall some necessary and sufficient conditions for a graph to admit such a decomposition, we introduce the recognit...
Mihai Talmaciu, Elena Nechita
IJSEKE
2007
52views more  IJSEKE 2007»
13 years 5 months ago
Software Architecture Decomposition Using Attributes
Software architectural design has an enormous effect on downstream software artifacts. Decomposition of functions for the final system is one of the critical steps in software arch...
Chung-Horng Lung, Xia Xu, Marzia Zaman
SMA
2008
ACM
150views Solid Modeling» more  SMA 2008»
13 years 5 months ago
Surface matching using consistent pants decomposition
Surface matching is fundamental to shape computing and various downstream applications. This paper develops a powerful pants decomposition framework for computing maps between sur...
Xin Li, Xianfeng Gu, Hong Qin
MP
2006
110views more  MP 2006»
13 years 5 months ago
Decomposition and Dynamic Cut Generation in Integer Linear Programming
Decomposition algorithms such as Lagrangian relaxation and Dantzig-Wolfe decomposition are well-known methods that can be used to generate bounds for mixed-integer linear programmi...
Ted K. Ralphs, Matthew V. Galati
NPL
2008
100views more  NPL 2008»
13 years 5 months ago
Comparing Combination Rules of Pairwise Neural Networks Classifiers
A decomposition approach to multiclass classification problems consists in decomposing a multiclass problem into a set of binary ones. Decomposition splits the complete multiclass ...
Olivier Lezoray, Hubert Cardot
LMCS
2006
119views more  LMCS 2006»
13 years 5 months ago
The monadic second-order logic of graphs XVI : Canonical graph decompositions
This article establishes that the split decomposition of graphs introduced by Cunnigham, is definable in Monadic Second-Order Logic.This result is actually an instance of a more ge...
Bruno Courcelle
JVCIR
2006
104views more  JVCIR 2006»
13 years 5 months ago
Color image decomposition and restoration
Meyer has recently introduced an image decomposition model to split an image into two components: a geometrical component and a texture (oscillatory) component. Inspired by his wo...
Jean-François Aujol, Sung Ha Kang