Sciweavers

830 search results - page 146 / 166
» Approximation power of directionlets
Sort
View
WABI
2009
Springer
129views Bioinformatics» more  WABI 2009»
14 years 3 months ago
biRNA: Fast RNA-RNA Binding Sites Prediction
We present biRNA, a novel algorithm for prediction of binding sites between two RNAs based on minimization of binding free energy. Similar to RNAup approach [30], we assume the bin...
Hamidreza Chitsaz, Rolf Backofen, Süleyman Ce...
ISVC
2009
Springer
14 years 3 months ago
Fast Occlusion Sweeping
While realistic illumination significantly improves the visual quality and perception of rendered images, it is often very expensive to compute. In this paper, we propose a new al...
Mayank Singh, Cem Yuksel, Donald H. House
FOCS
2008
IEEE
14 years 3 months ago
Beating the Random Ordering is Hard: Inapproximability of Maximum Acyclic Subgraph
We prove that approximating the Max Acyclic Subgraph problem within a factor better than 1/2 is Unique-Games hard. Specifically, for every constant ε > 0 the following holds:...
Venkatesan Guruswami, Rajsekar Manokaran, Prasad R...
SECON
2008
IEEE
14 years 3 months ago
Optimal Buffer Management Policies for Delay Tolerant Networks
—Delay Tolerant Networks are wireless networks where disconnections may occur frequently due to propagation phenomena, node mobility, and power outages. Propagation delays may al...
Amir Krifa, Chadi Barakat, Thrasyvoulos Spyropoulo...
ATAL
2007
Springer
14 years 2 months ago
Commitment-driven distributed joint policy search
Decentralized MDPs provide powerful models of interactions in multi-agent environments, but are often very difficult or even computationally infeasible to solve optimally. Here we...
Stefan J. Witwicki, Edmund H. Durfee