Sciweavers

2477 search results - page 407 / 496
» Approximate extended formulations
Sort
View
CORR
2010
Springer
163views Education» more  CORR 2010»
13 years 10 months ago
Distributed Principal Component Analysis for Wireless Sensor Networks
Abstract: The Principal Component Analysis (PCA) is a data dimensionality reduction technique well-suited for processing data from sensor networks. It can be applied to tasks like ...
Yann-Aël Le Borgne, Sylvain Raybaud, Gianluca...
CSDA
2008
108views more  CSDA 2008»
13 years 10 months ago
The random Tukey depth
The computation of the Tukey depth, also called halfspace depth, is very demanding, even in low dimensional spaces, because it requires that all possible one-dimensional projectio...
J. A. Cuesta-Albertos, A. Nieto-Reyes
CORR
2006
Springer
159views Education» more  CORR 2006»
13 years 10 months ago
Structural Alignments of pseudo-knotted RNA-molecules in polynomial time
An RNA molecule is structured on several layers. The primary and most obvious structure is its sequence of bases, i.e. a word over the alphabet {A, C, G, U}. The higher structure i...
Michael Brinkmeier
FMSD
2006
104views more  FMSD 2006»
13 years 10 months ago
Some ways to reduce the space dimension in polyhedra computations
Convex polyhedra are often used to approximate sets of states of programs involving numerical variables. The manipulation of convex polyhedra relies on the so-called double descri...
Nicolas Halbwachs, David Merchat, Laure Gonnord
IPL
2008
89views more  IPL 2008»
13 years 10 months ago
On the tractability of coloring semirandom graphs
As part of the efforts put in understanding the intricacies of the k-colorability problem, different distributions over k-colorable graphs were analyzed. While the problem is notor...
Julia Böttcher, Dan Vilenchik