Sciweavers

406 search results - page 10 / 82
» Identifying Codes and Covering Problems
Sort
View
TCBB
2011
13 years 3 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»
13 years 8 months 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...
WCRE
1996
IEEE
14 years 27 days ago
Identifying Enumeration Types Modeled with Symbolic Constants
An important challenge in software reengineering is to encapsulate collections of related data that, due to the absence of appropriate constructs for encapsulation in legacy progr...
John M. Gravley, Arun Lakhotia
SP
2007
IEEE
107views Security Privacy» more  SP 2007»
14 years 3 months ago
Lurking in the Shadows: Identifying Systemic Threats to Kernel Data
The integrity of kernel code and data is fundamental to the integrity of the computer system. Tampering with the kernel data is an attractive venue for rootkit writers since malic...
Arati Baliga, Pandurang Kamat, Liviu Iftode
FSTTCS
2009
Springer
14 years 3 months ago
Covering of ordinals
The paper focuses on the structure of fundamental sequences of ordinals smaller than ε0. A first result is the construction of a monadic second-order formula identifying a given ...
Laurent Braud