28888 search results - page 312 / 5778 » Computability and complexity in analysis |
256
click to vote
PODC
2011
ACM
14 years 9 months ago
2011
ACM
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
179
Voted
BMCBI
2007
15 years 6 months ago
2007
Background: Systematic, high-throughput studies of mouse phenotypes have been hampered by the inability to analyze individual animal data from a multitude of sources in an integra...
158
click to vote
STOC
2002
ACM
16 years 7 months ago
2002
ACM
This paper considers the problem of dualizing a monotone CNF (equivalently, computing all minimal transversals of a hypergraph), whose associated decision problem is a prominent o...
191
click to vote
ACSD
2008
IEEE
16 years 1 months ago
2008
IEEE
In recent years it has become clear that techniques developed for concurrent programming are in fact very useful for the analysis of complex systems in biology. To some level of i...
169
click to vote
DATE
2009
IEEE
16 years 1 months ago
2009
IEEE
Abstract—High computational effort in modern image processing applications like medical imaging or high-resolution video processing often demands for massively parallel special p...