Sciweavers

1289 search results - page 224 / 258
» Complexity of Counting the Optimal Solutions
Sort
View
OL
2008
79views more  OL 2008»
14 years 9 months ago
A simpler and tighter redundant Klee-Minty construction
By introducing redundant Klee-Minty examples, we have previously shown that the central path can be bent along the edges of the Klee-Minty cubes, thus having 2n - 2 sharp turns in...
Eissa Nematollahi, Tamás Terlaky
IEEEMM
2007
146views more  IEEEMM 2007»
14 years 9 months ago
Learning Microarray Gene Expression Data by Hybrid Discriminant Analysis
— Microarray technology offers a high throughput means to study expression networks and gene regulatory networks in cells. The intrinsic nature of high dimensionality and small s...
Yijuan Lu, Qi Tian, Maribel Sanchez, Jennifer L. N...
AICOM
2005
91views more  AICOM 2005»
14 years 9 months ago
Multiagent systems for cardiac pacing simulation and control
Abstract. Simulating and controlling physiological phenomena are complex tasks to tackle. This is due to the fact that physiological processes are usually described by a set of par...
Francesco Amigoni, Alessandro Beda, Nicola Gatti
TCS
2008
14 years 9 months ago
Bincoloring
We introduce a new problem that was motivated by a (more complicated) problem arising in a robotized assembly environment. The bin coloring problem is to pack unit size colored it...
Sven Oliver Krumke, Willem de Paepe, Jörg Ram...
TMI
2008
140views more  TMI 2008»
14 years 9 months ago
Hamilton-Jacobi Skeleton on Cortical Surfaces
Abstract-- In this paper, we propose a new method to construct graphical representations of cortical folding patterns by computing skeletons on triangulated cortical surfaces. In o...
Yonggang Shi, Paul M. Thompson, Ivo D. Dinov, Arth...