3212 search results - page 371 / 643 » Faster Concept Analysis |
151
click to vote
SDM
2007
SIAM
15 years 6 months ago
2007
SIAM
Given a large sparse graph, how can we find patterns and anomalies? Several important applications can be modeled as large sparse graphs, e.g., network traffic monitoring, resea...
139
click to vote
DAGSTUHL
2006
15 years 6 months ago
2006
This paper presents novel language and analysis techniques that significantly speed up software model checking of data structure properties. Consider checking a red-black tree imp...
153
click to vote
FOCS
2008
IEEE
15 years 6 months ago
2008
IEEE
Given a universe U of n elements and a weighted collection S of m subsets of U, the universal set cover problem is to a-priori map each element u ∈ U to a set S(u) ∈ S contain...
150
Voted
BMCBI
2008
15 years 5 months ago
2008
Background: The integration of biomedical information is essential for tackling medical problems. We describe a data model in the domain of flow cytometry (FC) allowing for massiv...
158
click to vote
BMCBI
2007
15 years 5 months ago
2007
Background: We investigate the empirical complexity of the RNA secondary structure design problem, that is, the scaling of the typical difficulty of the design task for various cl...