1461 search results - page 230 / 293 » Complexity of Graph Covering Problems |
137
click to vote
ISMB
2000
15 years 2 months ago
2000
Several microarray technologies that monitor the level of expression of a large number of genes have recently emerged. Given DNA-microarray data for a set of cells characterized b...
106
click to vote
RECOMB
2007
Springer
16 years 1 months ago
2007
Springer
Molecular interaction databases can be used to study the evolution of molecular pathways across species. Querying such pathways is a challenging computational problem, and recent e...
112
click to vote
ICDM
2009
IEEE
15 years 8 months ago
2009
IEEE
— Redistricting is the process of dividing a geographic area into districts or zones. This process has been considered in the past as a problem that is computationally too comple...
146
click to vote
IEEEMSP
2002
IEEE
15 years 6 months ago
2002
IEEE
—This paper presents an operational rate-distortion (ORD) optimal approach for skeleton-based boundary encoding. The boundary information is first decomposed into skeleton and di...
100
click to vote
AI
2002
Springer
15 years 1 months ago
2002
Springer
Systems provide a rich abstraction within which divers concepts of reasoning, acceptability and defeasibility of arguments, etc., may be studied using a unified framework. Two imp...