917 search results - page 87 / 184 » Comparison of Data Structures for Computing Formal Concepts |
COMPUTING
2008
14 years 10 months ago
2008
We introduce two data-structural transformations to construct doubleended priority queues from priority queues. To apply our transformations the priority queues exploited must sup...
BMCBI
2010
14 years 10 months ago
2010
Background: Comprehensively understanding corticosteroid pharmacogenomic effects is an essential step towards an insight into the underlying molecular mechanisms for both benefici...
BMCBI
2008
14 years 10 months ago
2008
Background: The development and improvement of reliable computational methods designed to evaluate the quality of protein models is relevant in the context of protein structure re...
PVLDB
2010
14 years 8 months ago
2010
Entity linkage is central to almost every data integration and data cleaning scenario. Traditional techniques use some computed similarity among data structure to perform merges a...
167
click to vote
POPL
2006
ACM
15 years 10 months ago
2006
ACM
In POPL 2002, Petrank and Rawitz showed a universal result-finding optimal data placement is not only NP-hard but also impossible to approximate within a constant factor if P = NP...