Sciweavers

13603 search results - page 2708 / 2721
» On the Complexity of Computing Treelength
Sort
View
JACM
2006
99views more  JACM 2006»
13 years 9 months ago
Finding a maximum likelihood tree is hard
Abstract. Maximum likelihood (ML) is an increasingly popular optimality criterion for selecting evolutionary trees [Felsenstein 1981]. Finding optimal ML trees appears to be a very...
Benny Chor, Tamir Tuller
JAIR
2006
134views more  JAIR 2006»
13 years 9 months ago
Multi-Issue Negotiation with Deadlines
This paper studies bilateral multi-issue negotiation between self-interested autonomous agents. Now, there are a number of different procedures that can be used for this process; ...
S. Shaheen Fatima, Michael Wooldridge, Nicholas R....
JCB
2006
107views more  JCB 2006»
13 years 9 months ago
Maximum Likelihood Molecular Clock Comb: Analytic Solutions
Maximum likelihood (ML) is increasingly used as an optimality criterion for selecting evolutionary trees, but finding the global optimum is a hard computational task. Because no g...
Benny Chor, Amit Khetan, Sagi Snir
JCB
2006
185views more  JCB 2006»
13 years 9 months ago
A Probabilistic Methodology for Integrating Knowledge and Experiments on Biological Networks
Biological systems are traditionally studied by focusing on a specific subsystem, building an intuitive model for it, and refining the model using results from carefully designed ...
Irit Gat-Viks, Amos Tanay, Daniela Raijman, Ron Sh...
JRTIP
2008
118views more  JRTIP 2008»
13 years 9 months ago
Custom parallel caching schemes for hardware-accelerated image compression
Abstract In an effort to achieve lower bandwidth requirements, video compression algorithms have become increasingly complex. Consequently, the deployment of these algorithms on Fi...
Su-Shin Ang, George A. Constantinides, Wayne Luk, ...
« Prev « First page 2708 / 2721 Last » Next »