Sciweavers

952 search results - page 144 / 191
» Computational complexity of stochastic programming problems
Sort
View
100
Voted
ICALP
2010
Springer
15 years 4 months ago
Parameterized Modal Satisfiability
We investigate the parameterized computational complexity of the satisfiability problem for modal logic and attempt to pinpoint relevant structural parameters which cause the probl...
Antonis Achilleos, Michael Lampis, Valia Mitsou
ESWS
2010
Springer
15 years 6 months ago
Scalable and Parallel Reasoning in the Semantic Web
Abstract. The current state of the art regarding scalable reasoning consists of programs that run on a single machine. When the amount of data is too large, or the logic is too com...
Jacopo Urbani
123
Voted
INFOCOM
2009
IEEE
15 years 9 months ago
On Fast Optimal STDMA Scheduling over Fading Wireless Channels
—Most prior studies on wireless spatial-reuse TDMA (STDMA) link scheduling for throughput optimization deal with the situation where instantaneous channel state information (CSI)...
JiaLiang Zhang, Soung Chang Liew, Liqun Fu
125
Voted
SIGIR
2006
ACM
15 years 8 months ago
AggregateRank: bringing order to web sites
Since the website is one of the most important organizational structures of the Web, how to effectively rank websites has been essential to many Web applications, such as Web sear...
Guang Feng, Tie-Yan Liu, Ying Wang, Ying Bao, Zhim...
BMCBI
2008
132views more  BMCBI 2008»
15 years 2 months ago
Clustering ionic flow blockade toggles with a Mixture of HMMs
Background: Ionic current blockade signal processing, for use in nanopore detection, offers a promising new way to analyze single molecule properties with potential implications f...
Alexander G. Churbanov, Stephen Winters-Hilt