Sciweavers

1671 search results - page 82 / 335
» On the Covering Steiner Problem
Sort
View
136
Voted
TCBB
2011
14 years 7 months ago
A Partial Set Covering Model for Protein Mixture Identification Using Mass Spectrometry Data
—Protein identification is a key and essential step in mass spectrometry (MS) based proteome research. To date, there are many protein identification strategies that employ eithe...
Zengyou He, Can Yang, Weichuan Yu
IJCGA
1998
74views more  IJCGA 1998»
15 years 12 days ago
Polyhedral Assembly Partitioning Using Maximally Covered Cells in Arrangements of Convex Polytopes
We study the following problem: Given a collection A of polyhedral parts in 3D, determine whether there exists a subset S of the parts that can be moved as a rigid body by in nite...
Leonidas J. Guibas, Dan Halperin, Hirohisa Hirukaw...
IPCO
2007
77views Optimization» more  IPCO 2007»
15 years 2 months ago
Mixed-Integer Vertex Covers on Bipartite Graphs
Let A be the edge-node incidence matrix of a bipartite graph G = (U, V ; E), I be a subset the nodes of G, and b be a vector such that 2b is integral. We consider the following mi...
Michele Conforti, Bert Gerards, Giacomo Zambelli
WSCG
2004
120views more  WSCG 2004»
15 years 2 months ago
Voxelization of Solids Using Simplicial Coverings
Rasterization of polygons in 2D is a well known problem, existing several optimal solutions to solve it. The extension of this problem to 3D is more difficult and most existing so...
Antonio J. Rueda Ruiz, Rafael Jesús Segura,...
114
Voted
ESA
2001
Springer
132views Algorithms» more  ESA 2001»
15 years 5 months ago
Greedy Algorithms for Minimisation Problems in Random Regular Graphs
In this paper we introduce a general strategy for approximating the solution to minimisation problems in random regular graphs. We describe how the approach can be applied to the m...
Michele Zito