Sciweavers

3656 search results - page 264 / 732
» Compact Location Problems
Sort
View
BMCBI
2007
166views more  BMCBI 2007»
15 years 6 months ago
How to decide which are the most pertinent overly-represented features during gene set enrichment analysis
Background: The search for enriched features has become widely used to characterize a set of genes or proteins. A key aspect of this technique is its ability to identify correlati...
Roland Barriot, David J. Sherman, Isabelle Dutour
ENTCS
2002
181views more  ENTCS 2002»
15 years 6 months ago
Alias verification for Fortran code optimization
Abstract: Alias analysis for Fortran is less complicated than for programming languages with pointers but many real Fortran programs violate the standard: a formal parameter or a c...
Thi Viet Nga Nguyen, François Irigoin
MICCAI
2007
Springer
16 years 7 months ago
Statistical Shape Modeling Using MDL Incorporating Shape, Appearance, and Expert Knowledge
Abstract. We propose a highly automated approach to the point correspondence problem for anatomical shapes in medical images. Manual landmarking is performed on a small subset of t...
Aaron D. Ward, Ghassan Hamarneh
SODA
2010
ACM
172views Algorithms» more  SODA 2010»
16 years 3 months ago
A quasi-polynomial time approximation scheme for Euclidean capacitated vehicle routing
In the capacitated vehicle routing problem, introduced by Dantzig and Ramser in 1959, we are given the locations of n customers and a depot, along with a vehicle of capacity k, an...
Aparna Das, Claire Mathieu
ICPR
2008
IEEE
16 years 29 days ago
An approach for video cut detection using bipartite graph matching as dissimilarity distance
The video segmentation problem consists in the identification of the boundary between consecutive shots. When two consecutive frames are similar, they are considered to be in the...
Silvio Jamil Ferzoli Guimarães, Zenilton Kl...