Sciweavers

5995 search results - page 878 / 1199
» Algorithmic Game Theory
Sort
View
GECCO
2005
Springer
186views Optimization» more  GECCO 2005»
16 years 6 days ago
Subproblem optimization by gene correlation with singular value decomposition
Several ways of using singular value decomposition (SVD), a linear algebra technique typically used for information retrieval, to decompose problems into subproblems are investiga...
Jacob G. Martin
ESA
2004
Springer
126views Algorithms» more  ESA 2004»
16 years 2 days ago
Path Decomposition Under a New Cost Measure with Applications to Optical Network Design
We introduce a problem directly inspired by its application to DWDM (dense wavelength division multiplexing) network design. We are given a set of demands to be carried over a netw...
Elliot Anshelevich, Lisa Zhang
APPROX
2008
Springer
142views Algorithms» more  APPROX 2008»
15 years 8 months ago
Approximating Maximum Subgraphs without Short Cycles
We study approximation algorithms, integrality gaps, and hardness of approximation, of two problems related to cycles of "small" length k in a given graph. The instance f...
Guy Kortsarz, Michael Langberg, Zeev Nutov
COMPGEOM
2008
ACM
15 years 8 months ago
Robust construction of the three-dimensional flow complex
The Delaunay triangulation and its dual the Voronoi diagram are ubiquitous geometric complexes. From a topological standpoint, the connection has recently been made between these ...
Frédéric Cazals, Aditya G. Parameswa...
BMCBI
2010
110views more  BMCBI 2010»
15 years 6 months ago
TimeDelay-ARACNE: Reverse engineering of gene networks from time-course data by an information theoretic approach
Background: One of main aims of Molecular Biology is the gain of knowledge about how molecular components interact each other and to understand gene function regulations. Using mi...
Pietro Zoppoli, Sandro Morganella, Michele Ceccare...