Sciweavers

643 search results - page 49 / 129
» Merge-Based Computation of Minimal Generators
Sort
View
DAM
2000
137views more  DAM 2000»
13 years 8 months ago
Solving the feedback vertex set problem on undirected graphs
Feedback problems consist of removing a minimal number of vertices of a directed or undirected graph in order to make it acyclic. The problem is known to be NPcomplete. In this pa...
Lorenzo Brunetta, Francesco Maffioli, Marco Trubia...
4OR
2008
115views more  4OR 2008»
13 years 7 months ago
A branch-and-price algorithm for the two-dimensional level strip packing problem
The two-dimensional level strip packing problem (2LSPP) consists in packing rectangular items of given size into a strip of given width divided into levels. Items packed into the ...
Andrea Bettinelli, Alberto Ceselli, Giovanni Righi...
CORR
2010
Springer
189views Education» more  CORR 2010»
13 years 7 months ago
Robust PCA via Outlier Pursuit
Singular Value Decomposition (and Principal Component Analysis) is one of the most widely used techniques for dimensionality reduction: successful and efficiently computable, it ...
Huan Xu, Constantine Caramanis, Sujay Sanghavi
MICCAI
2010
Springer
13 years 7 months ago
Non-parametric Iterative Model Constraint Graph min-cut for Automatic Kidney Segmentation
We present a new non-parametric model constraint graph min-cut algorithm for automatic kidney segmentation in CT images. The segmentation is formulated as a maximum a-posteriori es...
Moti Freiman, A. Kronman, S. J. Esses, Leo Joskowi...
PVLDB
2010
135views more  PVLDB 2010»
13 years 7 months ago
P2PDocTagger: Content management through automated P2P collaborative tagging
As the amount of user generated content grows, personal information management has become a challenging problem. Several information management approaches, such as desktop search,...
Hock Hee Ang, Vivekanand Gopalkrishnan, Wee Keong ...