459 search results - page 73 / 92 » Computational Complexity of Probabilistic Disambiguation |
104
click to vote
BMCBI
2007
14 years 11 months ago
2007
Background: A key challenge in metabonomics is to uncover quantitative associations between multidimensional spectroscopic data and biochemical measures used for disease risk asse...
101
click to vote
WWW
2008
ACM
16 years 12 days ago
2008
ACM
Motivated by several marketplace applications on rapidly growing online social networks, we study the problem of efficient offline matching algorithms for online exchange markets....
STOC
2002
ACM
16 years 10 hour ago
2002
ACM
The notion of efficient computation is usually identified in cryptography and complexity with (strict) probabilistic polynomial time. However, until recently, in order to obtain c...
178
click to vote
VLDB
2007
ACM
15 years 12 months ago
2007
ACM
Estimating the cardinality (i.e. number of distinct elements) of an arbitrary set expression defined over multiple distributed streams is one of the most fundamental queries of in...
TACAS
2010
Springer
15 years 6 months ago
2010
Springer
Deciding whether a modal formula is satisfiable with respect to a given set of (global) assumptions is a question of fundamental importance in applications of logic in computer sc...