Sciweavers

3658 search results - page 294 / 732
» Founding properties on measurement
Sort
View
ALGORITHMICA
1999
99views more  ALGORITHMICA 1999»
15 years 6 months ago
Evolutionary Trees and Ordinal Assertions
Sequence data for a group of species is often summarized by a distance matrix M where M[s, t] is the dissimilarity between the sequences of species s and t. An ordinal assertion is...
Paul E. Kearney, Ryan Hayward, Henk Meijer
SAGT
2010
Springer
160views Game Theory» more  SAGT 2010»
15 years 5 months ago
How Do You Like Your Equilibrium Selection Problems? Hard, or Very Hard?
The PPAD-completeness of Nash equilibrium computation is taken as evidence that the problem is computationally hard in the worst case. This evidence is necessarily rather weak, in ...
Paul W. Goldberg
ASPLOS
2011
ACM
14 years 10 months ago
Specifying and checking semantic atomicity for multithreaded programs
In practice, it is quite difficult to write correct multithreaded programs due to the potential for unintended and nondeterministic interference between parallel threads. A funda...
Jacob Burnim, George C. Necula, Koushik Sen
BMCBI
2007
133views more  BMCBI 2007»
15 years 6 months ago
AGGRESCAN: a server for the prediction and evaluation of "hot spots" of aggregation in polypeptides
Background: Protein aggregation correlates with the development of several debilitating human disorders of growing incidence, such as Alzheimer's and Parkinson's disease...
Oscar Conchillo-Solé, Natalia S. de Groot, ...
JSAC
2006
112views more  JSAC 2006»
15 years 6 months ago
Network Kriging
ABSTRACT. Network service providers and customers are often concerned with aggregate performance measures that span multiple network paths. Unfortunately, forming such network-wide...
David B. Chua, Eric D. Kolaczyk, Mark Crovella