Sciweavers

2542 search results - page 475 / 509
» Computing Cartograms with Optimal Complexity
Sort
View
CIDR
2003
106views Algorithms» more  CIDR 2003»
13 years 10 months ago
Speculative Query Processing
Speculation is an every day phenomenon whereby one acts in anticipation of particular conditions that are likely to hold in the future. Computer science research has seen many suc...
Neoklis Polyzotis, Yannis E. Ioannidis
CORR
2008
Springer
118views Education» more  CORR 2008»
13 years 9 months ago
The price of certainty: "waterslide curves" and the gap to capacity
The classical problem of reliable point-to-point digital communication is to achieve a low probability of error while keeping the rate high and the total power consumption small. ...
Anant Sahai, Pulkit Grover
BMCBI
2006
138views more  BMCBI 2006»
13 years 9 months ago
Approximation properties of haplotype tagging
Background: Single nucleotide polymorphisms (SNPs) are locations at which the genomic sequences of population members differ. Since these differences are known to follow patterns,...
Staal A. Vinterbo, Stephan Dreiseitl, Lucila Ohno-...
JAIR
2006
134views more  JAIR 2006»
13 years 8 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 8 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