Sciweavers

101 search results - page 19 / 21
» Domination Problems in Nowhere-Dense Classes
Sort
View
BMCBI
2005
114views more  BMCBI 2005»
13 years 7 months ago
A new decoding algorithm for hidden Markov models improves the prediction of the topology of all-beta membrane proteins
Background: Structure prediction of membrane proteins is still a challenging computational problem. Hidden Markov models (HMM) have been successfully applied to the problem of pre...
Piero Fariselli, Pier Luigi Martelli, Rita Casadio
GECCO
2004
Springer
127views Optimization» more  GECCO 2004»
14 years 22 days ago
Computational Complexity and Simulation of Rare Events of Ising Spin Glasses
We discuss the computational complexity of random 2D Ising spin glasses, which represent an interesting class of constraint satisfaction problems for black box optimization. Two ex...
Martin Pelikan, Jiri Ocenasek, Simon Trebst, Matth...
JAIR
2008
103views more  JAIR 2008»
13 years 7 months ago
SATzilla: Portfolio-based Algorithm Selection for SAT
It has been widely observed that there is no single "dominant" SAT solver; instead, different solvers perform best on different instances. Rather than following the trad...
Lin Xu, Frank Hutter, Holger H. Hoos, Kevin Leyton...
WWW
2002
ACM
14 years 8 months ago
A graphical user interface toolkit approach to thin-client computing
Network and server-centric computing paradigms are quickly returning to being the dominant methods by which we use computers. Web applications are so prevalent that the role of a ...
Simon Lok, Steven Feiner, William M. Chiong, Yoav ...
SIGMOD
2007
ACM
159views Database» more  SIGMOD 2007»
14 years 7 months ago
Boosting topic-based publish-subscribe systems with dynamic clustering
We consider in this paper a class of Publish-Subscribe (pub-sub) systems called topic-based systems, where users subscribe to topics and are notified on events that belong to thos...
Tova Milo, Tal Zur, Elad Verbin