Sciweavers

2370 search results - page 67 / 474
» A Structured Set of Higher-Order Problems
Sort
View
VISUALIZATION
2002
IEEE
14 years 1 months ago
Level-Set Segmentation From Multiple Non-Uniform Volume Datasets
Typically 3-D MR and CT scans have a relatively high resolution in the scanning X;Y plane, but much lower resolution in the axial Z direction. This non-uniform sampling of an obje...
Ken Museth, David E. Breen, Leonid Zhukov, Ross T....
APPROX
2009
Springer
195views Algorithms» more  APPROX 2009»
14 years 3 months ago
Approximating Node-Connectivity Augmentation Problems
The (undirected) Node Connectivity Augmentation (NCA) problem is: given a graph J = (V, EJ ) and connectivity requirements {r(u, v) : u, v ∈ V }, find a minimum size set I of n...
Zeev Nutov
CPM
2006
Springer
145views Combinatorics» more  CPM 2006»
14 years 20 days ago
Approximation of RNA Multiple Structural Alignment
Abstract. In the context of non-coding RNA (ncRNA) multiple structural alignment, Davydov and Batzoglou introduced in [7] the problem of finding the largest nested linear graph tha...
Marcin Kubica, Romeo Rizzi, Stéphane Vialet...
LION
2007
Springer
198views Optimization» more  LION 2007»
14 years 3 months ago
Multiobjective Landscape Analysis and the Generalized Assignment Problem
The importance of tuning a search algorithm for the specific features of the target search space has been known for quite some time. However, when dealing with multiobjective prob...
Deon Garrett, Dipankar Dasgupta
COMGEO
2010
ACM
13 years 9 months ago
Approximation algorithm for the kinetic robust K-center problem
Clustering is an important problem and has numerous applications. In this paper we consider an important clustering problem, called the k-center problem. We are given a discrete p...
Sorelle A. Friedler, David M. Mount