254 search results - page 39 / 51 » On the randomized solution of initial value problems |
STOC
2010
ACM
14 years 13 days ago
2010
ACM
The Steiner tree problem is one of the most fundamental ÆÈ-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum weight tree spanning ...
CORR
2002
Springer
13 years 7 months ago
2002
Springer
: We study the satisfiability of randomly generated formulas formed by M clauses of exactly K literals over N Boolean variables. For a given value of N the problem is known to be m...
TMM
2002
13 years 7 months ago
2002
Modeling spatial context (e.g., autocorrelation) is a key challenge in classification problems that arise in geospatial domains. Markov random fields (MRF) is a popular model for i...
PODC
2009
ACM
14 years 2 months ago
2009
ACM
We study communication complexity of consensus in synchronous message-passing systems with processes prone to crashes. The goal in the consensus problem is to have all the nonfaul...
ICPP
2009
IEEE
14 years 2 months ago
2009
IEEE
—Recent advances in DNA sequencing techniques have led to an unprecedented accumulation and availability of molecular sequence data that needs to be analyzed. This data explosion...