2412 search results - page 119 / 483 » Which Problems Have Strongly Exponential Complexity |
160
Voted
BMCBI
2008
15 years 3 months ago
2008
Background: Ontologies such as the Gene Ontology can enable the construction of complex queries over biological information in a conceptual way, however existing systems to do thi...
136
click to vote
ECBS
2006
IEEE
15 years 9 months ago
2006
IEEE
Complex and distributed systems are more and more common. Hardware is going from strength to strength and is embedded in high performance peer-to-peer networks mostly. The task of...
133
click to vote
SDM
2009
SIAM
16 years 15 days ago
2009
SIAM
Mining sequential movement patterns describing group behaviour in potentially streaming spatio-temporal data sets is a challenging problem. Movements are typically noisy and often...
126
click to vote
STOC
2010
ACM
15 years 8 months ago
2010
ACM
In STOC’05, von Ahn, Hopper and Langford introduced the notion of covert computation. In covert computation, a party runs a secure computation protocol over a covert (or stegano...
149
Voted
NIPS
2007
15 years 4 months ago
2007
We present a novel message passing algorithm for approximating the MAP problem in graphical models. The algorithm is similar in structure to max-product but unlike max-product it ...