Sciweavers

2060 search results - page 154 / 412
» Some Applications of Coding Theory in Computational Complexi...
Sort
View
BMCBI
2011
14 years 1 months ago
NeurphologyJ: an automatic neuronal morphology quantification method and its application in pharmacological discovery
Background: Automatic quantification of neuronal morphology from images of fluorescence microscopy plays an increasingly important role in high-content screenings. However, there ...
Shinn-Ying Ho, Chih-Yuan Chao, Hui-Ling Huang, Tza...
ICS
2010
Tsinghua U.
15 years 7 months ago
Non-Malleable Codes
We introduce the notion of "non-malleable codes" which relaxes the notion of error-correction and errordetection. Informally, a code is non-malleable if the message cont...
Stefan Dziembowski, Krzysztof Pietrzak, Daniel Wic...
STOC
2005
ACM
104views Algorithms» more  STOC 2005»
15 years 10 months ago
Beyond NP: the work and legacy of Larry Stockmeyer
Shortly after Steven Cook and Richard Karp showed the existence of many natural NP-complete languages, researchers started to realize the great importance of the P versus NP probl...
Lance Fortnow
DSN
2007
IEEE
15 years 4 months ago
Assessing Robustness of Web-Services Infrastructures
Web-services are supported by a complex software infrastructure that must provide a robust service to the client applications. This practical experience report presents a practica...
Marco Vieira, Nuno Laranjeiro, Henrique Madeira
ECSQARU
1997
Springer
15 years 1 months ago
Creating Prototypes for Fast Classification in Dempster-Shafer Clustering
We develop a classification method for incoming pieces of evidence in Dempster-Shafer theory. This methodology is based on previous work with clustering and specification of origin...
Johan Schubert