Sciweavers

674 search results - page 56 / 135
» Separating Structure from Interestingness
Sort
View
MP
2006
110views more  MP 2006»
13 years 10 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
ANSOFT
2002
171views more  ANSOFT 2002»
13 years 9 months ago
OPM/Web - Object-Process Methodology for Developing Web Applications
Web applications can be classified as hybrids between hypermedia and information systems. They have a relatively simple distributed architecture from the user viewpoint, but a comp...
Iris Reinhartz-Berger, Dov Dori, Shmuel Katz
MICCAI
2010
Springer
13 years 8 months ago
Manifold Learning for Biomarker Discovery in MR Imaging
We propose a framework for the extraction of biomarkers from low-dimensional manifolds representing inter- and intra-subject brain variation in MR image data. The coordinates of ea...
Robin Wolz, Paul Aljabar, Joseph V. Hajnal, Daniel...
CVPR
2008
IEEE
14 years 12 months ago
Exploiting side information in locality preserving projection
Even if the class label information is unknown, side information represents some equivalence constraints between pairs of patterns, indicating whether pairs originate from the sam...
Senjian An, Wanquan Liu, Svetha Venkatesh
ICSE
2008
IEEE-ACM
14 years 10 months ago
CCVisu: automatic visual software decomposition
Understanding the structure of large existing (and evolving) software systems is a major challenge for software engineers. In reverse engineering, we aim to compute, for a given s...
Dirk Beyer