Sciweavers

2542 search results - page 236 / 509
» Computing Cartograms with Optimal Complexity
Sort
View
BMCBI
2007
115views more  BMCBI 2007»
15 years 19 days ago
Recognizing protein-protein interfaces with empirical potentials and reduced amino acid alphabets
Background: In structural genomics, an important goal is the detection and classification of protein–protein interactions, given the structures of the interacting partners. We h...
Guillaume Launay, Raul Mendez, Shoshana J. Wodak, ...
ATAL
2008
Springer
15 years 2 months ago
Solving two-person zero-sum repeated games of incomplete information
In repeated games with incomplete information, rational agents must carefully weigh the tradeoffs of advantageously exploiting their information to achieve a short-term gain versu...
Andrew Gilpin, Tuomas Sandholm
ICIP
2007
IEEE
15 years 7 months ago
Buffer Constrained Proactive Dynamic Voltage Scaling for Video Decoding Systems
Significant power savings can be achieved on voltage/frequency configurable platforms by dynamically adapting the frequency and voltage according to the workload (complexity). Vid...
Emrah Akyol, Mihaela van der Schaar
65
Voted
EDBT
2009
ACM
100views Database» more  EDBT 2009»
15 years 5 months ago
A view selection algorithm with performance guarantee
A view selection algorithm takes as input a fact table and computes a set of views to store in order to speed up queries. The performance of view selection algorithm is usually me...
Nicolas Hanusse, Sofian Maabout, Radu Tofan
105
Voted
FSTTCS
2006
Springer
15 years 4 months ago
Some Results on Average-Case Hardness Within the Polynomial Hierarchy
Abstract. We prove several results about the average-case complexity of problems in the Polynomial Hierarchy (PH). We give a connection among average-case, worst-case, and non-unif...
Aduri Pavan, Rahul Santhanam, N. V. Vinodchandran